University of Technology Sydney

Overall Rank: 84 | 96.91%
Pagerank: 0.58792806
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
66	Ying Zhang	0.49284523	60
70	Lu Qin	0.47583811	56
918	Wentao Li	0.077052053	11
3,912	Junhua Zhang	0.022237994	3
3,971	Lantian Xu	0.022099193	3
4,142	Yanping Wu	0.021737702	3
4,706	Chengqi Zhang	0.017580557	2
6,622	Jinghao Wang	0.014545681	2
8,716	Rong Hu	0.0091197802	1
12,714	Longbing Cao	0.0075430553	1
13,356	Guandong Xu	0.0074582133	1
15,066	Jianke Yu	0.007291226	1
16,718	Yang Lu	0.0071920211	1

Papers with at Least One Affiliated Author

Showing 20 of 70 papers, sorted by pagerank.

Rank	Paper	Year	Venue	Pagerank
8,632	A Temporal Context-Aware Model for User Behavior Modeling in Social Media Systems	2014	SIGMOD	5.4598787e-05
8,929	Efficient Influence Minimization via Node Blocking	2024	VLDB	5.4076311e-05
9,228	Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates	2015	SIGMOD	5.3600257e-05
9,255	Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs	2024	VLDB	5.3572494e-05
9,406	Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy	2024	SIGMOD	5.3341578e-05
9,547	Deep Overlapping Community Search via Subspace Embedding	2025	SIGMOD	5.3161977e-05
9,612	Divide & Conquer: I/O Efficient Depth-First Search	2015	SIGMOD	5.3056329e-05
9,951	On Scalable Computation of Graph Eccentricities	2022	SIGMOD	5.2268499e-05
10,120	Time-Critical Influence Minimization via Node Blocking	2026	SIGMOD	5.1725167e-05
10,157	Efficient and Effective Biclique Counting with Local Differential Privacy	2026	SIGMOD	5.1725167e-05
10,385	Density Decomposition of Bipartite Graphs	2025	SIGMOD	5.1725167e-05
10,395	Minimum Spanning Tree Maintenance in Dynamic Graphs	2025	SIGMOD	5.1725167e-05
10,500	Integral Densest Subgraph Search on Directed Graphs	2025	SIGMOD	5.1725167e-05
10,847	Machine Learning for Graph Data Management and Query Processing	2025	VLDB	5.1725167e-05
10,967	Graph Summarization: Compactness Meets Efficiency	2024	SIGMOD	5.1725167e-05
10,988	Constant-time Connectivity Querying in Dynamic Graphs	2024	SIGMOD	5.1725167e-05
11,063	Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs	2024	VLDB	5.1725167e-05
11,068	Efficient kNN Search in Public Transportation Networks	2024	VLDB	5.1725167e-05
11,144	Expanding Reverse Nearest Neighbors	2024	VLDB	5.1725167e-05
11,969	Leveraging Graph Dimensions in Online Graph Search	2015	VLDB	5.1725167e-05