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.1773281
- 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 all 25 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 3,066 |
Finding Locally Densest Subgraphs: A Convex Programming Approach |
2022 |
VLDB |
16 |
7.6862279e-05 |
| 3,791 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
26 |
7.0158046e-05 |
| 3,922 |
On Querying Connected Components in Large Temporal Graphs |
2023 |
SIGMOD |
12 |
6.9205122e-05 |
| 4,924 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery |
2022 |
SIGMOD |
21 |
6.3492725e-05 |
| 4,956 |
Effective Community Search over Large Star-Schema Heterogeneous Information Networks |
2022 |
VLDB |
8 |
6.3381425e-05 |
| 7,461 |
DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection |
2022 |
VLDB |
3 |
5.5197125e-05 |
| 7,814 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
11 |
5.4469653e-05 |
| 8,185 |
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks |
2024 |
VLDB |
9 |
5.3801229e-05 |
| 8,265 |
Attribute Filtering in Approximate Nearest Neighbor Search: An In-depth Experimental Study |
2026 |
SIGMOD |
4 |
5.3639904e-05 |
| 8,397 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs |
2024 |
SIGMOD |
8 |
5.3385249e-05 |
| 8,983 |
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery |
2023 |
SIGMOD |
8 |
5.2429402e-05 |
| 9,952 |
On Efficient Large Sparse Matrix Chain Multiplication |
2024 |
SIGMOD |
2 |
5.101836e-05 |
| 10,106 |
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index |
2025 |
VLDB |
2 |
5.0765311e-05 |
| 10,261 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
2 |
5.0480912e-05 |
| 10,696 |
Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,718 |
A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 11,054 |
Scalable Approximate Biclique Counting over Large Bipartite Graphs |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 11,082 |
Revisiting Task-Oriented Dataset Search in the Era of Large Language Models: Challenges, Benchmark, and Solution |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 11,228 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4 |
4.9769913e-05 |
| 11,259 |
Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs |
2025 |
VLDB |
1 |
4.9769913e-05 |
| 11,586 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
2 |
4.9769913e-05 |
| 11,670 |
MOSER: Scalable Network Motif Discovery using Serial Test |
2024 |
VLDB |
1 |
4.9769913e-05 |
| 11,922 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
9 |
4.9769913e-05 |
| 12,002 |
On Analyzing Graphs with Motif-Paths |
2021 |
VLDB |
6 |
4.9769913e-05 |
| 13,642 |
SemExplorer: A User Interface for Semantic Approach to Customized Dataset Search |
2025 |
SIGMOD |
1 |
- |
Frequent Co-authors
Co-authored at least 5 papers.