Back to institutions
University of Technology Sydney
- Overall Rank
- 86 | 97.06%
- Pagerank
- 0.58228183
- 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 |
| 67 |
Ying Zhang
|
0.48777407 |
60 |
| 71 |
Lu Qin
|
0.47146899 |
56 |
| 862 |
Wentao Li
|
0.083089132 |
12 |
| 3,962 |
Junhua Zhang
|
0.022238386 |
3 |
| 4,132 |
Lantian Xu
|
0.021762142 |
3 |
| 4,302 |
Yanping Wu
|
0.021413698 |
3 |
| 4,938 |
Chengqi Zhang
|
0.017279097 |
2 |
| 6,816 |
Jinghao Wang
|
0.014357249 |
2 |
| 9,008 |
Rong Hu
|
0.009055043 |
1 |
| 13,226 |
Longbing Cao
|
0.007400867 |
1 |
| 13,818 |
Guandong Xu
|
0.007324654 |
1 |
| 15,551 |
Jianke Yu
|
0.0071537848 |
1 |
| 17,201 |
Yang Lu
|
0.0070564499 |
1 |
Papers with at Least One Affiliated Author
Showing 20 of 70 papers, sorted by pagerank.
| Rank |
Paper |
Year |
Venue |
Pagerank |
| 8,496 |
Efficient Influence Minimization via Node Blocking
|
2024 |
VLDB |
5.3301662e-05 |
| 8,911 |
A Temporal Context-Aware Model for User Behavior Modeling in Social Media Systems
|
2014 |
SIGMOD |
5.2559789e-05 |
| 9,073 |
Machine Learning for Graph Data Management and Query Processing
|
2025 |
VLDB |
5.2283159e-05 |
| 9,525 |
Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates
|
2015 |
SIGMOD |
5.1662415e-05 |
| 9,571 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs
|
2024 |
VLDB |
5.1571823e-05 |
| 9,735 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy
|
2024 |
SIGMOD |
5.1349531e-05 |
| 9,864 |
Deep Overlapping Community Search via Subspace Embedding
|
2025 |
SIGMOD |
5.1176637e-05 |
| 9,865 |
Density Decomposition of Bipartite Graphs
|
2025 |
SIGMOD |
5.1176637e-05 |
| 9,936 |
Divide & Conquer: I/O Efficient Depth-First Search
|
2015 |
SIGMOD |
5.1074935e-05 |
| 10,256 |
Integral Densest Subgraph Search on Directed Graphs
|
2025 |
SIGMOD |
5.050482e-05 |
| 10,328 |
On Scalable Computation of Graph Eccentricities
|
2022 |
SIGMOD |
5.0333462e-05 |
| 10,600 |
Time-Critical Influence Minimization via Node Blocking
|
2026 |
SIGMOD |
4.9793485e-05 |
| 10,634 |
Efficient and Effective Biclique Counting with Local Differential Privacy
|
2026 |
SIGMOD |
4.9793485e-05 |
| 11,112 |
Minimum Spanning Tree Maintenance in Dynamic Graphs
|
2025 |
SIGMOD |
4.9793485e-05 |
| 11,523 |
Graph Summarization: Compactness Meets Efficiency
|
2024 |
SIGMOD |
4.9793485e-05 |
| 11,540 |
Constant-time Connectivity Querying in Dynamic Graphs
|
2024 |
SIGMOD |
4.9793485e-05 |
| 11,595 |
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
|
2024 |
VLDB |
4.9793485e-05 |
| 11,600 |
Efficient kNN Search in Public Transportation Networks
|
2024 |
VLDB |
4.9793485e-05 |
| 11,665 |
Expanding Reverse Nearest Neighbors
|
2024 |
VLDB |
4.9793485e-05 |
| 12,450 |
Leveraging Graph Dimensions in Online Graph Search
|
2015 |
VLDB |
4.9793485e-05 |