VLDB 2026 Research / reviewers in the wild / expert
Qingqiong Cai
dblp:139/0463
· DBLP profile ↗
6ranked-venue papers
5as first author
3since 2021 · last 2025
0000-0002-3170-7004ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 3 first-author · 1 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Learning to solve combinatorial optimization problems with heterophily
Xingyue Guo, Qingqiong Cai |
Neural Networks | 3 |
| 2024 | A self-supervised learning model for graph clustering optimization problems
Qingqiong Cai, Xingyue Guo, Shenwei Huang |
Knowl. Based Syst. | 1 |
| 2023 | Some results on k-critical P5-free graphs
Qingqiong Cai, Jan Goedgebeur, Shenwei Huang |
Discret. Appl. Math. | 1 |
| 2019 | Sum of weighted distances in trees
Qingqiong Cai, Tao Li 0022, Yongtang Shi, Hua Wang 0003 |
Discret. Appl. Math. | 1 |
| 2016 | Note on the upper bound of the rainbow index of a graph
Qingqiong Cai, Xueliang Li 0001, Yan Zhao 0013 |
Discret. Appl. Math. | 1 |
| 2013 | Solutions to conjectures on the (k, ℓ)-rainbow index of complete graphsabstractThe ‐rainbow index of a graph G was introduced by Chartrand et al. (Network 54(2) (2009), 75–81; 55 (2010), 360–367). For the complete graph Kn of order , they showed that for . Furthermore, they conjectured that for every positive integer , there exists a positive integer N such that for every integer . More generally, they conjectured that for every pair of positive integers k and with , there exists a positive integer N such that for every integer . This article provides solutions to these conjectures. © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 62(3), 220–224 2013 Qingqiong Cai, Xueliang Li 0001, Jiangli Song |
Networks | 1 |