Back to authors
Meihao Liao
- Author ID
- 23018
- ORCID
-
0000-0002-5808-3131
- Links
-
(found by gpt-5.2 on feb 8th, 2026)
- Most Frequent Institution
- Beijing Institute of Technology
- Pagerank
- 0.074575416
- Overall Rank
- 885 | 95.83%
- Paper Count
- 12
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 12 of 12 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 5,022 |
Maximal Defective Clique Enumeration |
2023 |
SIGMOD |
5.7536318e-05 |
| 5,908 |
Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach |
2022 |
SIGMOD |
5.2773278e-05 |
| 6,532 |
Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches |
2023 |
SIGMOD |
5.0245678e-05 |
| 7,086 |
Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach |
2022 |
SIGMOD |
4.8381004e-05 |
| 9,245 |
Efficient Resistance Distance Computation: the Power of Landmark-based Approaches |
2023 |
SIGMOD |
4.3690661e-05 |
| 9,325 |
Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches |
2023 |
SIGMOD |
4.3556432e-05 |
| 9,642 |
Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs |
2025 |
SIGMOD |
4.3109001e-05 |
| 10,028 |
One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,075 |
Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,957 |
Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach |
2024 |
SIGMOD |
4.1945683e-05 |
| 10,959 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
4.1945683e-05 |
| 13,152 |
LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning |
2024 |
VLDB |
- |
Frequent Co-authors
Co-authored at least 5 papers.