PPaperPicks

Rong-Hua Li

Beijing Institute of Technology, School of Computer Science and Technology, Beijing, China

49 papers at tracked venues · 44 at CORE A* · active 2024–2026

DBLP profile ↗ORCID 0000-0001-8658-6599 ↗Google Scholar ↗Homepage ↗

Venues

SIGMOD ×14VLDB ×9ICDE ×8WWW ×5CIKM ×3AAAI ×2NeurIPS ×2SIGKDD ×2ACL ×1COLT ×1ICML ×1IJCAI ×1

Frequent coauthors

Xunkai Li
DBLP profile ↗ORCID search ↗
×7
Yalong Zhang
DBLP profile ↗ORCID search ↗
×4
Longlong Lin
DBLP profile ↗ORCID search ↗
×3
Meihao Liao
DBLP profile ↗ORCID search ↗
×3
Qiangqiang Dai
DBLP profile ↗ORCID search ↗
×3
Henan Sun
DBLP profile ↗ORCID search ↗
×2
Yichun Yang
DBLP profile ↗ORCID search ↗
×2
Bowen Fan
DBLP profile ↗ORCID search ↗
×2
Qi Zhang
DBLP profile ↗ORCID search ↗
×2
Lantian Xu
DBLP profile ↗ORCID search ↗
×2
Yue Zeng
DBLP profile ↗ORCID search ↗
×2
Xiaowei Ye
DBLP profile ↗ORCID search ↗
×2

Papers

  1. AlgBench: To What Extent Do Large Reasoning Models Understand Algorithms?
    ACL 2026 ·
    Henan Sun
    DBLP profile ↗ORCID search ↗
  2. PAGE: A Unified Approach for Federated Graph Unlearning
    AAAI 2026 ·
    Yuming Ai
    DBLP profile ↗ORCID search ↗
  3. Scalable and Provable Biclique-Preserving Clustering: The Power of Counting-based Approaches
    WWW 2026 ·
    Longlong Lin
    DBLP profile ↗ORCID search ↗
  4. Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs
    VLDB 2026 ·
    Yichun Yang
    DBLP profile ↗ORCID search ↗
  5. Unveiling the Vulnerability of Graph-LLMs: An Interpretable Multi-Dimensional Adversarial Attack on TAGs
    WWW 2026 ·
    Bowen Fan
    DBLP profile ↗ORCID search ↗
  6. Counting Cohesive Subgraphs with Hereditary Properties
    WWW 2025 · Rong-Hua Li
  7. Density Decomposition of Bipartite Graphs
    SIGMOD 2025 ·
    Yalong Zhang
    DBLP profile ↗ORCID search ↗
  8. DiRW: Path-Aware Digraph Learning for Heterophily
    CIKM 2025 ·
    Daohan Su
    DBLP profile ↗ORCID search ↗
  9. Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: A Labelling Approach
    SIGMOD 2025 ·
    Meihao Liao
    DBLP profile ↗ORCID search ↗
  10. Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs
    SIGMOD 2025 ·
    Meihao Liao
    DBLP profile ↗ORCID search ↗
  11. Efficient Maximum Fair Clique Search Over Large Networks
    ICDE 2025 ·
    Qi Zhang
    DBLP profile ↗ORCID search ↗
  12. Fast Optimal Group Steiner Tree Search using GPUs
    SIGMOD 2025 ·
    Jiayu Li
    DBLP profile ↗ORCID search ↗
  13. GraphMaster: Automated Graph Synthesis via LLM Agents in Data-Limited Environments
    NeurIPS 2025 ·
    Enjun Du
    DBLP profile ↗ORCID search ↗
  14. Improved Algorithms for Effective Resistance Computation on Graphs
    COLT 2025 ·
    Yichun Yang
    DBLP profile ↗ORCID search ↗
  15. Integral Densest Subgraph Search on Directed Graphs
    SIGMOD 2025 ·
    Yalong Zhang
    DBLP profile ↗ORCID search ↗
  16. Minimum Spanning Tree Maintenance in Dynamic Graphs
    SIGMOD 2025 ·
    Lantian Xu
    DBLP profile ↗ORCID search ↗
  17. On Temporal-Constraint Subgraph Matching
    ICDE 2025 ·
    Xiaoyu Leng
    DBLP profile ↗ORCID search ↗
  18. One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor
    SIGMOD 2025 ·
    Junjie Zhou
    DBLP profile ↗ORCID search ↗
  19. OpenFGL: A Comprehensive Benchmark for Federated Graph Learning
    VLDB 2025 ·
    Xunkai Li
    DBLP profile ↗ORCID search ↗
  20. OpenGU: A Comprehensive Benchmark for Graph Unlearning
    NeurIPS 2025 ·
    Bowen Fan
    DBLP profile ↗ORCID search ↗
  21. Rethinking Client-oriented Federated Graph Learning
    CIKM 2025 ·
    Zekai Chen
    DBLP profile ↗ORCID search ↗
  22. Scaling Up k-Clique Percolation Community Detection
    SIGMOD 2025 ·
    Yue Zeng
    DBLP profile ↗ORCID search ↗
  23. The Power of Core Clique Removal for Exact Clique Enumeration
    SIGMOD 2025 ·
    Xiaowei Ye
    DBLP profile ↗ORCID search ↗
  24. Theoretically and Practically Efficient Maximum Biclique Search
    SIGMOD 2025 ·
    Qiangqiang Dai
    DBLP profile ↗ORCID search ↗
  25. Toward Data-centric Directed Graph Learning: An Entropy-driven Approach
    ICML 2025 ·
    Xunkai Li
    DBLP profile ↗ORCID search ↗
  26. Toward Effective Digraph Representation Learning: A Magnetic Adaptive Propagation based Approach
    WWW 2025 ·
    Xunkai Li
    DBLP profile ↗ORCID search ↗
  27. Triangle Counting Over Signed Graphs with Differential Privacy
    ICDE 2025 ·
    Zening Li
    DBLP profile ↗ORCID search ↗
  28. Truss Decomposition in Hypergraphs
    VLDB 2025 ·
    Hongchao Qin
    DBLP profile ↗ORCID search ↗
  29. AdaFGL: A New Paradigm for Federated Node Classification with Topology Heterogeneity
    ICDE 2024 ·
    Xunkai Li
    DBLP profile ↗ORCID search ↗
  30. Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs
    VLDB 2024 ·
    Qi Zhang
    DBLP profile ↗ORCID search ↗
  31. Breaking the Entanglement of Homophily and Heterophily in Semi-supervised Node Classification
    ICDE 2024 ·
    Henan Sun
    DBLP profile ↗ORCID search ↗
  32. Constant-time Connectivity Querying in Dynamic Graphs
    SIGMOD 2024 ·
    Lantian Xu
    DBLP profile ↗ORCID search ↗
  33. Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs
    VLDB 2024 ·
    Yalong Zhang
    DBLP profile ↗ORCID search ↗
  34. Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs
    VLDB 2024 ·
    Yalong Zhang
    DBLP profile ↗ORCID search ↗
  35. Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee
    SIGMOD 2024 ·
    Qiangqiang Dai
    DBLP profile ↗ORCID search ↗
  36. Efficient and Effective Anchored Densest Subgraph Search: A Convex-programming based Approach
    SIGKDD 2024 ·
    Xiaowei Ye
    DBLP profile ↗ORCID search ↗
  37. Efficient and Provable Effective Resistance Computation on Large Graphs: An Index-based Approach
    SIGMOD 2024 ·
    Meihao Liao
    DBLP profile ↗ORCID search ↗
  38. FedTAD: Topology-aware Data-free Knowledge Distillation for Subgraph Federated Learning
    IJCAI 2024 ·
    Yinlin Zhu
    DBLP profile ↗ORCID search ↗
  39. I/O Efficient Max-Truss Computation in Large Static and Dynamic Graphs
    ICDE 2024 ·
    Jiaqi Jiang
    DBLP profile ↗ORCID search ↗
  40. LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning
    VLDB 2024 ·
    Xunkai Li
    DBLP profile ↗ORCID search ↗
  41. Maximal Biclique Enumeration: A Prefix Tree Based Approach
    ICDE 2024 ·
    Jiujian Chen
    DBLP profile ↗ORCID search ↗
  42. Mining Quasi-Periodic Communities in Temporal Network
    ICDE 2024 ·
    Yue Zeng
    DBLP profile ↗ORCID search ↗
  43. PSMC: Provable and Scalable Algorithms for Motif Conductance Based Graph Clustering
    SIGKDD 2024 ·
    Longlong Lin
    DBLP profile ↗ORCID search ↗
  44. Privacy-Preserving Graph Embedding based on Local Differential Privacy
    CIKM 2024 ·
    Zening Li
    DBLP profile ↗ORCID search ↗
  45. QTCS: Efficient Query-Centered Temporal Community Search
    VLDB 2024 ·
    Longlong Lin
    DBLP profile ↗ORCID search ↗
  46. Rethinking Node-wise Propagation for Large-scale Graph Learning
    WWW 2024 ·
    Xunkai Li
    DBLP profile ↗ORCID search ↗
  47. Theoretically and Practically Efficient Maximum Defective Clique Search
    SIGMOD 2024 ·
    Qiangqiang Dai
    DBLP profile ↗ORCID search ↗
  48. Topology-preserving Graph Coarsening: An Elementary Collapse-based Approach
    VLDB 2024 ·
    Yuchen Meng
    DBLP profile ↗ORCID search ↗
  49. Towards Effective and General Graph Unlearning via Mutual Evolution
    AAAI 2024 ·
    Xunkai Li
    DBLP profile ↗ORCID search ↗