On well (edge) dominated and equimatchable strong product graphs.

Yixin Cao 0001 操宜新 Hong Kong Polytechnic University, Department of Computing Hungarian Academy of Sciences, Institute for Computer Science and Control Texas A&M University, Department of Computer Science and Engineering http://www4.comp.polyu.edu.hk/~csycao/ https://sites.google.com/site/yixincaoresearch/ https://scholar.google.com/citations?user=vnVm31kAAAAJ https://dl.acm.org/profile/81758918257 https://orcid.org/0000-0002-6927-438X Yixin Cao Yixin Cao 0002 Singapore Management University, Singapore National University of Singapore, School of Computing, Singapore Tsinghua University, Beijing, Department of Computer Science and Technology https://sites.google.com/view/yixin-homepage/%E9%A6%96%E9%A1%B5 https://scholar.google.com/citations?user=CnhTvdoAAAAJ https://openreview.net/profile?id=~Yixin_Cao2 https://orcid.org/0000-0001-7157-6961 https://orcid.org/0000-0002-1632-7812 https://ieeexplore.ieee.org/author/37088410452 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 University of Liverpool, Liverpool, UK 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

Yixin Cao 0001 Guiqiang Mou Jianxin Wang On well (edge) dominated and equimatchable strong product graphs. 114718 2026 349 Discret. Math. 2 https://doi.org/10.1016/j.disc.2025.114718 db/journals/dm/dm349.html#CaoMW26 streams/journals/dm

Peng Li Xiangzhi Tu Zhao Zhang 0002 Yixin Cao 0001 Partial interval multicover: Approximation and complexity. 2026 115958 1075 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2026.115958 db/journals/tcs/tcs1075.html#LiTZC26 streams/journals/tcs

Jingyi Liu Yixin Cao 0001 Ling Gai Jianxin Wang Minimum sum vertex cover: Difficulty of ordering. 115371 2025 1049 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2025.115371 db/journals/tcs/tcs1049.html#LiuCGW25 streams/journals/tcs

Yixin Cao 0001 Hanchun Yuan Jianxin Wang 0001 Modification problems toward proper (Helly) circular-arc graphs. 105211 2024 301 Inf. Comput. https://doi.org/10.1016/j.ic.2024.105211 db/journals/iandc/iandc301.html#CaoYW24 streams/journals/iandc

Vicente Balmaseda Ying Xu Yixin Cao 0001 Nate Veldt Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better. 2024 ICML https://proceedings.mlr.press/v235/balmaseda24a.html https://openreview.net/forum?id=FpbKoIPHxb conf/icml/2024 db/conf/icml/icml2024.html#BalmasedaX0V24 2586-2606 Yixin Cao 0001 Haowei Chen Shenghua Wang Self-complementary (Pseudo-)Split Graphs. 3-18 2024 LATIN (2) https://doi.org/10.1007/978-3-031-55601-2_1 conf/latin/2024-2 db/conf/latin/latin2024-2.html#CaoCW24 Dhanyamol Antony Yixin Cao 0001 Sagartanu Pal R. B. Sandeep Switching Classes: Characterization and Computation. 11:1-11:15 2024 MFCS https://doi.org/10.4230/LIPIcs.MFCS.2024.11 conf/mfcs/2024 db/conf/mfcs/mfcs2024.html#Antony0PS24

Yixin Cao 0001 Jan Derbisz Tomasz Krawczyk Characterization of Chordal Circular-arc Graphs: I. Split Graphs. 2024 abs/2403.01947 CoRR https://doi.org/10.48550/arXiv.2403.01947 db/journals/corr/corr2403.html#abs-2403-01947

Dhanyamol Antony Yixin Cao 0001 Sagartanu Pal R. B. Sandeep Switching Classes: Characterization and Computation. 2024 abs/2403.04263 CoRR https://doi.org/10.48550/arXiv.2403.04263 db/journals/corr/corr2403.html#abs-2403-04263

Yixin Cao 0001 Jingyi Liu Jianxin Wang 0001 Minimum sum vertex cover: kernelization and parameterized algorithms. 2024 abs/2403.18497 CoRR https://doi.org/10.48550/arXiv.2403.18497 db/journals/corr/corr2403.html#abs-2403-18497

