Back to institutions
University of Technology Sydney
- Overall Rank
- 85 | 96.85%
- Pagerank
- 0.55153446
- Paper Count
- 70
Authors at This Institution
Listed authors are those whose most frequent affiliation is this institution.
Showing 13 of 13 authors.
| Rank |
Author |
Pagerank |
Papers |
| 72 |
Lu Qin
|
0.44871453 |
56 |
| 103 |
Ying Zhang
|
0.38185767 |
48 |
| 947 |
Wentao Li
|
0.070289638 |
11 |
| 4,091 |
Junhua Zhang
|
0.020097382 |
3 |
| 4,118 |
Lantian Xu
|
0.020004348 |
3 |
| 4,295 |
Yanping Wu
|
0.019606842 |
3 |
| 4,800 |
Chengqi Zhang
|
0.016997627 |
2 |
| 6,895 |
Jinghao Wang
|
0.013130293 |
2 |
| 9,004 |
Rong Hu
|
0.008797982 |
1 |
| 12,355 |
Longbing Cao
|
0.0069946833 |
1 |
| 13,587 |
Guandong Xu
|
0.0067635233 |
1 |
| 15,151 |
Jianke Yu
|
0.006576809 |
1 |
| 16,812 |
Yang Lu
|
0.0064765487 |
1 |
Papers with at Least One Affiliated Author
Showing 20 of 70 papers, sorted by pagerank.
| Rank |
Paper |
Year |
Venue |
Pagerank |
| 8,544 |
A Temporal Context-Aware Model for User Behavior Modeling in Social Media Systems
|
2014 |
SIGMOD |
4.4937074e-05 |
| 8,903 |
Efficient Influence Minimization via Node Blocking
|
2024 |
VLDB |
4.427232e-05 |
| 9,239 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs
|
2024 |
VLDB |
4.3690661e-05 |
| 9,308 |
Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates
|
2015 |
SIGMOD |
4.3571035e-05 |
| 9,405 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy
|
2024 |
SIGMOD |
4.3441378e-05 |
| 9,553 |
Deep Overlapping Community Search via Subspace Embedding
|
2025 |
SIGMOD |
4.3254416e-05 |
| 9,626 |
Divide & Conquer: I/O Efficient Depth-First Search
|
2015 |
SIGMOD |
4.314762e-05 |
| 9,952 |
On Scalable Computation of Graph Eccentricities
|
2022 |
SIGMOD |
4.2405999e-05 |
| 10,120 |
Time-Critical Influence Minimization via Node Blocking
|
2026 |
SIGMOD |
4.1945683e-05 |
| 10,157 |
Efficient and Effective Biclique Counting with Local Differential Privacy
|
2026 |
SIGMOD |
4.1945683e-05 |
| 10,373 |
Density Decomposition of Bipartite Graphs
|
2025 |
SIGMOD |
4.1945683e-05 |
| 10,383 |
Minimum Spanning Tree Maintenance in Dynamic Graphs
|
2025 |
SIGMOD |
4.1945683e-05 |
| 10,490 |
Integral Densest Subgraph Search on Directed Graphs
|
2025 |
SIGMOD |
4.1945683e-05 |
| 10,843 |
Machine Learning for Graph Data Management and Query Processing
|
2025 |
VLDB |
4.1945683e-05 |
| 10,964 |
Graph Summarization: Compactness Meets Efficiency
|
2024 |
SIGMOD |
4.1945683e-05 |
| 10,985 |
Constant-time Connectivity Querying in Dynamic Graphs
|
2024 |
SIGMOD |
4.1945683e-05 |
| 11,060 |
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
|
2024 |
VLDB |
4.1945683e-05 |
| 11,065 |
Efficient kNN Search in Public Transportation Networks
|
2024 |
VLDB |
4.1945683e-05 |
| 11,141 |
Expanding Reverse Nearest Neighbors
|
2024 |
VLDB |
4.1945683e-05 |
| 11,961 |
Leveraging Graph Dimensions in Online Graph Search
|
2015 |
VLDB |
4.1945683e-05 |