default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKaiqiang Yu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j13]Yang Liu
, Hejiao Huang, Kaiqiang Yu, Shengxin Liu, Cheng Long:
Efficient Maximum s-Bundle Search via Local Vertex Connectivity. Proc. ACM Manag. Data 3(1): 37:1-37:27 (2025)- [j12]Kaiqiang Yu, Kaixin Wang, Cheng Long, Laks V. S. Lakshmanan, Reynold Cheng:
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach. Proc. ACM Manag. Data 3(3): 160:1-160:27 (2025) - [j11]Yang Liu, Hejiao Huang, Kaiqiang Yu, Shengxin Liu, Cheng Long:
Minimum $k$k-Vertex Connected Graph Search. IEEE Trans. Knowl. Data Eng. 37(7): 4159-4165 (2025) - [j10]Shuohao Gao, Kaiqiang Yu, Shengxin Liu, Cheng Long, Xun Zhou:
On Searching and Querying Maximum Directed $(k,\ell )$(k,ℓ)-Plex. IEEE Trans. Knowl. Data Eng. 37(8): 4743-4757 (2025) - [c11]Kaixin Wang, Kaiqiang Yu, Cheng Long:
Maximal Clique Enumeration with Hybrid Branching and Early Termination. ICDE 2025: 599-612 - [i12]Kaiqiang Yu, Kaixin Wang, Cheng Long, Laks V. S. Lakshmanan, Reynold Cheng:
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach. CoRR abs/2502.11557 (2025) - [i11]Hongbo Xia, Kaiqiang Yu, Shengxin Liu, Cheng Long, Xun Zhou:
Maximum Degree-Based Quasi-Clique Search via an Iterative Framework. CoRR abs/2505.15118 (2025) - [i10]Yinyu Liu, Kaiqiang Yu, Shengxin Liu, Cheng Long, Zhaoquan Gu:
Temporal k-Core Query, Revisited. CoRR abs/2508.15238 (2025) - 2024
- [j9]Kaixin Wang, Kaiqiang Yu, Cheng Long:
Efficient k-Clique Listing: An Edge-Oriented Branching Strategy. Proc. ACM Manag. Data 2(1): 7:1-7:26 (2024) - [j8]Shuohao Gao, Kaiqiang Yu, Shengxin Liu, Cheng Long:
Maximum k-Plex Search: An Alternated Reduction-and-Bound Method. Proc. VLDB Endow. 18(2): 363-376 (2024) - [c10]Shuohao Gao, Kaiqiang Yu, Shengxin Liu, Cheng Long, Zelong Qiu:
On Searching Maximum Directed (k, 𝓁)-Plex. ICDE 2024: 2570-2583 - [c9]Mo Sha, Kaiqiang Yu, Shuangyu Cai, Boyu Tian, Huanchen Zhang, Mingyu Gao:
Reproducibility Report for ACM SIGMOD 2024 Paper: 'PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory Hardware'. SIGMOD/PODS 2024: 24-27 - [c8]Hein Meling, Yue Gong, Kaiqiang Yu, Cheng Long:
Reproducibility Report for ACM SIGMOD 2024 Paper: 'Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach'. SIGMOD/PODS 2024: 91-93 - [i9]Shuohao Gao, Kaiqiang Yu, Shengxin Liu, Cheng Long:
Maximum k-Plex Search: An Alternated Reduction-and-Bound Method. CoRR abs/2406.00617 (2024) - [i8]Kaixin Wang, Kaiqiang Yu, Cheng Long:
Maximal Clique Enumeration with Hybrid Branching and Early Termination. CoRR abs/2412.08218 (2024) - 2023
- [j7]Kaiqiang Yu, Cheng Long:
Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach. Proc. ACM Manag. Data 1(1): 49:1-49:26 (2023) - [j6]Kaiqiang Yu, Cheng Long:
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach. Proc. ACM Manag. Data 1(3): 211:1-211:26 (2023) - [j5]Kaiqiang Yu, Cheng Long, Deepak P, Tanmoy Chakraborty:
On Efficient Large Maximal Biplex Discovery. IEEE Trans. Knowl. Data Eng. 35(1): 824-829 (2023) - [i7]Kaiqiang Yu, Cheng Long:
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach. CoRR abs/2305.14047 (2023) - [i6]Kaixin Wang, Kaiqiang Yu, Cheng Long:
Efficient k-Clique Listing: An Edge-Oriented Branching Strategy. CoRR abs/2311.13798 (2023) - 2022
- [j4]Yu Gu, Kaiqiang Yu, Zhen Song, Jianzhong Qi, Zhigang Wang, Ge Yu, Rui Zhang:
Distributed Hypergraph Processing Using Intersection Graphs. IEEE Trans. Knowl. Data Eng. 34(7): 3182-3195 (2022) - [j3]Jinglian He, Kaiqiang Yu, Yuanming Shi, Yong Zhou, Wei Chen, Khaled B. Letaief:
Reconfigurable Intelligent Surface Assisted Massive MIMO With Antenna Selection. IEEE Trans. Wirel. Commun. 21(7): 4769-4783 (2022) - [c7]Kaiqiang Yu, Cheng Long, Deepak P, Tanmoy Chakraborty:
On Efficient Large Maximal Biplex Discovery (Extended abstract). ICDE 2022: 1483-1484 - [c6]Kaiqiang Yu, Cheng Long, Shengxin Liu, Da Yan:
Efficient Algorithms for Maximal k-Biplex Enumeration. SIGMOD Conference 2022: 860-873 - [i5]Kaiqiang Yu, Cheng Long:
Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach. CoRR abs/2208.13207 (2022) - 2021
- [j2]Kejun Wang, Liangliang Liu, Xinnan Ding, Kaiqiang Yu, Gang Hu:
A partition approach for robust gait recognition based on gait template fusion. Frontiers Inf. Technol. Electron. Eng. 22(5): 709-719 (2021) - [i4]Kaiqiang Yu, Cheng Long, Shengxin Liu, Da Yan:
Efficient Algorithms for Maximal k-Biplex Enumeration. CoRR abs/2112.14414 (2021) - 2020
- [c5]Jinglian He, Min Fu, Kaiqiang Yu, Yuanming Shi:
Phase Retrieval via Difference of Convex Programming. VTC Spring 2020: 1-5 - [c4]Jinglian He, Kaiqiang Yu, Yuanming Shi:
Coordinated Passive Beamforming for Distributed Intelligent Reflecting Surfaces Network. VTC Spring 2020: 1-5 - [c3]Jinglian He, Kaiqiang Yu, Yong Zhou, Yuanming Shi:
Reconfigurable Intelligent Surface Enhanced Cognitive Radio Networks. VTC Fall 2020: 1-5 - [i3]Jinglian He, Kaiqiang Yu, Yuanming Shi:
Coordinated Passive Beamforming for Distributed Intelligent Reflecting Surfaces Network. CoRR abs/2002.05915 (2020) - [i2]Jinglian He, Kaiqiang Yu, Yuanming Shi, Yong Zhou, Wei Chen, Khaled B. Letaief:
Reconfigurable Intelligent Surface Assisted Massive MIMO with Antenna Selection. CoRR abs/2009.07546 (2020)
2010 – 2019
- 2019
- [j1]Yixiang Fang, Kaiqiang Yu, Reynold Cheng, Laks V. S. Lakshmanan, Xuemin Lin:
Efficient Algorithms for Densest Subgraph Discovery. Proc. VLDB Endow. 12(11): 1719-1732 (2019) - [c2]Kaiqiang Yu, Yu Gu, Shuo Yao, Zhen Song, Ge Yu:
Iterative Hypergraph Computation Based on Hyperedge-Connected Graphs. APWeb/WAIM (1) 2019: 273-280 - [c1]Kaiqiang Yu, Jinglian He, Yuanming Shi:
Stochastic Submodular Maximization for Scalable Network Adaptation in Dense Cloud-RAN. ICC 2019: 1-6 - [i1]Yixiang Fang, Kaiqiang Yu, Reynold Cheng, Laks V. S. Lakshmanan, Xuemin Lin:
Efficient Algorithms for Densest Subgraph Discovery. CoRR abs/1906.00341 (2019)
Coauthor Index
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 2025-10-29 01:52 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:
