Database Paper Browser

Back to authors

Ronghua Li

Author ID
6084
ORCID
0000-0001-8658-6599
Links
(found by gpt-5.2 on feb 8th, 2026)
Most Frequent Institution
Beijing Institute of Technology
Pagerank
0.26346091
Overall Rank
188 | 99.12%
Paper Count
40

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 40 of 40 publications.

Rank Title Year Venue Pagerank
1,257 Influential Community Search in Large Networks 2015 VLDB 0.00013020648
3,603 Skyline Community Search in Multi-valued Networks 2018 SIGMOD 6.9306814e-05
4,208 Mining Bursting Core in Large Temporal Graphs 2022 VLDB 6.357214e-05
4,626 Efficient Biclique Counting in Large Bipartite Graphs 2023 SIGMOD 6.0399035e-05
5,022 Maximal Defective Clique Enumeration 2023 SIGMOD 5.7536318e-05
5,597 Efficient Shortest Path Counting on Large Road Networks 2022 VLDB 5.4178241e-05
5,683 Efficient and Progressive Group Steiner Tree Search 2016 SIGMOD 5.3723969e-05
5,702 Efficient Estimation of Heat Kernel PageRank for Local Clustering 2019 SIGMOD 5.36473e-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
6,813 Theoretically and Practically Efficient Maximum Defective Clique Search 2024 SIGMOD 4.9187137e-05
7,086 Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach 2022 SIGMOD 4.8381004e-05
7,268 Top-K Structural Diversity Search in Large Networks 2013 VLDB 4.7817823e-05
7,446 QTCS: Efficient Query-Centered Temporal Community Search 2024 VLDB 4.727813e-05
7,986 On Density-based Local Community Search 2024 PODS 4.613363e-05
9,239 Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs 2024 VLDB 4.3690661e-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
9,951 Parallel Colorful h-star Core Maintenance in Dynamic Graphs 2023 VLDB 4.2405999e-05
10,028 One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor 2026 SIGMOD 4.1945683e-05
10,033 Scaling Up k-Clique Percolation Community Detection 2026 SIGMOD 4.1945683e-05
10,037 The Power of Core Clique Removal for Exact Clique Enumeration 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,079 Fast Optimal Group Steiner Tree Search using GPUs 2026 SIGMOD 4.1945683e-05
10,119 Theoretically and Practically Efficient Maximum Biclique Search 2026 SIGMOD 4.1945683e-05
10,373 Density Decomposition of Bipartite Graphs 2025 SIGMOD 4.1945683e-05
10,383 Minimum Spanning Tree Maintenance in Dynamic Graphs 2025 SIGMOD 4.1945683e-05
10,490 Integral Densest Subgraph Search on Directed Graphs 2025 SIGMOD 4.1945683e-05
10,545 OpenFGL: A Comprehensive Benchmark for Federated Graph Learning 2025 VLDB 4.1945683e-05
10,596 Truss Decomposition in Hypergraphs 2025 VLDB 4.1945683e-05
10,865 Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs 2025 VLDB 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
10,985 Constant-time Connectivity Querying in Dynamic Graphs 2024 SIGMOD 4.1945683e-05
11,048 Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs 2024 VLDB 4.1945683e-05
11,086 FedGTA: Topology-aware Averaging for Federated Graph Learning 2024 VLDB 4.1945683e-05
11,264 Approximating Probabilistic Group Steiner Trees in Graphs 2023 VLDB 4.1945683e-05
13,152 LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning 2024 VLDB -
13,174 Topology-preserving Graph Coarsening: An Elementary Collapse-based Approach 2024 VLDB -
Previous Page 1 / 1 Next

Frequent Co-authors

Co-authored at least 5 papers.

Co-author Shared Papers Rank Pagerank
Guoren Wang 27 155 0.29864489
Meihao Liao 12 885 0.074575416
Lu Qin 11 72 0.44871453
Qiangqiang Dai 11 867 0.076318158
Hongchao Qin 11 880 0.0748585
Longlong Lin 5 2,374 0.032855173
Yalong Zhang 5 2,414 0.032516086
Qi Zhang 5 2,415 0.032516086