Junhao Gan

Orcid: 0000-0001-9101-1503

Affiliations:
  • University of Melbourne, School of Computing and Information Systems, Australia


According to our database1, Junhao Gan authored at least 23 papers between 2012 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks.
Proc. ACM Manag. Data, December, 2023

Managing Conflicting Interests of Stakeholders in Influencer Marketing.
Proc. ACM Manag. Data, 2023

Fast Parallel Algorithms for Submodular p-Superseparable Maximization.
Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

2022
Edge-based Local Push for Personalized PageRank.
Proc. VLDB Endow., 2022

An Almost Optimal Algorithm for Unbounded Search with Noisy Information.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Approximate Range Thresholding.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Detecting Arbitrary Order Beneficial Feature Interactions for Recommender Systems.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

2021
Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Dynamic Structural Clustering on Graphs.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Neural Graph Matching based Collaborative Filtering.
Proceedings of the SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2021

2020
Incremental preference adjustment: a graph-theoretical approach.
VLDB J., 2020

Graph Clustering in All Parameter Regimes.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Learning Based Distributed Tracking.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Personalized PageRank to a Target Node, Revisited.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

2019
Result-Sensitive Binary Search with Noisy Information.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018
An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications.
J. Graph Algorithms Appl., 2018

Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space.
Proceedings of the 2018 International Conference on Management of Data, 2018

2017
High Performance Density-Based Clustering on Massive Data
PhD thesis, 2017

On the Hardness and Approximation of Euclidean DBSCAN.
ACM Trans. Database Syst., 2017

Dynamic Density Based Clustering.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

2016
Range Thresholding on Streams.
Proceedings of the 2016 International Conference on Management of Data, 2016

2015
DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

2012
Locality-sensitive hashing scheme based on dynamic collision counting.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2012


  Loading...