Welcome to Junhao Gan's Homepage

Junhao Gan

Room 2317, Level 2, Melbourne Connect,

School of Computing and Information Systems (CIS),

The University of Melbourne (UoM),

Melbourne, Victoria 3010, Australia

Email:  junhao.gan@unimelb.edu.au 

General

Junhao Gan is a senior lecturer in School of Computing and Information Systems (CIS) at The University of Melbourne (UoM). Before joining the UoM, he was a post-doctoral research fellow in School of Information Technology and Electrical Engineering (ITEE) at The University of Queensland (UQ) from April 2017 to July 2018. He received his PhD degree proudly under the supervision of Prof. Yufei Tao in the same school at UQ in 2017, and obtained his bachelor and master degrees at Sun Yat-Sen University in 2011 and 2013, respectively.

Research Interests

Practical algorithms with non-trivial theoretical guarantees for solving problems on massive data.

Major Awards

Supervisions

There are some PhD openings under Junhao's supervision. Students with strong background on maths, programming, algorithms and data structures are preferred. Applicants will be asked to send to Junhao the full transcripts of all their previous study (including the Bachelor's and/or the Master's).

- Principally Supervised PhD Students -

- Co-Supervised PhD Students -

Professional Services

- Chairmanship Services -

- PC Membership Services -

- Invited Reviewer Services -

- Other Services -

Publications

In publications marked with **, authors are ordered alphabetically, as is a convention of theory papers. In the other publications, authors are ordered by contribution.

2024

Efficient Example-Guided Interactive Graph Search

IEEE International Conference on Data Engineering (ICDE), 2024.

Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks

Proceedings of ACM Conference on Management of Data (SIGMOD), Vol. 1, No. 4, Article 259, 2024


2023 

Managing Conflicting Interests of Stakeholders in Influencer Marketing

Proceedings of ACM Conference on Management of Data (SIGMOD), Volume 1, Issue 1, Article No.: 80, pages 1- 27, 2023.

**Fast Parallel Algorithms for Submodular p-Superseparable Maximization

Workshop on Approximation and Online Algorithms (WAOA), 2023.


2022

Approximate Range Thresholding

Proceedings of ACM Conference on Management of Data (SIGMOD), pages 1108-1121, 2022.

Edge-based Local Push for Personalized PageRank

Proceeding of the VLDB Endowment (PVLDB), page 1376 - 1389, 2022.

Detecting Arbitrary Order Beneficial Feature Interactions for Recommender Systems

Proceedings of ACM Conference on Knowledge Discovery & Data Mining (SIGKDD), pages 1676-1686, 2022.

**An Almost Optimal Algorithm for Unbounded Search with Noisy Information

Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), Article NO. 25, 2022.

2021

Neural Graph Matching Based Collaborative Filtering.

Proceedings of ACM Conference on Information Retrieval (SIGIR),  pages 849-858, 2021.

Dynamic Structural Clustering on Graphs.

Proceedings of ACM Conference on Management of Data (SIGMOD), pages 1491-1503, 2021.

Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push.

Proceedings of ACM Conference on Management of Data (SIGMOD), pages 1996-2008, 2021.

2020

Learning Based Distributed Tracking.  

Proceedings of ACM Conference on Knowledge Discovery & Data Mining (SIGKDD), pages 2040-2050, 2020.

Personalized PageRank to a Target Node, Revisited

Proceedings of ACM Conference on Knowledge Discovery & Data Mining (SIGKDD), pages 657-667, 2020.

Incremental Preference Adjustment: a Graph Theoretical Approach.

The VLDB Journal, August, 2020.

Supplementary Material Official Online Version

**Graph Clustering in All Parameter Regimes.

International Symposium on Mathematical Foundations of Computer Science (MFCS): Article No. 39; pp. 39:1–39:15; 2020.  

Full Version

2019 and Earlier

**Result-Sensitive Binary Search with Noisy Information.

International Symposium on Algorithms and Computation (ISAAC): Article No. 60; pp. 60:1–60:15; 2019.

**An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications.

Journal of Graph Algorithms and Applications (JGAA): Volume 22 Issue 2, pages 297-327, August 2018.

**Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space.

Proceedings of ACM Conference on Management of Data (SIGMOD), pages 1067-1082, 2018.

**On the Hardness and Approximation of Euclidean DBSCAN.

ACM Transactions on Database Systems (TODS): Volume 42 Issue 3, August 2017. (Best papers of SIGMOD 2015)

**Dynamic Density Based Clustering.

Proceedings of ACM Conference on Management of Data (SIGMOD), pages 1493-1507, 2017.

Range Thresholding on Streams.

Proceedings of ACM Conference on Management of Data (SIGMOD), pages 571-582, 2016.

**DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation.

Proceedings of ACM Conference on Management of Data (SIGMOD), pages 519-530, 2015.

(Winner of the Best Paper Award)

See the Homepage of Approximate DBSCAN

Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting

Proceedings of ACM Conference on Management of Data (SIGMOD), pages 541-552, 2012.

Thesis

PhD Thesis, School of Information Technology and Electrical Engineering, The University of Queensland. doi:10.14264/uql.2017.648 

(Winner of the 2018 CORE John Makepeace Bennett (Australasian Distinguished Doctoral Dissertation) Award)