Vicente Balmaseda Ying Xu Yixin Cao 0001 Nate Veldt Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better. 2024 abs/2404.16131 CoRR https://doi.org/10.48550/arXiv.2404.16131 db/journals/corr/corr2404.html#abs-2404-16131

Yixin Cao 0001 Tomasz Krawczyk Characterization of Circular-arc Graphs: II. McConnell Flipping. 2024 abs/2408.10892 CoRR https://doi.org/10.48550/arXiv.2408.10892 db/journals/corr/corr2408.html#abs-2408-10892 streams/journals/corr

Yixin Cao 0001 Tomasz Krawczyk Characterization of Circular-arc Graphs: III. Chordal Graphs. 2024 abs/2409.02733 CoRR https://doi.org/10.48550/arXiv.2409.02733 db/journals/corr/corr2409.html#abs-2409-02733 streams/journals/corr

Yixin Cao 0001 Enumerating Maximal Induced Subgraphs. 31:1-31:13 2023 ESA https://doi.org/10.4230/LIPIcs.ESA.2023.31 conf/esa/2023 db/conf/esa/esa2023.html#000123 Yixin Cao 0001 Hanchun Yuan Jianxin Wang 0001 Modification Problems Toward Proper (Helly) Circular-Arc Graphs. 31:1-31:14 2023 MFCS https://doi.org/10.4230/LIPIcs.MFCS.2023.31 conf/mfcs/2023 db/conf/mfcs/mfcs2023.html#0001Y023

Wei Tang 0015 Zhiqian Wu Yixin Cao 0001 Yong Liao 0003 Pengyuan Zhou FedMKGC: Privacy-Preserving Federated Multilingual Knowledge Graph Completion. 2023 abs/2312.10645 CoRR https://doi.org/10.48550/arXiv.2312.10645 db/journals/corr/corr2312.html#abs-2312-10645

Yixin Cao 0001 Ashutosh Rai 0001 R. B. Sandeep Junjie Ye 0002 A Polynomial Kernel for Diamond-Free Editing. 197-215 2022 84 Algorithmica 1 https://doi.org/10.1007/s00453-021-00891-y db/journals/algorithmica/algorithmica84.html#CaoRSY22

Yixin Cao 0001 Marcin Pilipczuk Preface to the Special Issue on Parameterized and Exact Computation. 2240-2241 2022 84 Algorithmica 8 https://doi.org/10.1007/s00453-022-00998-w db/journals/algorithmica/algorithmica84.html#CaoP22

Guozhen Rong Yixin Cao 0001 Jian-xin Wang 0001 Zhifeng Wang Graph Searches and Their End Vertices. 2642-2666 2022 84 Algorithmica 9 https://doi.org/10.1007/s00453-022-00981-5 db/journals/algorithmica/algorithmica84.html#RongCWW22

