Meihao Liao

Orcid: 0000-0002-5808-3131

According to our database¹, Meihao Liao authored at least 24 papers between 2022 and 2026.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Bibliography

2026

AdaPush: An Adaptive Push Framework for Graph-Propagation Based Node Similarity Computation.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., July, 2026

Scaling up Electrical Closeness Centrality Computation.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., May, 2026

Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs.

[BibT_eX]

[DOI]

CoRR, January, 2026

2025

BD-Index: Scalable Biharmonic Distance Queries on Large Graphs via Divide-and-Conquer Indexing.

[BibT_eX]

[DOI]

Yueyang Pan

Meihao Liao

Rong-Hua Li

CoRR, December, 2025

Scalable and Provable Kemeny Constant Computation on Static and Dynamic Graphs: A 2-Forest Sampling Approach.

[BibT_eX]

[DOI]

CoRR, November, 2025

Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, February, 2025

One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2025

Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: A Labelling Approach.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2025

Improved Algorithms for Effective Resistance Computation on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

2024

LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning.

[BibT_eX]

[DOI]

Proc. VLDB Endow., March, 2024

Efficient and Provable Effective Resistance Computation on Large Graphs: An Index-based Approach.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2024

Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2024

Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach.

[BibT_eX]

[DOI]

CoRR, 2024

Privacy-Preserving Graph Embedding based on Local Differential Privacy.

[BibT_eX]

[DOI]

Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, 2024

2023

Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

Efficient Resistance Distance Computation: The Power of Landmark-based Approaches.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

Maximal Defective Clique Enumeration.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

Scalable Algorithms for Laplacian Pseudo-inverse Computation.

[BibT_eX]

[DOI]

CoRR, 2023

Locally Differentially Private Graph Embedding.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Fast Algorithm for Maximal k-plex Enumeration.

[BibT_eX]

[DOI]

CoRR, 2022

Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Scaling Up Maximal <i>k</i>-plex Enumeration.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

Meihao Liao

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...