Qiangqiang Dai

Orcid: 0000-0002-8569-6558

According to our database1, Qiangqiang Dai authored at least 27 papers between 2017 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

Efficient $k$k-Clique Counting on Large Graphs: The Power of Color-Based Sampling Approaches.
IEEE Trans. Knowl. Data Eng., April, 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

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

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

2023
Core Decomposition on Uncertain Graphs Revisited.
IEEE Trans. Knowl. Data Eng., 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

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

2022
Fast Algorithm for Maximal k-plex Enumeration.
CoRR, 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

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

2021
Signed Clique Search in Signed Networks: Concepts and Algorithms.
IEEE Trans. Knowl. Data Eng., 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
Scaling Up Distanced-generalized Core Decomposition.
CoRR, 2020

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

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

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


  Loading...