Back to authors
Chenhao Ma
- Author ID
- 20783
- ORCID
-
0000-0002-3243-8512
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Chinese University of Hong Kong
- Pagerank
- 0.17873953
- Overall Rank
- 335 | 98.41%
- Paper Count
- 25
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing 25 of 25 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 3,148 |
Finding Locally Densest Subgraphs: A Convex Programming Approach |
2022 |
VLDB |
7.707548e-05 |
| 3,737 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
7.1609645e-05 |
| 3,836 |
On Querying Connected Components in Large Temporal Graphs |
2023 |
SIGMOD |
7.0827068e-05 |
| 4,903 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery |
2022 |
SIGMOD |
6.4520708e-05 |
| 4,921 |
Effective Community Search over Large Star-Schema Heterogeneous Information Networks |
2022 |
VLDB |
6.4448544e-05 |
| 7,354 |
DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection |
2022 |
VLDB |
5.6348348e-05 |
| 8,019 |
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks |
2024 |
VLDB |
5.5062157e-05 |
| 8,822 |
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery |
2023 |
SIGMOD |
5.3624668e-05 |
| 9,118 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs |
2024 |
SIGMOD |
5.3201316e-05 |
| 9,163 |
Attribute Filtering in Approximate Nearest Neighbor Search: An In-depth Experimental Study |
2026 |
SIGMOD |
5.3104846e-05 |
| 9,519 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
5.2562724e-05 |
| 9,766 |
On Efficient Large Sparse Matrix Chain Multiplication |
2024 |
SIGMOD |
5.2214067e-05 |
| 9,916 |
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index |
2025 |
VLDB |
5.1955087e-05 |
| 10,498 |
Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC |
2026 |
SIGMOD |
5.093636e-05 |
| 10,524 |
A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs |
2026 |
VLDB |
5.093636e-05 |
| 10,598 |
Scalable Approximate Biclique Counting over Large Bipartite Graphs |
2026 |
VLDB |
5.093636e-05 |
| 10,627 |
Revisiting Task-Oriented Dataset Search in the Era of Large Language Models: Challenges, Benchmark, and Solution |
2026 |
VLDB |
5.093636e-05 |
| 10,748 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
5.093636e-05 |
| 10,807 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
5.093636e-05 |
| 10,845 |
Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs |
2025 |
VLDB |
5.093636e-05 |
| 11,248 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
5.093636e-05 |
| 11,346 |
MOSER: Scalable Network Motif Discovery using Serial Test |
2024 |
VLDB |
5.093636e-05 |
| 11,608 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
5.093636e-05 |
| 11,690 |
On Analyzing Graphs with Motif-Paths |
2021 |
VLDB |
5.093636e-05 |
| 13,314 |
SemExplorer: A User Interface for Semantic Approach to Customized Dataset Search |
2025 |
SIGMOD |
- |
Frequent Co-authors
Co-authored at least 5 papers.