Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYixin Cao 0001
Person information
- unicode name: 操宜新
- affiliation: Hong Kong Polytechnic University, Department of Computing
- affiliation: Hungarian Academy of Sciences, Institute for Computer Science and Control
- affiliation: Texas A&M University, Department of Computer Science and Engineering
Other persons with the same name
- Yixin Cao 0002
![[0000-0001-7157-6961]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-7157-6961")
— Singapore Management University, Singapore (and 2 more) - Yixin Cao 0003 — Zhong An Information and Technology Service Co., Ltd, Shanghai, China
- Yixin Cao 0004 — School of Advanced Technology, Xi'an Jiaotong-Liverpool University, Suzhou, China (and 1 more)
- Yixin Cao 0006 — Fudan University, School of Computer Science, Shanghai, China
- Yixin Cao 0007 — Hebei University of Technology, School of Artificial Intelligence and Data Science, Tianjin, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j24]Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye:
A Polynomial Kernel for Diamond-Free Editing. Algorithmica 84(1): 197-215 (2022)- [j23]Yixin Cao, Marcin Pilipczuk:
Preface to the Special Issue on Parameterized and Exact Computation. Algorithmica 84(8): 2240-2241 (2022) - [j22]Guozhen Rong, Yixin Cao, Jian-xin Wang, Zhifeng Wang:
Graph Searches and Their End Vertices. Algorithmica 84(9): 2642-2666 (2022) - [j21]Gabriel Bathie, Nicolas Bousquet, Yixin Cao, Yuping Ke, Théo Pierron:
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes. Algorithmica 84(11): 3338-3364 (2022) - [j20]Meibiao Zou, Zhifeng Wang, Jianxin Wang, Yixin Cao:
End vertices of graph searches on bipartite graphs. Inf. Process. Lett. 173: 106176 (2022) - [j19]Wenjun Li, Junjie Ye, Yixin Cao:
A 5k-vertex kernel for P2-packing. Theor. Comput. Sci. 910: 1-13 (2022) - 2021
- [j18]Hanchun Yuan, Yuping Ke, Yixin Cao:
Polynomial kernels for paw-free edge modification problems. Theor. Comput. Sci. 891: 1-12 (2021) - 2020
- [j17]Yixin Cao, R. B. Sandeep:
Minimum fill-in: Inapproximability and almost tight lower bounds. Inf. Comput. 271: 104514 (2020) - [j16]Yixin Cao:
Preface to the special issue on Computing and Combinatorics. Theor. Comput. Sci. 818: 1 (2020) - 2019
- [j15]Yixin Cao, Jianer Chen:
Preface to the Special Issue on Computing and Combinatorics. Algorithmica 81(11-12): 4165-4166 (2019) - [j14]Yixin Cao, Jianer Chen:
Preface to the special issue on computing and combinatorics. J. Comb. Optim. 37(2): 423 (2019) - 2018
- [j13]Yuping Ke, Yixin Cao, Xiating Ouyang, Wenjun Li, Jianxin Wang:
Unit interval vertex deletion: Fewer vertices are relevant. J. Comput. Syst. Sci. 95: 109-121 (2018) - [j12]Yixin Cao, Yuping Ke, Yota Otachi, Jie You:
Vertex deletion problems on chordal graphs. Theor. Comput. Sci. 745: 75-86 (2018) - 2017
- [j11]Yixin Cao, Luciano N. Grippo, Martín Darío Safe:
Forbidden induced subgraphs of normal Helly circular-arc graphs: Characterization and detection. Discret. Appl. Math. 216: 67-83 (2017) - [j10]Jie You, Jianxin Wang, Yixin Cao:
Approximate association via dissociation. Discret. Appl. Math. 219: 202-209 (2017) - [j9]Wenjun Li, Yixin Cao, Jianer Chen, Jianxin Wang:
Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree. Inf. Comput. 252: 187-200 (2017) - [j8]Yixin Cao:
Unit interval editing is fixed-parameter tractable. Inf. Comput. 253: 109-126 (2017) - 2016
- [j7]Yixin Cao, Dániel Marx:
Chordal Editing is Fixed-Parameter Tractable. Algorithmica 75(1): 118-137 (2016) - 2015
- [j6]Yixin Cao, Jianer Chen, Yang Liu:
On Feedback Vertex Set: New Measure and New Structures. Algorithmica 73(1): 63-86 (2015) - [j5]Yixin Cao, Dániel Marx:
Interval Deletion Is Fixed-Parameter Tractable. ACM Trans. Algorithms 11(3): 21:1-21:35 (2015) - [j4]Yunlong Liu, Jianxin Wang, Jie You, Jianer Chen, Yixin Cao:
Edge deletion problems: Branching facilitated by modular decomposition. Theor. Comput. Sci. 573: 63-70 (2015) - 2014
- [j3]Yixin Cao, Jianer Chen, Jia-Hao Fan:
An O(1.84k) parameterized algorithm for the multiterminal cut problem. Inf. Process. Lett. 114(4): 167-173 (2014) - 2013
- [j2]Yixin Cao:
Review of flows in networks by L. R. Ford Jr. and D. R. Fulkerson. SIGACT News 44(2): 28-30 (2013) - 2012
- [j1]Yixin Cao, Jianer Chen:
Cluster Editing: Kernelization Based on Edge Cuts. Algorithmica 64(1): 152-169 (2012)
Conference and Workshop Papers
- 2024
- [c27]Yixin Cao, Haowei Chen, Shenghua Wang:
Self-complementary (Pseudo-)Split Graphs. LATIN (2) 2024: 3-18 - 2023
- [c26]Yixin Cao:
Enumerating Maximal Induced Subgraphs. ESA 2023: 31:1-31:13 - [c25]Yixin Cao, Hanchun Yuan, Jianxin Wang:
Modification Problems Toward Proper (Helly) Circular-Arc Graphs. MFCS 2023: 31:1-31:14 - 2021
- [c24]Yixin Cao, Yuping Ke:
Improved Kernels for Edge Modification Problems. IPEC 2021: 13:1-13:14 - [c23]Yixin Cao:
Recognizing (Unit) Interval Graphs by Zigzag Graph Searches. SOSA 2021: 92-106 - [c22]Yixin Cao, Shenghua Wang:
Complementation in T-perfect Graphs. WG 2021: 106-117 - 2020
- [c21]Yixin Cao, Yuping Ke, Hanchun Yuan:
Polynomial Kernels for Paw-Free Edge Modification Problems. TAMC 2020: 37-49 - [c20]Yixin Cao, Guozhen Rong, Jianxin Wang:
Characterization and Linear-Time Recognition of Paired Threshold Graphs. WG 2020: 298-309 - 2019
- [c19]Jie You, Yixin Cao, Jianxin Wang:
Local Coloring: New Observations and New Reductions. FAW 2019: 51-62 - [c18]Yixin Cao, Zhifeng Wang, Guozhen Rong, Jianxin Wang:
Graph Searches and Their End Vertices. ISAAC 2019: 1:1-1:18 - 2018
- [c17]Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye:
A Polynomial Kernel for Diamond-Free Editing. ESA 2018: 10:1-10:13 - [c16]Wenjun Li, Junjie Ye, Yixin Cao:
Kernelization for P2-Packing: A Gerrymandering Approach. FAW 2018: 140-153 - [c15]Yixin Cao:
A Naive Algorithm for Feedback Vertex Set. SOSA 2018: 1:1-1:9 - 2017
- [c14]Yixin Cao, Yuping Ke, Yota Otachi, Jie You:
Vertex Deletion Problems on Chordal Graphs. FSTTCS 2017: 22:1-22:14 - [c13]Yixin Cao, R. B. Sandeep:
Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds. SODA 2017: 875-880 - 2016
- [c12]Yixin Cao:
Linear Recognition of Almost Interval Graphs. SODA 2016: 1096-1115 - [c11]Jie You, Jianxin Wang, Yixin Cao:
Approximate Association via Dissociation. WG 2016: 13-24 - 2015
- [c10]Yixin Cao:
Unit Interval Editing is Fixed-Parameter Tractable. ICALP (1) 2015: 306-317 - [c9]Wenjun Li, Jianxin Wang, Jianer Chen, Yixin Cao:
A 2k-vertex Kernel for Maximum Internal Spanning Tree. WADS 2015: 495-505 - 2014
- [c8]Yixin Cao:
Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time. FAW 2014: 13-24 - [c7]Yixin Cao, Dániel Marx:
Interval Deletion is Fixed-Parameter Tractable. SODA 2014: 122-141 - [c6]Yixin Cao, Dániel Marx:
Chordal Editing is Fixed-Parameter Tractable. STACS 2014: 214-225 - [c5]Xiaochun Cao, Xiao Wang, Di Jin, Yixin Cao, Dongxiao He:
The (un)supervised detection of overlapping communities as well as hubs and outliers via (bayesian) NMF. WWW (Companion Volume) 2014: 233-234 - 2013
- [c4]Yixin Cao, Jianer Chen, Jia-Hao Fan:
An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem. FCT 2013: 84-94 - [c3]Yixin Cao, Jianer Chen:
On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem. TAMC 2013: 319-330 - 2010
- [c2]Yixin Cao, Jianer Chen:
Cluster Editing: Kernelization Based on Edge Cuts. IPEC 2010: 60-71 - [c1]Yixin Cao, Jianer Chen, Yang Liu:
On Feedback Vertex Set New Measure and New Structures. SWAT 2010: 93-104
Editorship
- 2020
- [e3]Yixin Cao, Siu-Wing Cheng, Minming Li:
31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference). LIPIcs 181, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-173-3 [contents] - [e2]Yixin Cao, Marcin Pilipczuk:
15th International Symposium on Parameterized and Exact Computation, IPEC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference). LIPIcs 180, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-172-6 [contents] - 2017
- [e1]Yixin Cao, Jianer Chen:
Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings. Lecture Notes in Computer Science 10392, Springer 2017, ISBN 978-3-319-62388-7 [contents]
Informal and Other Publications
- 2024
- [i30]Yixin Cao, Jan Derbisz, Tomasz Krawczyk:
Characterization of Chordal Circular-arc Graphs: I. Split Graphs. CoRR abs/2403.01947 (2024) - [i29]Dhanyamol Antony, Yixin Cao, Sagartanu Pal, R. B. Sandeep:
Switching Classes: Characterization and Computation. CoRR abs/2403.04263 (2024) - [i28]Yixin Cao, Jingyi Liu, Jianxin Wang:
Minimum sum vertex cover: kernelization and parameterized algorithms. CoRR abs/2403.18497 (2024) - 2023
- [i27]Wei Tang, Zhiqian Wu, Yixin Cao, Yong Liao, Pengyuan Zhou:
FedMKGC: Privacy-Preserving Federated Multilingual Knowledge Graph Completion. CoRR abs/2312.10645 (2023) - 2022
- [i26]Yixin Cao, Jianxin Wang, Hanchun Yuan:
Modification Problems toward Proper (Helly) Circular-arc Graphs. CoRR abs/2202.00854 (2022) - [i25]Yixin Cao, Shenghua Wang:
On Fork-free T-perfect Graphs. CoRR abs/2211.03538 (2022) - 2021
- [i24]Yixin Cao, Yuping Ke:
Improved Kernels for Edge Modification Problems. CoRR abs/2104.14510 (2021) - [i23]Yixin Cao, Shenghua Wang:
Complementation in t-perfect graphs. CoRR abs/2104.14935 (2021) - 2020
- [i22]Yixin Cao, Yuping Ke, Hanchun Yuan:
Polynomial Kernels for Paw-free Edge Modification Problems. CoRR abs/2003.11273 (2020) - [i21]Yixin Cao:
Enumerating Maximal Induced Subgraphs. CoRR abs/2004.09885 (2020) - [i20]Yixin Cao:
Recognizing (Unit) Interval Graphs by Zigzag Graph Searches. CoRR abs/2010.03354 (2020) - 2019
- [i19]Yixin Cao, Guozhen Rong, Jianxin Wang, Zhifeng Wang:
Graph Searches and Their End Vertices. CoRR abs/1905.09505 (2019) - [i18]Guozhen Rong, Yixin Cao, Jianxin Wang:
Characterization and Linear-time Recognition of Paired Threshold Graphs. CoRR abs/1909.13029 (2019) - 2018
- [i17]Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye:
A Polynomial Kernel for Diamond-Free Editing. CoRR abs/1803.03358 (2018) - [i16]Wenjun Li, Junjie Ye, Yixin Cao:
A 5k-vertex Kernel for P2-packing. CoRR abs/1804.02801 (2018) - 2017
- [i15]Yixin Cao:
A Naive Algorithm for Feedback Vertex Set. CoRR abs/1707.08684 (2017) - [i14]Yixin Cao, Yuping Ke, Yota Otachi, Jie You:
Vertex Deletion Problems on Chordal Graphs. CoRR abs/1707.08690 (2017) - [i13]Yixin Cao, Jianer Chen, Jia-Hao Fan:
An O*(1.84sk) Parameterized Algorithm for the Multiterminal Cut Problem. CoRR abs/1711.06397 (2017) - 2016
- [i12]Yixin Cao, R. B. Sandeep:
Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds. CoRR abs/1606.08141 (2016) - [i11]Yuping Ke, Yixin Cao, Xiating Ouyang, Jianxin Wang:
Unit Interval Vertex Deletion: Fewer Vertices are Relevant. CoRR abs/1607.01162 (2016) - 2015
- [i10]Yixin Cao:
Unit Interval Editing is Fixed-Parameter Tractable. CoRR abs/1504.04470 (2015) - [i9]Jie You, Jianxin Wang, Yixin Cao:
Approximate Association via Dissociation. CoRR abs/1510.08276 (2015) - 2014
- [i8]Yixin Cao:
Linear Recognition of Almost (Unit) Interval Graphs. CoRR abs/1403.1515 (2014) - [i7]Yixin Cao, Luciano N. Grippo, Martín Darío Safe:
Forbidden Induced Subgraphs of Normal Helly Circular-Arc Graphs: Characterization and Detection. CoRR abs/1405.0329 (2014) - [i6]Yixin Cao, Dániel Marx:
Chordal Editing is Fixed-Parameter Tractable. CoRR abs/1405.7859 (2014) - [i5]Wenjun Li, Jianxin Wang, Jianer Chen, Yixin Cao:
A $2k$-Vertex Kernel for Maximum Internal Spanning Tree. CoRR abs/1412.8296 (2014) - 2013
- [i4]Yixin Cao:
An Efficient Branching Algorithm for Interval Completion. CoRR abs/1306.3181 (2013) - 2012
- [i3]Yixin Cao, Dániel Marx:
Interval Deletion is Fixed-Parameter Tractable. CoRR abs/1211.5933 (2012) - 2010
- [i2]Yixin Cao, Jianer Chen, Yang Liu:
On Feedback Vertex Set, New Measure and New Structures. CoRR abs/1004.1672 (2010) - [i1]Yixin Cao, Jianer Chen:
Weighted Cluster Editing: Kernelization based on Edge Cuts. CoRR abs/1008.4250 (2010)
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-04-21 18:22 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:
