Ronghua Li

Orcid: 0000-0001-8658-6599

According to our database1, Ronghua Li authored at least 180 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Encoding Group Interests With Persistent Homology for Personalized Search.
IEEE Trans. Syst. Man Cybern. Syst., September, 2024

Theoretically and Practically Efficient Maximum Defective Clique Search.
Proc. ACM Manag. Data, September, 2024

Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs.
Proc. VLDB Endow., July, 2024

Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs.
Proc. VLDB Endow., July, 2024

Efficient $k$k-Clique Counting on Large Graphs: The Power of Color-Based Sampling Approaches.
IEEE Trans. Knowl. Data Eng., April, 2024

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

QTCS: Efficient Query-Centered Temporal Community Search.
Proc. VLDB Endow., February, 2024

RFTrack: Stealthy Location Inference and Tracking Attack on Wi-Fi Devices.
IEEE Trans. Inf. Forensics Secur., 2024

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

On Density-based Local Community Search.
Proc. ACM Manag. Data, 2024

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

CCSS: Towards conductance-based community search with size constraints.
Expert Syst. Appl., 2024

DiRW: Path-Aware Digraph Learning for Heterophily.
CoRR, 2024

Alignment-Aware Model Extraction Attacks on Large Language Models.
CoRR, 2024

OpenFGL: A Comprehensive Benchmarks for Federated Graph Learning.
CoRR, 2024

Internal Consistency and Self-Feedback in Large Language Models: A Survey.
CoRR, 2024

Efficient Antagonistic k-plex Enumeration in Signed Graphs.
CoRR, 2024

Counting Cohesive Subgraphs with Hereditary Properties.
CoRR, 2024

Scalable k-clique Densest Subgraph Search.
CoRR, 2024

K-stars LDP: A Novel Framework for (p, q)-clique Enumeration under Local Differential Privacy.
CoRR, 2024

Effective Bug Detection in Graph Database Engines: An LLM-based Approach.
CoRR, 2024

Rethinking Node-wise Propagation for Large-scale Graph Learning.
Proceedings of the ACM on Web Conference 2024, 2024

Efficient and Effective Anchored Densest Subgraph Search: A Convex-programming based Approach.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

PSMC: Provable and Scalable Algorithms for Motif Conductance Based Graph Clustering.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

FedTAD: Topology-aware Data-free Knowledge Distillation for Subgraph Federated Learning.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Mining Quasi-Periodic Communities in Temporal Network.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Breaking the Entanglement of Homophily and Heterophily in Semi-supervised Node Classification.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

AdaFGL: A New Paradigm for Federated Node Classification with Topology Heterogeneity.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

I/O Efficient Max-Truss Computation in Large Static and Dynamic Graphs.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Maximal Biclique Enumeration: A Prefix Tree Based Approach.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Privacy-Preserving Graph Embedding based on Local Differential Privacy.
Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, 2024

Towards Effective and General Graph Unlearning via Mutual Evolution.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Temporal Graph Cube.
IEEE Trans. Knowl. Data Eng., December, 2023

Fairness-Aware Maximal Clique in Large Graphs: Concepts and Algorithms.
IEEE Trans. Knowl. Data Eng., November, 2023

Densest Periodic Subgraph Mining on Large Temporal Graphs.
IEEE Trans. Knowl. Data Eng., November, 2023

Sound Field Reconstruction Using Prolate Spheroidal Wave Functions and Sparse Regularization.
Sensors, October, 2023

Stable Subgraph Isomorphism Search in Temporal Networks.
IEEE Trans. Knowl. Data Eng., June, 2023

Computing Significant Cliques in Large Labeled Networks.
IEEE Trans. Big Data, June, 2023

Maximal Quasi-Cliques Mining in Uncertain Graphs.
IEEE Trans. Big Data, February, 2023

Hybrid Fault Diagnosis Capability Analysis of Highly Connected Graphs.
Comput. J., January, 2023

Core Decomposition on Uncertain Graphs Revisited.
IEEE Trans. Knowl. Data Eng., 2023

FedGTA: Topology-aware Averaging for Federated Graph Learning.
Proc. VLDB Endow., 2023

Parallel Colorful h-star Core Maintenance in Dynamic Graphs.
Proc. VLDB Endow., 2023

Efficient Biclique Counting in Large Bipartite Graphs.
Proc. ACM Manag. Data, 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

Self-attention Hypergraph Pooling Network.
Int. J. Softw. Informatics, 2023

Efficient Maximum Fair Clique Search over Large Networks.
CoRR, 2023

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

Locally Differentially Private Graph Embedding.
CoRR, 2023

Query-Centered Temporal Community Search via Time-Constrained Personalized PageRank.
CoRR, 2023

Insulator and Defect Detection Model Based on Improved Yolo-S.
IEEE Access, 2023

ByteGAP: A Non-continuous Distributed Graph Computing System using Persistent Memory.
Proceedings of the Joint Proceedings of Workshops at the 49th International Conference on Very Large Data Bases (VLDB 2023), Vancouver, Canada, August 28, 2023

Fairness-aware Maximal Biclique Enumeration on Bipartite Graphs.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Explainable Hyperlink Prediction: A Hypergraph Edit Distance-Based Approach.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Neighborhood Skyline on Graphs: Concepts, Algorithms and Applications.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Scalable and Effective Conductance-Based Graph Clustering.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Mining Stable Quasi-Cliques on Temporal Networks.
IEEE Trans. Syst. Man Cybern. Syst., 2022

Computing K-Cores in Large Uncertain Graphs: An Index-Based Optimal Approach.
IEEE Trans. Knowl. Data Eng., 2022

Index-Based Intimate-Core Community Search in Large Weighted Graphs.
IEEE Trans. Knowl. Data Eng., 2022

Periodic Communities Mining in Temporal Networks: Concepts and Algorithms.
IEEE Trans. Knowl. Data Eng., 2022

I/O-Efficient Algorithms for Degeneracy Computation on Massive Networks.
IEEE Trans. Knowl. Data Eng., 2022

Target-Aware Holistic Influence Maximization in Spatial Social Networks.
IEEE Trans. Knowl. Data Eng., 2022

Mining Stable Communities in Temporal Networks by Density-Based Clustering.
IEEE Trans. Big Data, 2022

Mining Diversified Top-$r$r Lasting Cohesive Subgraphs on Temporal Networks.
IEEE Trans. Big Data, 2022

Approximating Probabilistic Group Steiner Trees in Graphs.
Proc. VLDB Endow., 2022

Efficient Shortest Path Counting on Large Road Networks.
Proc. VLDB Endow., 2022

Mining Bursting Core in Large Temporal Graph.
Proc. VLDB Endow., 2022

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

The Component Diagnosability of Hypercubes with Large-Scale Faulty Nodes.
Comput. J., 2022

Lightning Fast and Space Efficient k-clique Counting.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 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

Filtration-Enhanced Graph Transformation.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Efficient Top-k Ego-Betweenness Search.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Fairness-aware Maximal Clique Enumeration.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Colorful h-star Core Decomposition.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Core Decomposition on Uncertain Graphs Revisited (Extended Abstract).
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Scaling Up Maximal <i>k</i>-plex Enumeration.
Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

Mining Periodic k-Clique from Real-World Sparse Temporal Networks.
Proceedings of the Web and Big Data - 6th International Joint Conference, 2022

2021
Dynamic Community Evolution Analysis Framework for Large-Scale Complex Networks Based on Strong and Weak Events.
IEEE Trans. Syst. Man Cybern. Syst., 2021

Signed Clique Search in Signed Networks: Concepts and Algorithms.
IEEE Trans. Knowl. Data Eng., 2021

The g-Extra Edge-Connectivity of Balanced Hypercubes.
J. Interconnect. Networks, 2021

Scaling Up Distance-generalized Core Decomposition.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

2020
Finding skyline communities in multi-valued networks.
VLDB J., 2020

Ordering Heuristics for k-clique Listing.
Proc. VLDB Endow., 2020

Where to go: An effective point-of-interest recommendation framework for heterogeneous social networks.
Neurocomputing, 2020

Scaling Up Distanced-generalized Core Decomposition.
CoRR, 2020

Synchronous Multi-Wavelength Ultra-Short-Pulse Laser With Arbitrary Wavelength Interval.
IEEE Access, 2020

Butterfly-Based Higher-Order Clustering on Bipartite Networks.
Proceedings of the Knowledge Science, Engineering and Management, 2020

CFGAT: A Coarse-to-Fine Graph Attention Network for Semi-supervised Node Classification.
Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence, 2020

Efficient Top-k Edge Structural Diversity Search.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Research on automatic cleaning method for hole work-piece in rail transit by intelligent robot.
Proceedings of the 5th International Conference on Automation, 2020

2019
Evidence-driven dubious decision making in online shopping.
World Wide Web, 2019

Direction-based multiple views on data.
World Wide Web, 2019

ADPDF: A Hybrid Attribute Discrimination Method for Psychometric Data With Fuzziness.
IEEE Trans. Syst. Man Cybern. Syst., 2019

Efficient Structural Clustering on Probabilistic Graphs.
IEEE Trans. Knowl. Data Eng., 2019

