Back to authors
Chenhao Ma
- Author ID
- o0000-0002-3243-8512
- 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.17737009
- Overall Rank
- 348 | 98.40%
- 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,064 |
Finding Locally Densest Subgraphs: A Convex Programming Approach |
2022 |
VLDB |
7.6898682e-05 |
| 3,789 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
7.0191274e-05 |
| 3,921 |
On Querying Connected Components in Large Temporal Graphs |
2023 |
SIGMOD |
6.9237898e-05 |
| 4,923 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery |
2022 |
SIGMOD |
6.3522796e-05 |
| 4,954 |
Effective Community Search over Large Star-Schema Heterogeneous Information Networks |
2022 |
VLDB |
6.3411444e-05 |
| 7,457 |
DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection |
2022 |
VLDB |
5.5223267e-05 |
| 7,807 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
5.4495451e-05 |
| 8,178 |
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks |
2024 |
VLDB |
5.382671e-05 |
| 8,259 |
Attribute Filtering in Approximate Nearest Neighbor Search: An In-depth Experimental Study |
2026 |
SIGMOD |
5.3665309e-05 |
| 8,393 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs |
2024 |
SIGMOD |
5.3410533e-05 |
| 8,974 |
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery |
2023 |
SIGMOD |
5.2454233e-05 |
| 9,944 |
On Efficient Large Sparse Matrix Chain Multiplication |
2024 |
SIGMOD |
5.1042523e-05 |
| 10,102 |
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index |
2025 |
VLDB |
5.0789354e-05 |
| 10,255 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
5.050482e-05 |
| 10,685 |
Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,708 |
A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs |
2026 |
VLDB |
4.9793485e-05 |
| 11,045 |
Scalable Approximate Biclique Counting over Large Bipartite Graphs |
2026 |
VLDB |
4.9793485e-05 |
| 11,073 |
Revisiting Task-Oriented Dataset Search in the Era of Large Language Models: Challenges, Benchmark, and Solution |
2026 |
VLDB |
4.9793485e-05 |
| 11,220 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4.9793485e-05 |
| 11,251 |
Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs |
2025 |
VLDB |
4.9793485e-05 |
| 11,580 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
4.9793485e-05 |
| 11,664 |
MOSER: Scalable Network Motif Discovery using Serial Test |
2024 |
VLDB |
4.9793485e-05 |
| 11,916 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
4.9793485e-05 |
| 11,996 |
On Analyzing Graphs with Motif-Paths |
2021 |
VLDB |
4.9793485e-05 |
| 13,636 |
SemExplorer: A User Interface for Semantic Approach to Customized Dataset Search |
2025 |
SIGMOD |
- |
Frequent Co-authors
Co-authored at least 5 papers.