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.18419205
- Overall Rank
- 328 | 98.49%
- Paper Count
- 26
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 all 26 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 2,926 |
Finding Locally Densest Subgraphs: A Convex Programming Approach |
2022 |
VLDB |
17 |
7.837861e-05 |
| 3,778 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
26 |
7.0037629e-05 |
| 3,928 |
On Querying Connected Components in Large Temporal Graphs |
2023 |
SIGMOD |
13 |
6.9013791e-05 |
| 4,944 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery |
2022 |
SIGMOD |
21 |
6.3297928e-05 |
| 4,973 |
Effective Community Search over Large Star-Schema Heterogeneous Information Networks |
2022 |
VLDB |
8 |
6.3201026e-05 |
| 7,480 |
DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection |
2022 |
VLDB |
3 |
5.5014609e-05 |
| 7,832 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
12 |
5.4289543e-05 |
| 8,187 |
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks |
2024 |
VLDB |
10 |
5.3652509e-05 |
| 8,281 |
Attribute Filtering in Approximate Nearest Neighbor Search: An In-depth Experimental Study |
2026 |
SIGMOD |
4 |
5.3462537e-05 |
| 8,416 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs |
2024 |
SIGMOD |
8 |
5.3208725e-05 |
| 9,004 |
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery |
2023 |
SIGMOD |
8 |
5.2256037e-05 |
| 9,985 |
On Efficient Large Sparse Matrix Chain Multiplication |
2024 |
SIGMOD |
2 |
5.0849662e-05 |
| 10,141 |
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index |
2025 |
VLDB |
2 |
5.0597449e-05 |
| 10,290 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
2 |
5.031399e-05 |
| 10,394 |
Effective Structurally Similar Community Search in Large Temporal Graphs |
2027 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,757 |
Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,779 |
A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 11,115 |
Scalable Approximate Biclique Counting over Large Bipartite Graphs |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 11,143 |
Revisiting Task-Oriented Dataset Search in the Era of Large Language Models: Challenges, Benchmark, and Solution |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 11,284 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4 |
4.9605343e-05 |
| 11,315 |
Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs |
2025 |
VLDB |
1 |
4.9605343e-05 |
| 11,634 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
2 |
4.9605343e-05 |
| 11,716 |
MOSER: Scalable Network Motif Discovery using Serial Test |
2024 |
VLDB |
1 |
4.9605343e-05 |
| 11,966 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
9 |
4.9605343e-05 |
| 12,046 |
On Analyzing Graphs with Motif-Paths |
2021 |
VLDB |
6 |
4.9605343e-05 |
| 13,682 |
SemExplorer: A User Interface for Semantic Approach to Customized Dataset Search |
2025 |
SIGMOD |
1 |
- |
Frequent Co-authors
Co-authored at least 5 papers.