Gabriel Bathie Nicolas Bousquet 0001 Yixin Cao 0001 Yuping Ke Théo Pierron (Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes. 3338-3364 2022 84 Algorithmica 11 https://doi.org/10.1007/s00453-022-00969-1 db/journals/algorithmica/algorithmica84.html#BathieBCKP22

Meibiao Zou Zhifeng Wang Jianxin Wang 0001 Yixin Cao 0001 End vertices of graph searches on bipartite graphs. 106176 2022 173 Inf. Process. Lett. https://doi.org/10.1016/j.ipl.2021.106176 db/journals/ipl/ipl173.html#ZouWWC22

Wenjun Li 0001 Junjie Ye 0002 Yixin Cao 0001 A 5k-vertex kernel for P2-packing. 1-13 2022 910 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2022.01.032 db/journals/tcs/tcs910.html#LiYC22

Yixin Cao 0001 Jianxin Wang 0001 Hanchun Yuan Modification Problems toward Proper (Helly) Circular-arc Graphs. 2022 abs/2202.00854 CoRR https://arxiv.org/abs/2202.00854 db/journals/corr/corr2202.html#abs-2202-00854

Yixin Cao 0001 Shenghua Wang On Fork-free T-perfect Graphs. 2022 abs/2211.03538 CoRR https://doi.org/10.48550/arXiv.2211.03538 db/journals/corr/corr2211.html#abs-2211-03538

Hanchun Yuan Yuping Ke Yixin Cao 0001 Polynomial kernels for paw-free edge modification problems. 1-12 2021 891 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2021.08.015 db/journals/tcs/tcs891.html#YuanKC21

Yixin Cao 0001 Yuping Ke Improved Kernels for Edge Modification Problems. 13:1-13:14 2021 IPEC https://doi.org/10.4230/LIPIcs.IPEC.2021.13 conf/iwpec/2021 db/conf/iwpec/ipec2021.html#0001K21 Yixin Cao 0001 Recognizing (Unit) Interval Graphs by Zigzag Graph Searches. 92-106 2021 SOSA https://doi.org/10.1137/1.9781611976496.11 conf/sosa/2021 db/conf/sosa/sosa2021.html#Cao21 Yixin Cao 0001 Shenghua Wang Complementation in T-perfect Graphs. 106-117 2021 WG https://doi.org/10.1007/978-3-030-86838-3_8 conf/wg/2021 db/conf/wg/wg2021.html#CaoW21

Yixin Cao 0001 Yuping Ke Improved Kernels for Edge Modification Problems. 2021 abs/2104.14510 CoRR https://arxiv.org/abs/2104.14510 db/journals/corr/corr2104.html#abs-2104-14510

Yixin Cao 0001 Shenghua Wang Complementation in t-perfect graphs. 2021 abs/2104.14935 CoRR https://arxiv.org/abs/2104.14935 db/journals/corr/corr2104.html#abs-2104-14935

Yixin Cao 0001 R. B. Sandeep Minimum fill-in: Inapproximability and almost tight lower bounds. 104514 2020 271 Inf. Comput. https://doi.org/10.1016/j.ic.2020.104514 https://www.wikidata.org/entity/Q126345508 db/journals/iandc/iandc271.html#CaoS20

Yixin Cao 0001 Preface to the special issue on Computing and Combinatorics. 1 2020 818 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2020.04.001 db/journals/tcs/tcs818.html#000120

Yixin Cao 0001 Yuping Ke Hanchun Yuan Polynomial Kernels for Paw-Free Edge Modification Problems. 37-49 2020 TAMC https://doi.org/10.1007/978-3-030-59267-7_4 conf/tamc/2020 db/conf/tamc/tamc2020.html#0001KY20 Yixin Cao 0001 Guozhen Rong Jianxin Wang 0001 Characterization and Linear-Time Recognition of Paired Threshold Graphs. 298-309 2020 WG https://doi.org/10.1007/978-3-030-60440-0_24 conf/wg/2020 db/conf/wg/wg2020.html#CaoRW20 Yixin Cao 0001 Siu-Wing Cheng Minming Li 31st International Symposium on Algorithms and Computation, ISAAC 2020, Hong Kong (Virtual Conference), December 14-18, 2020 ISAAC Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020 LIPIcs 181 978-3-95977-173-3 https://www.dagstuhl.de/dagpub/978-3-95977-173-3 db/conf/isaac/isaac2020.html Yixin Cao 0001 Marcin Pilipczuk 15th International Symposium on Parameterized and Exact Computation, IPEC 2020, Hong Kong (Virtual Conference), December 14-18, 2020 IPEC Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020 LIPIcs 180 978-3-95977-172-6 https://www.dagstuhl.de/dagpub/978-3-95977-172-6 db/conf/iwpec/ipec2020.html

Yixin Cao 0001 Yuping Ke Hanchun Yuan Polynomial Kernels for Paw-free Edge Modification Problems. 2020 abs/2003.11273 CoRR https://arxiv.org/abs/2003.11273 db/journals/corr/corr2003.html#abs-2003-11273

Yixin Cao 0001 Enumerating Maximal Induced Subgraphs. 2020 abs/2004.09885 CoRR https://arxiv.org/abs/2004.09885 db/journals/corr/corr2004.html#abs-2004-09885

Yixin Cao 0001 Recognizing (Unit) Interval Graphs by Zigzag Graph Searches. 2020 abs/2010.03354 CoRR https://arxiv.org/abs/2010.03354 db/journals/corr/corr2010.html#abs-2010-03354

Yixin Cao 0001 Jianer Chen Preface to the Special Issue on Computing and Combinatorics. 4165-4166 2019 81 Algorithmica 11-12 https://doi.org/10.1007/s00453-019-00632-2 https://www.wikidata.org/entity/Q127204794 db/journals/algorithmica/algorithmica81.html#CaoC19

Yixin Cao 0001 Jianer Chen Preface to the special issue on computing and combinatorics. 423 2019 37 J. Comb. Optim. 2 https://doi.org/10.1007/s10878-019-00392-3 db/journals/jco/jco37.html#CaoC19

Jie You Yixin Cao 0001 Jianxin Wang 0001 Local Coloring: New Observations and New Reductions. 51-62 2019 FAW https://doi.org/10.1007/978-3-030-18126-0_5 conf/faw/2019 db/conf/faw/faw2019.html#You0W19 Yixin Cao 0001 Zhifeng Wang Guozhen Rong Jianxin Wang 0001 Graph Searches and Their End Vertices. 1:1-1:18 2019 ISAAC https://doi.org/10.4230/LIPIcs.ISAAC.2019.1 conf/isaac/2019 db/conf/isaac/isaac2019.html#0001WRW19

Yixin Cao 0001 Guozhen Rong Jianxin Wang 0001 Zhifeng Wang Graph Searches and Their End Vertices. 2019 abs/1905.09505 CoRR http://arxiv.org/abs/1905.09505 db/journals/corr/corr1905.html#abs-1905-09505

Guozhen Rong Yixin Cao 0001 Jianxin Wang 0001 Characterization and Linear-time Recognition of Paired Threshold Graphs. 2019 abs/1909.13029 CoRR http://arxiv.org/abs/1909.13029 db/journals/corr/corr1909.html#abs-1909-13029

Yuping Ke Yixin Cao 0001 Xiating Ouyang Wenjun Li 0001 Jianxin Wang 0001 Unit interval vertex deletion: Fewer vertices are relevant. 109-121 2018 95 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2018.01.001 https://www.wikidata.org/entity/Q130160419 db/journals/jcss/jcss95.html#KeCOLW18

Yixin Cao 0001 Yuping Ke Yota Otachi Jie You Vertex deletion problems on chordal graphs. 75-86 2018 745 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2018.05.039 db/journals/tcs/tcs745.html#0001KOY18

Yixin Cao 0001 Ashutosh Rai 0001 R. B. Sandeep Junjie Ye 0002 A Polynomial Kernel for Diamond-Free Editing. 10:1-10:13 2018 ESA https://doi.org/10.4230/LIPIcs.ESA.2018.10 conf/esa/2018 db/conf/esa/esa2018.html#00010SY18 Wenjun Li 0001 Junjie Ye 0002 Yixin Cao 0001 Kernelization for P2-Packing: A Gerrymandering Approach. 140-153 2018 FAW https://doi.org/10.1007/978-3-319-78455-7_11 conf/faw/2018 db/conf/faw/faw2018.html#LiY018 Yixin Cao 0001 A Naive Algorithm for Feedback Vertex Set. 1:1-1:9 2018 SOSA https://doi.org/10.4230/OASIcs.SOSA.2018.1 conf/soda/2018sosa db/conf/soda/sosa2018.html#Cao18

Yixin Cao 0001 Ashutosh Rai 0001 R. B. Sandeep Junjie Ye 0002 A Polynomial Kernel for Diamond-Free Editing. 2018 abs/1803.03358 CoRR http://arxiv.org/abs/1803.03358 db/journals/corr/corr1803.html#abs-1803-03358

Wenjun Li 0001 Junjie Ye 0002 Yixin Cao 0001 A 5k-vertex Kernel for P2-packing. 2018 abs/1804.02801 CoRR http://arxiv.org/abs/1804.02801 db/journals/corr/corr1804.html#abs-1804-02801

Yixin Cao 0001 Luciano N. Grippo Martín Darío Safe Forbidden induced subgraphs of normal Helly circular-arc graphs: Characterization and detection. 67-83 2017 216 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2015.08.023 db/journals/dam/dam216.html#CaoGS17

Jie You Jianxin Wang 0001 Yixin Cao 0001 Approximate association via dissociation. 202-209 2017 219 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2016.11.007 db/journals/dam/dam219.html#YouW017

Wenjun Li 0001 Yixin Cao 0001 Jianer Chen Jianxin Wang 0001 Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree. 187-200 2017 252 Inf. Comput. https://doi.org/10.1016/j.ic.2016.11.003 db/journals/iandc/iandc252.html#Li0CW17

Yixin Cao 0001 Unit interval editing is fixed-parameter tractable. 109-126 2017 253 Inf. Comput. https://doi.org/10.1016/j.ic.2017.01.008 db/journals/iandc/iandc253.html#Cao17

Yixin Cao 0001 Yuping Ke Yota Otachi Jie You Vertex Deletion Problems on Chordal Graphs. 22:1-22:14 2017 FSTTCS https://doi.org/10.4230/LIPIcs.FSTTCS.2017.22 conf/fsttcs/2017 db/conf/fsttcs/fsttcs2017.html#CaoKOY17 Yixin Cao 0001 R. B. Sandeep Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds. 875-880 2017 SODA https://doi.org/10.1137/1.9781611974782.55 http://dl.acm.org/citation.cfm?id=3039741 conf/soda/2017 db/conf/soda/soda2017.html#0001S17 Yixin Cao 0001 Jianer Chen Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings COCOON Springer 2017 Lecture Notes in Computer Science 10392 978-3-319-62388-7 978-3-319-62389-4 https://doi.org/10.1007/978-3-319-62389-4 db/conf/cocoon/cocoon2017.html

Yixin Cao 0001 A Naive Algorithm for Feedback Vertex Set. 2017 abs/1707.08684 CoRR http://arxiv.org/abs/1707.08684 db/journals/corr/corr1707.html#000117a

Yixin Cao 0001 Yuping Ke Yota Otachi Jie You Vertex Deletion Problems on Chordal Graphs. 2017 abs/1707.08690 CoRR http://arxiv.org/abs/1707.08690 db/journals/corr/corr1707.html#0001KOY17

Yixin Cao 0001 Jianer Chen Jia-Hao Fan An O*(1.84sk) Parameterized Algorithm for the Multiterminal Cut Problem. 2017 abs/1711.06397 CoRR http://arxiv.org/abs/1711.06397 db/journals/corr/corr1711.html#abs-1711-06397

Yixin Cao 0001 Dániel Marx Chordal Editing is Fixed-Parameter Tractable. 118-137 2016 75 Algorithmica 1 https://doi.org/10.1007/s00453-015-0014-x db/journals/algorithmica/algorithmica75.html#CaoM16

Yixin Cao 0001 Linear Recognition of Almost Interval Graphs. 1096-1115 2016 SODA https://doi.org/10.1137/1.9781611974331.ch77 http://dl.acm.org/citation.cfm?id=2884512 conf/soda/2016 db/conf/soda/soda2016.html#Cao16 Jie You Jianxin Wang 0001 Yixin Cao 0001 Approximate Association via Dissociation. 13-24 2016 WG https://doi.org/10.1007/978-3-662-53536-3_2 conf/wg/2016 db/conf/wg/wg2016.html#YouW016

Yixin Cao 0001 R. B. Sandeep Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds. 2016 abs/1606.08141 CoRR http://arxiv.org/abs/1606.08141 db/journals/corr/corr1606.html#CaoS16

Yuping Ke Yixin Cao 0001 Xiating Ouyang Jianxin Wang 0001 Unit Interval Vertex Deletion: Fewer Vertices are Relevant. 2016 abs/1607.01162 CoRR http://arxiv.org/abs/1607.01162 db/journals/corr/corr1607.html#Ke0OW16

Yixin Cao 0001 Jianer Chen Yang Liu 0002 On Feedback Vertex Set: New Measure and New Structures. 63-86 2015 73 Algorithmica 1 https://doi.org/10.1007/s00453-014-9904-6 db/journals/algorithmica/algorithmica73.html#CaoC015

Yixin Cao 0001 Dániel Marx Interval Deletion Is Fixed-Parameter Tractable. 21:1-21:35 2015 11 ACM Trans. Algorithms 3 https://doi.org/10.1145/2629595 db/journals/talg/talg11.html#CaoM15

Yunlong Liu 0001 Jianxin Wang 0001 Jie You Jianer Chen Yixin Cao 0001 Edge deletion problems: Branching facilitated by modular decomposition. 63-70 2015 573 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2015.01.049 db/journals/tcs/tcs573.html#LiuWYCC15

Yixin Cao 0001 Unit Interval Editing is Fixed-Parameter Tractable. 306-317 2015 ICALP (1) https://doi.org/10.1007/978-3-662-47672-7_25 conf/icalp/2015-1 db/conf/icalp/icalp2015-1.html#Cao15 Wenjun Li 0001 Jianxin Wang 0001 Jianer Chen Yixin Cao 0001 A 2k-vertex Kernel for Maximum Internal Spanning Tree. 495-505 2015 WADS https://doi.org/10.1007/978-3-319-21840-3_41 conf/wads/2015 db/conf/wads/wads2015.html#LiWCC15

Yixin Cao 0001 Unit Interval Editing is Fixed-Parameter Tractable. 2015 abs/1504.04470 CoRR http://arxiv.org/abs/1504.04470 db/journals/corr/corr1504.html#Cao15

Jie You Jianxin Wang 0001 Yixin Cao 0001 Approximate Association via Dissociation. 2015 abs/1510.08276 CoRR http://arxiv.org/abs/1510.08276 db/journals/corr/corr1510.html#YouWC15

Yixin Cao 0001 Jianer Chen Jia-Hao Fan An O(1.84k) parameterized algorithm for the multiterminal cut problem. 167-173 2014 114 Inf. Process. Lett. 4 https://doi.org/10.1016/j.ipl.2013.12.001 db/journals/ipl/ipl114.html#CaoCF14

Yixin Cao 0001 Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time. 13-24 2014 FAW https://doi.org/10.1007/978-3-319-08016-1_2 conf/faw/2014 db/conf/faw/faw2014.html#Cao14 Yixin Cao 0001 Dániel Marx Interval Deletion is Fixed-Parameter Tractable. 122-141 2014 SODA https://doi.org/10.1137/1.9781611973402.9 conf/soda/2014 db/conf/soda/soda2014.html#CaoM14 Yixin Cao 0001 Dániel Marx Chordal Editing is Fixed-Parameter Tractable. 214-225 2014 STACS https://doi.org/10.4230/LIPIcs.STACS.2014.214 conf/stacs/2014 db/conf/stacs/stacs2014.html#CaoM14 Xiaochun Cao Xiao Wang 0017 Di Jin 0001 Yixin Cao 0001 Dongxiao He The (un)supervised detection of overlapping communities as well as hubs and outliers via (bayesian) NMF. 233-234 2014 WWW (Companion Volume) https://doi.org/10.1145/2567948.2577307 conf/www/2014c db/conf/www/www2014c.html#CaoWJCH14

Yixin Cao 0001 Linear Recognition of Almost (Unit) Interval Graphs. 2014 abs/1403.1515 CoRR http://arxiv.org/abs/1403.1515 db/journals/corr/corr1403.html#Cao14

Yixin Cao 0001 Luciano N. Grippo Martín Darío Safe Forbidden Induced Subgraphs of Normal Helly Circular-Arc Graphs: Characterization and Detection. 2014 abs/1405.0329 CoRR http://arxiv.org/abs/1405.0329 db/journals/corr/corr1405.html#CaoGS14

Yixin Cao 0001 Dániel Marx Chordal Editing is Fixed-Parameter Tractable. 2014 abs/1405.7859 CoRR http://arxiv.org/abs/1405.7859 db/journals/corr/corr1405.html#0001M14b

Wenjun Li 0001 Jianxin Wang 0001 Jianer Chen Yixin Cao 0001 A $2k$-Vertex Kernel for Maximum Internal Spanning Tree. 2014 abs/1412.8296 CoRR http://arxiv.org/abs/1412.8296 db/journals/corr/corr1412.html#LiWCC14

Yixin Cao 0001 Review of flows in networks by L. R. Ford Jr. and D. R. Fulkerson. 28-30 2013 44 SIGACT News 2 https://doi.org/10.1145/2491533.2491542 db/journals/sigact/sigact44.html#Cao13

Yixin Cao 0001 Jianer Chen Jia-Hao Fan An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem. 84-94 2013 FCT https://doi.org/10.1007/978-3-642-40164-0_11 conf/fct/2013 db/conf/fct/fct2013.html#CaoCF13 Yixin Cao 0001 Jianer Chen On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem. 319-330 2013 TAMC https://doi.org/10.1007/978-3-642-38236-9_29 conf/tamc/2013 db/conf/tamc/tamc2013.html#CaoC13

Yixin Cao 0001 An Efficient Branching Algorithm for Interval Completion. 2013 CoRR http://arxiv.org/abs/1306.3181 abs/1306.3181 db/journals/corr/corr1306.html#Cao13a

Yixin Cao 0001 Jianer Chen Cluster Editing: Kernelization Based on Edge Cuts. 152-169 2012 64 Algorithmica 1 https://doi.org/10.1007/s00453-011-9595-1 db/journals/algorithmica/algorithmica64.html#CaoC12

Yixin Cao 0001 Dániel Marx Interval Deletion is Fixed-Parameter Tractable http://arxiv.org/abs/1211.5933 2012 CoRR abs/1211.5933 db/journals/corr/corr1211.html#abs-1211-5933

Yixin Cao 0001 Jianer Chen Cluster Editing: Kernelization Based on Edge Cuts. 60-71 2010 IPEC https://doi.org/10.1007/978-3-642-17493-3_8 conf/iwpec/2010 db/conf/iwpec/ipec2010.html#CaoC10 Yixin Cao 0001 Jianer Chen Yang Liu 0002 On Feedback Vertex Set New Measure and New Structures. 93-104 2010 SWAT https://doi.org/10.1007/978-3-642-13731-0_10 conf/swat/2010 db/conf/swat/swat2010.html#CaoCL10

Yixin Cao 0001 Jianer Chen Yang Liu 0002 On Feedback Vertex Set, New Measure and New Structures http://arxiv.org/abs/1004.1672 2010 CoRR abs/1004.1672 db/journals/corr/corr1004.html#abs-1004-1672

Yixin Cao 0001 Jianer Chen Weighted Cluster Editing: Kernelization based on Edge Cuts http://arxiv.org/abs/1008.4250 2010 CoRR abs/1008.4250 db/journals/corr/corr1008.html#abs-1008-4250

Dhanyamol Antony Vicente Balmaseda Gabriel Bathie Nicolas Bousquet 0001 Xiaochun Cao Haowei Chen Jianer Chen Siu-Wing Cheng Jan Derbisz Jia-Hao Fan Ling Gai Luciano N. Grippo Dongxiao He Di Jin 0001 Yuping Ke Tomasz Krawczyk Minming Li Peng Li Wenjun Li 0001 Yong Liao 0003 Jingyi Liu Yang Liu 0002 Yunlong Liu 0001 Dániel Marx Guiqiang Mou Yota Otachi Xiating Ouyang Sagartanu Pal Théo Pierron Marcin Pilipczuk Ashutosh Rai 0001 Guozhen Rong Martín Darío Safe R. B. Sandeep Wei Tang 0015 Xiangzhi Tu Nate Veldt Jianxin Wang Jianxin Wang 0001Jian-xin Wang 0001 Shenghua Wang Xiao Wang 0017 Zhifeng Wang Zhiqian Wu Ying Xu Junjie Ye 0002 Jie You Hanchun Yuan Zhao Zhang 0002 Peng Yuan ZhouPengyuan Zhou Meibiao Zou