University of New South Wales

Overall Rank: 35 | 98.73%
Pagerank: 1.2582827
Paper Count: 165

Authors at This Institution

Listed authors are those whose most frequent affiliation is this institution.

Showing 9 of 59 authors.

Rank	Author	Papers
19,466	John Shepherd	2
19,467	Quan Z. Sheng	2
20,232	Mingchen Ju	1
20,612	Eileen Oi-Yan Mak	1
20,675	Karim Baïna	1
20,678	Agnieszka Rutkowska	1
20,679	Bryan Harianto	1
20,680	Halvard Skogsrud	1
20,681	Manh Q. Dinh	1

Papers with at Least One Affiliated Author

Showing 50 of 165 papers, sorted by pagerank.

Rank	Paper	Year	Venue	Pagerank
9,229	Reverse k Nearest Neighbors Query Processing: Experiments and Analysis	2015	VLDB	5.3600257e-05
9,261	Happiness Maximizing Sets under Group Fairness Constraints	2023	VLDB	5.3572494e-05
9,406	Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy	2024	SIGMOD	5.3341578e-05
9,473	Revisiting Graph Analytics Benchmark	2025	SIGMOD	5.3246495e-05
9,479	I/O Efficient Label-Constrained Reachability Queries in Large Graphs	2024	VLDB	5.3246495e-05
9,536	High-Ratio Compression for Machine-Generated Data	2023	SIGMOD	5.3179937e-05
9,547	Deep Overlapping Community Search via Subspace Embedding	2025	SIGMOD	5.3161977e-05
9,649	Selectivity Estimation for Queries Containing Predicates over Set-Valued Attributes	2023	SIGMOD	5.3001286e-05
9,677	Multiscale Histograms: Summarizing Topological Relations in Large Spatial Datasets	2003	VLDB	5.2934373e-05
9,933	MAVIS: Materialized View for Subgraph Matching	2026	SIGMOD	5.2371732e-05
9,934	Local Filtering: Improving the Performance of Approximate Queries on String Collections	2015	SIGMOD	5.2359463e-05
9,951	On Scalable Computation of Graph Eccentricities	2022	SIGMOD	5.2268499e-05
10,082	Gem: Scalable Monotonic Graph Processing Beyond Billion-Scale on a Single Machine	2026	SIGMOD	5.1725167e-05
10,120	Time-Critical Influence Minimization via Node Blocking	2026	SIGMOD	5.1725167e-05
10,123	Triangle Counting in Hypergraph Streams: A Complete and Practical Approach	2026	SIGMOD	5.1725167e-05
10,139	An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis]	2026	SIGMOD	5.1725167e-05
10,157	Efficient and Effective Biclique Counting with Local Differential Privacy	2026	SIGMOD	5.1725167e-05
10,171	High-Throughput k Nearest Neighbors Search in Road Networks	2026	SIGMOD	5.1725167e-05
10,232	Efficient Temporal Subgraph Management: A New Interval Index	2026	VLDB	5.1725167e-05
10,264	CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination	2026	VLDB	5.1725167e-05
10,320	Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching	2026	VLDB	5.1725167e-05
10,334	Understanding Evolving Graph Structures for Large Discrete-Time Dynamic Graph Representation	2026	VLDB	5.1725167e-05
10,395	Minimum Spanning Tree Maintenance in Dynamic Graphs	2025	SIGMOD	5.1725167e-05
10,478	AJOSC: Adaptive Join Order Selection for Continuous Queries	2025	SIGMOD	5.1725167e-05
10,539	Most Similar Biclique Search at Scale	2025	VLDB	5.1725167e-05
10,598	ACE: A Cardinality Estimator for Set-Valued Queries	2025	VLDB	5.1725167e-05
10,640	Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach	2025	VLDB	5.1725167e-05
10,683	On LLM-Enhanced Mixed-Type Data Imputation with High-Order Message Passing	2025	VLDB	5.1725167e-05
10,708	LogLite: Lightweight Plug-and-Play Streaming Log Compression	2025	VLDB	5.1725167e-05
10,712	Fremer: Lightweight and Effective Frequency Transformer for Workload Forecasting in Cloud Services	2025	VLDB	5.1725167e-05
10,847	Machine Learning for Graph Data Management and Query Processing	2025	VLDB	5.1725167e-05
10,875	Efficient Computation of Hyper-triangles on Hypergraphs	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,008	Influence Maximization via Vertex Countering	2024	VLDB	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,226	Homomorphic Compression: Making Text Processing on Compression Unlimited	2023	SIGMOD	5.1725167e-05
11,259	Efficient Non-Learning Similar Subtrajectory Search	2023	VLDB	5.1725167e-05
11,416	Online Ridesharing with Meeting Points	2022	VLDB	5.1725167e-05
11,473	When the Recursive Diversity Anonymity Meets the Ring Signature	2021	SIGMOD	5.1725167e-05
11,528	An Extensible and Reusable Pipeline for Automated Utterance Paraphrases	2021	VLDB	5.1725167e-05
11,569	Simulation-based Approximate Graph Pattern Matching	2020	SIGMOD	5.1725167e-05
11,574	Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query	2020	SIGMOD	5.1725167e-05
11,602	IDAR: Fast Supergraph Search Using DAG Integration	2020	VLDB	5.1725167e-05
11,739	CoreKG: a Knowledge Lake Service	2018	VLDB	5.1725167e-05
12,049	I/O Efficient: Computing SCCs in Massive Graphs	2013	SIGMOD	5.1725167e-05
12,110	Deterministic Regular Expressions in Linear Time	2012	PODS	5.1725167e-05
12,226	A Learning Algorithm for Top-Down XML Transformations	2010	PODS	5.1725167e-05