Structure fault tolerance of <i>k</i>-ary <i>n</i>-cube networks.
Theor. Comput. Sci., 2019

Mining Bursting Communities in Temporal Graphs.
CoRR, 2019

Anti-<i>k</i>-labeling of graphs.
Appl. Math. Comput., 2019

Fast Algorithms for Intimate-Core Group Search in Weighted Graphs.
Proceedings of the Web Information Systems Engineering - WISE 2019, 2019

Efficient Estimation of Heat Kernel PageRank for Local Clustering.
Proceedings of the 2019 International Conference on Management of Data, 2019

Discrete Overlapping Community Detection with Pseudo Supervision.
Proceedings of the 2019 IEEE International Conference on Data Mining, 2019

Index-Based Optimal Algorithm for Computing K-Cores in Large Uncertain Graphs.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Mining Periodic Cliques in Temporal Networks.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Improved Algorithms for Maximal Clique Search in Uncertain Networks.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

2018
A Fast Parallel Community Discovery Model on Complex Networks Through Approximate Optimization.
IEEE Trans. Knowl. Data Eng., 2018

Predicting Long-Term Trajectories of Connected Vehicles via the Prefix-Projection Technique.
IEEE Trans. Intell. Transp. Syst., 2018

Secure Hashing-Based Verifiable Pattern Matching.
IEEE Trans. Inf. Forensics Secur., 2018

SocialMix: A familiarity-based and preference-aware location suggestion approach.
Eng. Appl. Artif. Intell., 2018

Discovering Hierarchical Subgraphs of K-Core-Truss.
Data Sci. Eng., 2018

An Optimized MBE Algorithm on Sparse Bipartite Graphs.
Proceedings of the Smart Computing and Communication - Third International Conference, 2018

Skyline Community Search in Multi-valued Networks.
Proceedings of the 2018 International Conference on Management of Data, 2018

Persistent Community Search in Temporal Networks.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Efficient Signed Clique Search in Signed Networks.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Holistic Influence Maximization for Targeted Advertisements in Spatial Social Networks.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2017
Efficient distance-based representative skyline computation in 2D space.
World Wide Web, 2017

Finding influential communities in massive networks.
VLDB J., 2017

Finding weighted k-truss communities in large networks.
Inf. Sci., 2017

Discovering Hierarchical Subgraphs of K-Core-Truss.
Proceedings of the Web Information Systems Engineering - WISE 2017, 2017

Efficient Order-Sensitive Activity Trajectory Search.
Proceedings of the Web Information Systems Engineering - WISE 2017, 2017

Incremental Structural Clustering for Dynamic Networks.
Proceedings of the Web Information Systems Engineering - WISE 2017, 2017

Fast Truss Decomposition in Memory.
Proceedings of the Security, Privacy, and Anonymity in Computation, Communication, and Storage, 2017

Querying Intimate-Core Groups in Weighted Graphs.
Proceedings of the 11th IEEE International Conference on Semantic Computing, 2017

2016
Exploring Hierarchies in Online Social Networks.
IEEE Trans. Knowl. Data Eng., 2016

Recursive Stratified Sampling: A New Framework for Query Evaluation on Uncertain Graphs.
IEEE Trans. Knowl. Data Eng., 2016

Optimal Multi-Meeting-Point Route Search.
IEEE Trans. Knowl. Data Eng., 2016

Three-dimensional pose estimation based on LS-SVM error compensation.
Proceedings of the 13th International Conference on Ubiquitous Robots and Ambient Intelligence, 2016

Efficient and Progressive Group Steiner Tree Search.
Proceedings of the 2016 International Conference on Management of Data, 2016

Community Detection in Location-Based Social Networks: An Entropy-Based Approach.
Proceedings of the 2016 IEEE International Conference on Computer and Information Technology, 2016

2015
Influential Community Search in Large Networks.
Proc. VLDB Endow., 2015

Triangle minimization in large networks.
Knowl. Inf. Syst., 2015

A topic-biased user reputation model in rating systems.
Knowl. Inf. Syst., 2015

A new point cloud slicing based path planning algorithm for robotic spray painting.
Proceedings of the 2015 IEEE International Conference on Robotics and Biomimetics, 2015

Locally Densest Subgraph Discovery.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

On random walk based graph sampling.
Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

Efficient Algorithms for Distance-Based Representative Skyline Computation in 2D Space.
Proceedings of the Web Technologies and Applications - 17th Asia-PacificWeb Conference, 2015

2014
Efficient Core Maintenance in Large Dynamic Graphs.
IEEE Trans. Knowl. Data Eng., 2014

Measuring the impact of MVC attack in large complex networks.
Inf. Sci., 2014

Efficient and accurate query evaluation on uncertain graphs via recursive stratified sampling.
Proceedings of the IEEE 30th International Conference on Data Engineering, Chicago, 2014

Random-walk domination in large graphs.
Proceedings of the IEEE 30th International Conference on Data Engineering, Chicago, 2014

2013
Scalable Diversified Ranking on Large Graphs.
IEEE Trans. Knowl. Data Eng., 2013

Top-K Structural Diversity Search in Large Networks.
Proc. VLDB Endow., 2013

Co-occurrence prediction in a large location-based social network.
Frontiers Comput. Sci., 2013

Evaluation of a Low-Carbon City: Method and Application.
Entropy, 2013

Random-walk domination in large graphs: problem definitions and fast solutions
CoRR, 2013

2012
Cognitive Garment Panel Design Based on BSG Representation and Matching.
Int. J. Softw. Sci. Comput. Intell., 2012

Evolution of cooperation in spatial traveler's dilemma game
CoRR, 2012

A Framework of Algorithms: Computing the Bias and Prestige of Nodes in Trust Networks
CoRR, 2012

Efficient Core Maintenance in Large Dynamic Graphs
CoRR, 2012

Estimating Node Influenceability in Social Networks
CoRR, 2012

Robust Reputation-Based Ranking on Bipartite Rating Networks.
Proceedings of the Twelfth SIAM International Conference on Data Mining, 2012

Measuring robustness of complex networks under MVC attack.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011
Equivalence Between LDA/QR and Direct LDA.
Int. J. Cogn. Informatics Nat. Intell., 2011

Link prediction: the power of maximal entropy random walk.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

A graph modeling and matching method for sketch-based garment panel design.
Proceedings of the 10th IEEE International Conference on Cognitive Informatics and Cognitive Computing, 2011

2010
Exponential stability of numerical solutions to stochastic delay Hopfield neural networks.
Neurocomputing, 2010

A visual attention model for robot object tracking.
Int. J. Autom. Comput., 2010

Convergence of numerical solutions to stochastic age-structured population equations with diffusions and Markovian switching.
Appl. Math. Comput., 2010

Partial matching of garment panel shapes with dynamic sketching design.
Proceedings of the 1st Augmented Human International Conference, 2010

Cognitive garment design interface using user behavior tree model.
Proceedings of the 9th IEEE International Conference on Cognitive Informatics, 2010

DLDA and LDA/QR equivalence framework for human face recognition.
Proceedings of the 9th IEEE International Conference on Cognitive Informatics, 2010

2009
Convergence of numerical solutions to stochastic age-dependent population equations with Markovian switching.
J. Comput. Appl. Math., 2009

Convergence of numerical solutions to stochastic pantograph equations with Markovian switching.
Appl. Math. Comput., 2009

Pseudo-inverse Locality Preserving Projections.
Proceedings of the 2009 International Conference on Computational Intelligence and Security, 2009

2008
Convergence of the semi-implicit Euler method for stochastic age-dependent population equations.
Appl. Math. Comput., 2008

2007
A Protocol for a Private Set-Operation.
J. Comput. Sci. Technol., 2007

Convergence of numerical solution to stochastic delay differential equation with Poisson jump and Markovian switching.
Appl. Math. Comput., 2007

A New Approach of Blind Channel Identification in Frequency Domain.
Proceedings of the Advances in Neural Networks, 2007

An Unconditionally Secure Protocol for Multi-Party Set Intersection.
Proceedings of the Applied Cryptography and Network Security, 5th International Conference, 2007

2006
Convergence and stability of numerical solutions to SDDEs with Markovian switching.
Appl. Math. Comput., 2006

Convergence of numerical solutions to stochastic delay differential equations with jumps.
Appl. Math. Comput., 2006

Exponential stability of numerical solutions to stochastic age-dependent population equations.
Appl. Math. Comput., 2006

Exponential stability of numerical solutions to SDDEs with Markovian switching.
Appl. Math. Comput., 2006

Estimation of Delays and Attenuations for Underdetermined BSS in Frequency Domain.
Proceedings of the Advances in Neural Networks - ISNN 2006, Third International Symposium on Neural Networks, Chengdu, China, May 28, 2006

Estimation of Source Signals Number and Underdetermined Blind Separation Based on Sparse Representation.
Proceedings of the Computational Intelligence and Security, International Conference, 2006

2005
Co-operative Private Equality Test.
Int. J. Netw. Secur., 2005

2002
A Note on the Optimal <i>L</i><sup>2</sup>-Estimate of the Finite Volume Element Method.
Adv. Comput. Math., 2002


  Loading...