Meihao Liao

Orcid: 0000-0002-5808-3131

According to our database1, Meihao Liao authored at least 17 papers between 2022 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs.
Proc. ACM Manag. Data, February, 2025

Improved Algorithms for Effective Resistance Computation on Graphs.
Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

2024
LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning.
Proc. VLDB Endow., March, 2024

Efficient and Provable Effective Resistance Computation on Large Graphs: An Index-based Approach.
Proc. ACM Manag. Data, 2024

Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee.
Proc. ACM Manag. Data, 2024

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

Privacy-Preserving Graph Embedding based on Local Differential Privacy.
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.
Proc. ACM Manag. Data, 2023

Efficient Resistance Distance Computation: The Power of Landmark-based Approaches.
Proc. ACM Manag. Data, 2023

Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches.
Proc. ACM Manag. Data, 2023

Maximal Defective Clique Enumeration.
Proc. ACM Manag. Data, 2023

Scalable Algorithms for Laplacian Pseudo-inverse Computation.
CoRR, 2023

Locally Differentially Private Graph Embedding.
CoRR, 2023

2022
Fast Algorithm for Maximal k-plex Enumeration.
CoRR, 2022

Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach.
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.
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.
Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022


  Loading...