default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQingqiong Cai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Qingqiong Cai, Xingyue Guo, Shenwei Huang:
A self-supervised learning model for graph clustering optimization problems. Knowl. Based Syst. 290: 111549 (2024)- 2023
- [j11]Qingqiong Cai, Jan Goedgebeur
, Shenwei Huang:
Some results on k-critical P5-free graphs. Discret. Appl. Math. 334: 91-100 (2023) - 2022
- [j10]Qingqiong Cai, Neng Fan, Yongtang Shi, Shunyu Yao:
Integer linear programming formulations for double roman domination problem. Optim. Methods Softw. 37(1): 1-22 (2022) - 2021
- [i2]Qingqiong Cai, Jan Goedgebeur, Shenwei Huang:
Some Results on k-Critical P5-Free Graphs. CoRR abs/2108.05492 (2021)
2010 – 2019
- 2019
- [j9]Yuede Ma, Qingqiong Cai, Shunyu Yao:
Integer linear programming models for the weighted total domination problem. Appl. Math. Comput. 358: 146-150 (2019) - [j8]Qingqiong Cai, Tao Li, Yongtang Shi, Hua Wang:
Sum of weighted distances in trees. Discret. Appl. Math. 257: 67-84 (2019) - [c1]Qingqiong Cai, Shenwei Huang, Tao Li, Yongtang Shi:
Vertex-Critical ( P_5 P 5 , banner)-Free Graphs. FAW 2019: 111-120 - [i1]Qingqiong Cai, Neng Fan, Yongtang Shi, Shunyu Yao:
Integer Linear Programming Formulations for Double Roman Domination Problem. CoRR abs/1902.07863 (2019) - 2018
- [j7]Qingqiong Cai, Fuyuan Cao, Tao Li, Hua Wang:
On distances in vertex-weighted trees. Appl. Math. Comput. 333: 435-442 (2018) - [j6]Qingqiong Cai, Xueliang Li, Di Wu:
Some extremal results on the colorful monochromatic vertex-connectivity of a graph. J. Comb. Optim. 35(4): 1300-1311 (2018) - 2017
- [j5]Qingqiong Cai, Yingbin Ma, Jiangli Song:
Rainbow connection numbers of ladders and Mobius ladders. Ars Comb. 131: 321-330 (2017) - [j4]Qingqiong Cai, Xueliang Li, Di Wu:
Erdős-Gallai-type results for colorful monochromatic connectivity of a graph. J. Comb. Optim. 33(1): 123-131 (2017) - 2016
- [j3]Qingqiong Cai, Xueliang Li, Yan Zhao:
Note on the upper bound of the rainbow index of a graph. Discret. Appl. Math. 209: 68-74 (2016) - [j2]Qingqiong Cai, Xueliang Li, Yan Zhao:
The 3-rainbow index and connected dominating sets. J. Comb. Optim. 31(3): 1142-1159 (2016) - 2013
- [j1]Qingqiong Cai, Xueliang Li, Jiangli Song:
Solutions to conjectures on the (k, ℓ)-rainbow index of complete graphs. Networks 62(3): 220-224 (2013)
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 2024-08-14 23:21 CEST 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:
