default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQiangqiang Dai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Meihao Liao
, Junjie Zhou, Rong-Hua Li, Qiangqiang Dai, Hongyang Chen, Guoren Wang:
Efficient and Provable Effective Resistance Computation on Large Graphs: An Index-based Approach. Proc. ACM Manag. Data 2(3): 133 (2024)- [j10]Qiangqiang Dai, Rong-Hua Li, Donghang Cui, Meihao Liao, Yu-Xuan Qiu, Guoren Wang:
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee. Proc. ACM Manag. Data 2(3): 135 (2024) - [j9]Qiangqiang Dai, Ronghua Li, Donghang Cui, Guoren Wang:
Theoretically and Practically Efficient Maximum Defective Clique Search. Proc. ACM Manag. Data 2(4): 206:1-206:27 (2024) - [j8]Xiaowei Ye, Rong-Hua Li, Qiangqiang Dai, Hongzhi Chen, Guoren Wang:
Efficient $k$k-Clique Counting on Large Graphs: The Power of Color-Based Sampling Approaches. IEEE Trans. Knowl. Data Eng. 36(4): 1518-1536 (2024) - [c12]Jiaqi Jiang, Qi Zhang, Rong-Hua Li, Qiangqiang Dai, Guoren Wang:
I/O Efficient Max-Truss Computation in Large Static and Dynamic Graphs. ICDE 2024: 3217-3229 - [i4]Lantian Xu, Rong-Hua Li, Dong Wen, Qiangqiang Dai, Guoren Wang, Lu Qin:
Efficient Antagonistic k-plex Enumeration in Signed Graphs. CoRR abs/2406.16268 (2024) - 2023
- [j7]Meihao Liao, Rong-Hua Li, Qiangqiang Dai, Hongyang Chen, Hongchao Qin, Guoren Wang:
Efficient Resistance Distance Computation: The Power of Landmark-based Approaches. Proc. ACM Manag. Data 1(1): 68:1-68:27 (2023) - [j6]Qiangqiang Dai, Rong-Hua Li, Meihao Liao, Guoren Wang:
Maximal Defective Clique Enumeration. Proc. ACM Manag. Data 1(1): 77:1-77:26 (2023) - [j5]Xiaowei Ye, Rong-Hua Li, Qiangqiang Dai, Hongchao Qin, Guoren Wang:
Efficient Biclique Counting in Large Bipartite Graphs. Proc. ACM Manag. Data 1(1): 78:1-78:26 (2023) - [j4]Qiangqiang Dai, Rong-Hua Li, Xiaowei Ye, Meihao Liao, Weipeng Zhang, Guoren Wang:
Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches. Proc. ACM Manag. Data 1(2): 138:1-138:26 (2023) - [j3]Meihao Liao, Rong-Hua Li, Qiangqiang Dai, Hongyang Chen, Hongchao Qin, Guoren Wang:
Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches. Proc. ACM Manag. Data 1(2): 160:1-160:26 (2023) - [j2]Qiangqiang Dai, Rong-Hua Li, Guoren Wang, Rui Mao, Zhiwei Zhang, Ye Yuan:
Core Decomposition on Uncertain Graphs Revisited. IEEE Trans. Knowl. Data Eng. 35(1): 196-210 (2023) - [i3]Meihao Liao, Rong-Hua Li, Qiangqiang Dai, Hongyang Chen, Guoren Wang:
Scalable Algorithms for Laplacian Pseudo-inverse Computation. CoRR abs/2311.10290 (2023) - 2022
- [c11]Qiangqiang Dai, Rong-Hua Li, Hongchao Qin, Meihao Liao, Guoren Wang:
Scaling Up Maximal k-plex Enumeration. CIKM 2022: 345-354 - [c10]Qiangqiang Dai, Rong-Hua Li, Guoren Wang, Rui Mao, Zhiwei Zhang, Ye Yuan:
Core Decomposition on Uncertain Graphs Revisited (Extended Abstract). ICDE 2022: 1515-1516 - [c9]Zijian Chen, Rong-Hua Li, Hongchao Qin, Huanzhong Duan, Yanxiong Lu, Qiangqiang Dai, Guoren Wang:
Filtration-Enhanced Graph Transformation. IJCAI 2022: 1987-1993 - [c8]Qiangqiang Dai, Rong-Hua Li, Meihao Liao, Hongzhi Chen, Guoren Wang:
Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach. SIGMOD Conference 2022: 2034-2047 - [c7]Meihao Liao, Rong-Hua Li, Qiangqiang Dai, Guoren Wang:
Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach. SIGMOD Conference 2022: 2048-2061 - [c6]Xiaowei Ye, Rong-Hua Li, Qiangqiang Dai, Hongzhi Chen, Guoren Wang:
Lightning Fast and Space Efficient k-clique Counting. WWW 2022: 1191-1202 - [i2]Qiangqiang Dai, Rong-Hua Li, Hongchao Qin, Meihao Liao, Guoren Wang:
Fast Algorithm for Maximal k-plex Enumeration. CoRR abs/2203.10760 (2022) - 2021
- [j1]Rong-Hua Li, Qiangqiang Dai, Lu Qin, Guoren Wang, Xiaokui Xiao, Jeffrey Xu Yu, Shaojie Qiao:
Signed Clique Search in Signed Networks: Concepts and Algorithms. IEEE Trans. Knowl. Data Eng. 33(2): 710-727 (2021) - [c5]Qiangqiang Dai, Rong-Hua Li, Lu Qin, Guoren Wang, Weihua Yang, Zhiwei Zhang, Ye Yuan:
Scaling Up Distance-generalized Core Decomposition. CIKM 2021: 312-321 - 2020
- [i1]Qiangqiang Dai, Rong-Hua Li, Lu Qin, Guoren Wang, Weihua Yang, Zhiwei Zhang, Ye Yuan:
Scaling Up Distanced-generalized Core Decomposition. CoRR abs/2006.03372 (2020)
2010 – 2019
- 2019
- [c4]Rong-Hua Li, Qiangqiang Dai, Guoren Wang, Zhong Ming, Lu Qin, Jeffrey Xu Yu:
Improved Algorithms for Maximal Clique Search in Uncertain Networks. ICDE 2019: 1178-1189 - 2018
- [c3]Rong-Hua Li, Qiangqiang Dai, Lu Qin, Guoren Wang, Xiaokui Xiao, Jeffrey Xu Yu, Shaojie Qiao:
Efficient Signed Clique Search in Signed Networks. ICDE 2018: 245-256 - [c2]Rong-Hua Li, Jiao Su, Lu Qin, Jeffrey Xu Yu, Qiangqiang Dai:
Persistent Community Search in Temporal Networks. ICDE 2018: 797-808 - 2017
- [c1]Yazhong Chen, Rong-Hua Li, Qiangqiang Dai, Zhenjun Li, Shaojie Qiao, Rui Mao:
Incremental Structural Clustering for Dynamic Networks. WISE (1) 2017: 123-134
Coauthor Index
aka: Rong-Hua Li
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
