default search action
Junhao Gan
Person information
- affiliation: University of Melbourne, School of Computing and Information Systems, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c19]Philip Cervenjak, Junhao Gan, Seeun William Umboh, Anthony Wirth:
Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound. APPROX/RANDOM 2024: 25:1-25:23 - [c18]Hongjie Qiu
, Jinqiang Li
DroneGPT: Zero-shot Video Question Answering For Drones. CVDL 2024: 49:1-49:6 - [c17]Zhuowei Zhao, Junhao Gan, Jianzhong Qi
Efficient Example-Guided Interactive Graph Search. ICDE 2024: 342-354 - [i10]Philip Cervenjak, Junhao Gan, Seeun William Umboh, Anthony Wirth:
Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound. CoRR abs/2407.09368 (2024) - 2023
- [j6]Shixun Huang
Managing Conflicting Interests of Stakeholders in Influencer Marketing. Proc. ACM Manag. Data 1(1): 80:1-80:27 (2023) - [j5]Fangyuan Zhang
Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks. Proc. ACM Manag. Data 1(4): 259:1-259:26 (2023) - [c16]Philip Cervenjak
Fast Parallel Algorithms for Submodular p-Superseparable Maximization. WAOA 2023: 219-233 - [i9]Philip Cervenjak, Junhao Gan, Anthony Wirth:
Fast Parallel Algorithms for Submodular p-Superseparable Maximization. CoRR abs/2311.13123 (2023) - 2022
- [j4]Hanzhi Wang, Zhewei Wei, Junhao Gan, Ye Yuan, Xiaoyong Du, Ji-Rong Wen:
Edge-based Local Push for Personalized PageRank. Proc. VLDB Endow. 15(7): 1376-1389 (2022) - [c15]Yixin Su
Detecting Arbitrary Order Beneficial Feature Interactions for Recommender Systems. KDD 2022: 1676-1686 - [c14]Zhuo Zhang, Junhao Gan, Zhifeng Bao, Seyed Mohammad Hussein Kazemi, Guangyong Chen, Fengyuan Zhu:
Approximate Range Thresholding. SIGMOD Conference 2022: 1108-1121 - [c13]Junhao Gan, Anthony Wirth, Xin Zhang:
An Almost Optimal Algorithm for Unbounded Search with Noisy Information. SWAT 2022: 25:1-25:15 - [i8]Hanzhi Wang, Zhewei Wei, Junhao Gan, Ye Yuan, Xiaoyong Du, Ji-Rong Wen:
Edge-based Local Push for Personalized PageRank. CoRR abs/2203.07937 (2022) - [i7]Yixin Su, Yunxiang Zhao, Sarah M. Erfani, Junhao Gan, Rui Zhang:
Detecting Arbitrary Order Beneficial Feature Interactions for Recommender Systems. CoRR abs/2206.13764 (2022) - 2021
- [c12]Yixin Su
Neural Graph Matching based Collaborative Filtering. SIGIR 2021: 849-858 - [c11]Boyu Ruan
Dynamic Structural Clustering on Graphs. SIGMOD Conference 2021: 1491-1503 - [c10]Hao Wu
Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push. SIGMOD Conference 2021: 1996-2008 - [i6]Hao Wu, Junhao Gan, Zhewei Wei, Rui Zhang:
Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push. CoRR abs/2101.03652 (2021) - [i5]Yixin Su, Rui Zhang, Sarah M. Erfani, Junhao Gan:
Neural Graph Matching based Collaborative Filtering. CoRR abs/2105.04067 (2021) - [i4]Boyu Ruan, Junhao Gan, Hao Wu, Anthony Wirth:
Dynamic Structural Clustering on Graphs. CoRR abs/2108.11549 (2021) - 2020
- [j3]Liangjun Song, Junhao Gan
Incremental preference adjustment: a graph-theoretical approach. VLDB J. 29(6): 1475-1500 (2020) - [c9]Hanzhi Wang, Zhewei Wei, Junhao Gan
Personalized PageRank to a Target Node, Revisited. KDD 2020: 657-667 - [c8]Hao Wu
Learning Based Distributed Tracking. KDD 2020: 2040-2050 - [c7]Junhao Gan
Graph Clustering in All Parameter Regimes. MFCS 2020: 39:1-39:15 - [i3]Hanzhi Wang, Zhewei Wei, Junhao Gan, Sibo Wang, Zengfeng Huang:
Personalized PageRank to a Target Node, Revisited. CoRR abs/2006.11876 (2020) - [i2]Hao Wu, Junhao Gan, Rui Zhang:
Learning Based Distributed Tracking. CoRR abs/2006.12943 (2020)
2010 – 2019
- 2019
- [c6]Narthana S. Epa, Junhao Gan
Result-Sensitive Binary Search with Noisy Information. ISAAC 2019: 60:1-60:15 - [e1]Lijun Chang, Junhao Gan, Xin Cao:
Databases Theory and Applications, 30th Australasian Database Conference, ADC 2019, Sydney, NSW, Australia, January 29 - February 1, 2019, Proceedings. Lecture Notes in Computer Science 11393, Springer 2019, ISBN 978-3-030-12078-8 [contents] - [i1]Junhao Gan, David F. Gleich, Nate Veldt, Anthony Wirth, Xin Zhang:
Graph Clustering in All Parameter Regimes. CoRR abs/1910.06435 (2019) - 2018
- [j2]Junhao Gan, Yufei Tao
An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications. J. Graph Algorithms Appl. 22(2): 297-327 (2018) - [c5]Junhao Gan
Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space. SIGMOD Conference 2018: 1067-1082 - 2017
- [b1]Junhao Gan:
High Performance Density-Based Clustering on Massive Data. University of Queensland, Australia, 2017 - [j1]Junhao Gan
On the Hardness and Approximation of Euclidean DBSCAN. ACM Trans. Database Syst. 42(3): 14:1-14:45 (2017) - [c4]Junhao Gan
Dynamic Density Based Clustering. SIGMOD Conference 2017: 1493-1507 - 2016
- [c3]Miao Qiao
Range Thresholding on Streams. SIGMOD Conference 2016: 571-582 - 2015
- [c2]Junhao Gan
DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation. SIGMOD Conference 2015: 519-530 - 2012
- [c1]Junhao Gan
Locality-sensitive hashing scheme based on dynamic collision counting. SIGMOD Conference 2012: 541-552
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: