BibTeX records: Leizhen Cai

download as .bib file

@article{DBLP:journals/tcs/CaiY19,
  author       = {Leizhen Cai and
                  Junjie Ye},
  title        = {Two edge-disjoint paths with length constraints},
  journal      = {Theor. Comput. Sci.},
  volume       = {795},
  pages        = {275--284},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.07.009},
  doi          = {10.1016/J.TCS.2019.07.009},
  timestamp    = {Thu, 31 Oct 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CaiY19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/PangC19,
  author       = {Ho Lam Pang and
                  Leizhen Cai},
  editor       = {Pinar Heggernes},
  title        = {Complexity of Vertex Switching on Edge-Bicolored Graphs},
  booktitle    = {Algorithms and Complexity - 11th International Conference, {CIAC}
                  2019, Rome, Italy, May 27-29, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11485},
  pages        = {339--351},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-17402-6\_28},
  doi          = {10.1007/978-3-030-17402-6\_28},
  timestamp    = {Mon, 20 May 2019 12:11:06 +0200},
  biburl       = {https://dblp.org/rec/conf/ciac/PangC19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-10531,
  author       = {Leizhen Cai and
                  On Yin Leung},
  title        = {Alternating Path and Coloured Clustering},
  journal      = {CoRR},
  volume       = {abs/1807.10531},
  year         = {2018},
  url          = {http://arxiv.org/abs/1807.10531},
  eprinttype    = {arXiv},
  eprint       = {1807.10531},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1807-10531.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-11339,
  author       = {Leizhen Cai},
  title        = {Vertex Covers Revisited: Indirect Certificates and {FPT} Algorithms},
  journal      = {CoRR},
  volume       = {abs/1807.11339},
  year         = {2018},
  url          = {http://arxiv.org/abs/1807.11339},
  eprinttype    = {arXiv},
  eprint       = {1807.11339},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1807-11339.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CaiY16,
  author       = {Leizhen Cai and
                  Junjie Ye},
  editor       = {Pinar Heggernes},
  title        = {Finding Two Edge-Disjoint Paths with Length Constraints},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 42nd International
                  Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {9941},
  pages        = {62--73},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-662-53536-3\_6},
  doi          = {10.1007/978-3-662-53536-3\_6},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/CaiY16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaiC15,
  author       = {Leizhen Cai and
                  Yufei Cai},
  title        = {Incompressibility of H-Free Edge Modification Problems},
  journal      = {Algorithmica},
  volume       = {71},
  number       = {3},
  pages        = {731--757},
  year         = {2015},
  url          = {https://doi.org/10.1007/s00453-014-9937-x},
  doi          = {10.1007/S00453-014-9937-X},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/CaiC15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaiCL15,
  author       = {Leizhen Cai and
                  Siu{-}Wing Cheng and
                  Tak Wah Lam},
  title        = {Guest Editors Foreword},
  journal      = {Algorithmica},
  volume       = {73},
  number       = {4},
  pages        = {621--622},
  year         = {2015},
  url          = {https://doi.org/10.1007/s00453-015-0070-2},
  doi          = {10.1007/S00453-015-0070-2},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/CaiCL15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaiY15,
  author       = {Leizhen Cai and
                  Junjie Ye},
  title        = {Parameterized complexity of finding connected induced subgraphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {607},
  pages        = {49--59},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.05.020},
  doi          = {10.1016/J.TCS.2015.05.020},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CaiY15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GuoC15,
  author       = {Chengwei Guo and
                  Leizhen Cai},
  title        = {Obtaining split graphs by edge contraction},
  journal      = {Theor. Comput. Sci.},
  volume       = {607},
  pages        = {60--67},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.01.056},
  doi          = {10.1016/J.TCS.2015.01.056},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GuoC15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CaiY15,
  author       = {Leizhen Cai and
                  Junjie Ye},
  title        = {Finding Two Edge-Disjoint Paths with Length Constraints},
  journal      = {CoRR},
  volume       = {abs/1509.05559},
  year         = {2015},
  url          = {http://arxiv.org/abs/1509.05559},
  eprinttype    = {arXiv},
  eprint       = {1509.05559},
  timestamp    = {Tue, 17 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/CaiY15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/GuoC14,
  author       = {Chengwei Guo and
                  Leizhen Cai},
  editor       = {Qianping Gu and
                  Pavol Hell and
                  Boting Yang},
  title        = {Obtaining Split Graphs by Edge Contraction},
  booktitle    = {Algorithmic Aspects in Information and Management - 10th International
                  Conference, {AAIM} 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8546},
  pages        = {208--218},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-07956-1\_19},
  doi          = {10.1007/978-3-319-07956-1\_19},
  timestamp    = {Tue, 14 May 2019 10:00:41 +0200},
  biburl       = {https://dblp.org/rec/conf/aaim/GuoC14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/CaiY14,
  author       = {Leizhen Cai and
                  Junjie Ye},
  editor       = {Qianping Gu and
                  Pavol Hell and
                  Boting Yang},
  title        = {Parameterized Complexity of Connected Induced Subgraph Problems},
  booktitle    = {Algorithmic Aspects in Information and Management - 10th International
                  Conference, {AAIM} 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8546},
  pages        = {219--230},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-07956-1\_20},
  doi          = {10.1007/978-3-319-07956-1\_20},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/aaim/CaiY14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CaiY14,
  author       = {Leizhen Cai and
                  Junjie Ye},
  editor       = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
                  Martin Dietzfelbinger and
                  Zolt{\'{a}}n {\'{E}}sik},
  title        = {Dual Connectedness of Edge-Bicolored Graphs and Beyond},
  booktitle    = {Mathematical Foundations of Computer Science 2014 - 39th International
                  Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
                  Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {8635},
  pages        = {141--152},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-662-44465-8\_13},
  doi          = {10.1007/978-3-662-44465-8\_13},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/CaiY14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/CaiC13,
  author       = {Leizhen Cai and
                  Yufei Cai},
  editor       = {Gregory Z. Gutin and
                  Stefan Szeider},
  title        = {Incompressibility of H-Free Edge Modification},
  booktitle    = {Parameterized and Exact Computation - 8th International Symposium,
                  {IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
                  Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8246},
  pages        = {84--96},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-319-03898-8\_9},
  doi          = {10.1007/978-3-319-03898-8\_9},
  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/CaiC13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/CaiG13,
  author       = {Leizhen Cai and
                  Chengwei Guo},
  editor       = {Gregory Z. Gutin and
                  Stefan Szeider},
  title        = {Contracting Few Edges to Remove Forbidden Induced Subgraphs},
  booktitle    = {Parameterized and Exact Computation - 8th International Symposium,
                  {IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
                  Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8246},
  pages        = {97--109},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-319-03898-8\_10},
  doi          = {10.1007/978-3-319-03898-8\_10},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/CaiG13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/2013,
  editor       = {Leizhen Cai and
                  Siu{-}Wing Cheng and
                  Tak Wah Lam},
  title        = {Algorithms and Computation - 24th International Symposium, {ISAAC}
                  2013, Hong Kong, China, December 16-18, 2013, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8283},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-45030-3},
  doi          = {10.1007/978-3-642-45030-3},
  isbn         = {978-3-642-45029-7},
  timestamp    = {Tue, 14 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/2013.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CaiG13,
  author       = {Leizhen Cai and
                  Chengwei Guo},
  title        = {Contracting Graphs to Split Graphs and Threshold Graphs},
  journal      = {CoRR},
  volume       = {abs/1310.5786},
  year         = {2013},
  url          = {http://arxiv.org/abs/1310.5786},
  eprinttype    = {arXiv},
  eprint       = {1310.5786},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/CaiG13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/XiaoCY11,
  author       = {Mingyu Xiao and
                  Leizhen Cai and
                  Andrew Chi{-}Chih Yao},
  title        = {Tight Approximation Ratio of a General Greedy Splitting Algorithm
                  for the Minimum \emph{k}-Way Cut Problem},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {4},
  pages        = {510--520},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9316-1},
  doi          = {10.1007/S00453-009-9316-1},
  timestamp    = {Mon, 08 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/XiaoCY11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CaiY11,
  author       = {Leizhen Cai and
                  Boting Yang},
  title        = {Parameterized complexity of even/odd subgraph problems},
  journal      = {J. Discrete Algorithms},
  volume       = {9},
  number       = {3},
  pages        = {231--240},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.jda.2011.03.004},
  doi          = {10.1016/J.JDA.2011.03.004},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jda/CaiY11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CaiWZ10,
  author       = {Leizhen Cai and
                  Weifan Wang and
                  Xuding Zhu},
  title        = {Choosability of toroidal graphs without short cycles},
  journal      = {J. Graph Theory},
  volume       = {65},
  number       = {1},
  pages        = {1--15},
  year         = {2010},
  url          = {https://doi.org/10.1002/jgt.20460},
  doi          = {10.1002/JGT.20460},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/CaiWZ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CaiCVZ10,
  author       = {Leizhen Cai and
                  Yongxi Cheng and
                  Elad Verbin and
                  Yuan Zhou},
  title        = {Surviving Rates of Graphs with Bounded Treewidth for the Firefighter
                  Problem},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {24},
  number       = {4},
  pages        = {1322--1335},
  year         = {2010},
  url          = {https://doi.org/10.1137/100791130},
  doi          = {10.1137/100791130},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/CaiCVZ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CaiY10,
  author       = {Leizhen Cai and
                  Boting Yang},
  editor       = {Tiziana Calamoneri and
                  Josep D{\'{\i}}az},
  title        = {Parameterized Complexity of Even/Odd Subgraph Problems},
  booktitle    = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
                  Rome, Italy, May 26-28, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6078},
  pages        = {85--96},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-13073-1\_9},
  doi          = {10.1007/978-3-642-13073-1\_9},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/ciac/CaiY10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CaiW09,
  author       = {Leizhen Cai and
                  Weifan Wang},
  title        = {The Surviving Rate of a Graph for the Firefighter Problem},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {23},
  number       = {4},
  pages        = {1814--1826},
  year         = {2009},
  url          = {https://doi.org/10.1137/070700395},
  doi          = {10.1137/070700395},
  timestamp    = {Tue, 28 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/CaiW09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/Cai08,
  author       = {Leizhen Cai},
  title        = {Parameterized Complexity of Cardinality Constrained Optimization Problems},
  journal      = {Comput. J.},
  volume       = {51},
  number       = {1},
  pages        = {102--121},
  year         = {2008},
  url          = {https://doi.org/10.1093/comjnl/bxm086},
  doi          = {10.1093/COMJNL/BXM086},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cj/Cai08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WangC08,
  author       = {Weifan Wang and
                  Leizhen Cai},
  title        = {Labelling planar graphs without 4-cycles with a condition on distance
                  two},
  journal      = {Discret. Appl. Math.},
  volume       = {156},
  number       = {12},
  pages        = {2241--2249},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.dam.2007.05.061},
  doi          = {10.1016/J.DAM.2007.05.061},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/WangC08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CaiVY08,
  author       = {Leizhen Cai and
                  Elad Verbin and
                  Lin Yang},
  editor       = {Seok{-}Hee Hong and
                  Hiroshi Nagamochi and
                  Takuro Fukunaga},
  title        = {Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability
                  and a Subexponential Algorithm},
  booktitle    = {Algorithms and Computation, 19th International Symposium, {ISAAC}
                  2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5369},
  pages        = {258--269},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-92182-0\_25},
  doi          = {10.1007/978-3-540-92182-0\_25},
  timestamp    = {Thu, 27 Apr 2023 14:57:19 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/CaiVY08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0811-3723,
  author       = {Mingyu Xiao and
                  Leizhen Cai and
                  Andrew C. Yao},
  title        = {Tight Approximation Ratio of a General Greedy Splitting Algorithm
                  for the Minimum k-Way Cut Problem},
  journal      = {CoRR},
  volume       = {abs/0811.3723},
  year         = {2008},
  url          = {http://arxiv.org/abs/0811.3723},
  eprinttype    = {arXiv},
  eprint       = {0811.3723},
  timestamp    = {Mon, 08 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0811-3723.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/CaiCC06,
  author       = {Leizhen Cai and
                  Siu Man Chan and
                  Siu On Chan},
  editor       = {Hans L. Bodlaender and
                  Michael A. Langston},
  title        = {Random Separation: {A} New Method for Solving Fixed-Cardinality Optimization
                  Problems},
  booktitle    = {Parameterized and Exact Computation, Second International Workshop,
                  {IWPEC} 2006, Z{\"{u}}rich, Switzerland, September 13-15, 2006,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4169},
  pages        = {239--250},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11847250\_22},
  doi          = {10.1007/11847250\_22},
  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/CaiCC06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Cai03a,
  author       = {Leizhen Cai},
  title        = {Parameterized Complexity of Vertex Colouring},
  journal      = {Discret. Appl. Math.},
  volume       = {127},
  number       = {3},
  pages        = {415--429},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0166-218X(02)00242-1},
  doi          = {10.1016/S0166-218X(02)00242-1},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Cai03a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Cai03b,
  author       = {Leizhen Cai},
  title        = {The complexity of the locally connected spanning tree problem},
  journal      = {Discret. Appl. Math.},
  volume       = {131},
  number       = {1},
  pages        = {63--75},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0166-218X(02)00417-1},
  doi          = {10.1016/S0166-218X(02)00417-1},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Cai03b.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CaiCP01,
  author       = {Leizhen Cai and
                  Derek G. Corneil and
                  Andrzej Proskurowski},
  title        = {Stable 2-pairs and (\emph{X, Y})-intersection graphs},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {119--131},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00075-3},
  doi          = {10.1016/S0012-365X(00)00075-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/CaiCP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CaiZ01,
  author       = {Leizhen Cai and
                  Xuding Zhu},
  title        = {Game chromatic index of \emph{k}-degenerate graphs},
  journal      = {J. Graph Theory},
  volume       = {36},
  number       = {3},
  pages        = {144--155},
  year         = {2001},
  url          = {https://doi.org/10.1002/1097-0118(200103)36:3\&\#60;144::AID-JGT1002\&\#62;3.0.CO;2-F},
  doi          = {10.1002/1097-0118(200103)36:3\&\#60;144::AID-JGT1002\&\#62;3.0.CO;2-F},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/CaiZ01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CaiXZ99,
  author       = {Leizhen Cai and
                  Yin{-}Feng Xu and
                  Binhai Zhu},
  title        = {Computing the Optimal Bridge Between Two Convex Polygons},
  journal      = {Inf. Process. Lett.},
  volume       = {69},
  number       = {3},
  pages        = {127--130},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0020-0190(99)00003-4},
  doi          = {10.1016/S0020-0190(99)00003-4},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/CaiXZ99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CaiS97,
  author       = {Leizhen Cai and
                  Baruch Schieber},
  title        = {A Linear-time Algorithm for Computing the Intersection of All Odd
                  Cycles in a Graph},
  journal      = {Discret. Appl. Math.},
  volume       = {73},
  number       = {1},
  pages        = {27--34},
  year         = {1997},
  url          = {https://doi.org/10.1016/S0166-218X(96)00074-1},
  doi          = {10.1016/S0166-218X(96)00074-1},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/CaiS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Cai97,
  author       = {Leizhen Cai},
  title        = {On Spanning 2-trees in a Graph},
  journal      = {Discret. Appl. Math.},
  volume       = {74},
  number       = {3},
  pages        = {203--216},
  year         = {1997},
  url          = {https://doi.org/10.1016/S0166-218X(96)00045-5},
  doi          = {10.1016/S0166-218X(96)00045-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Cai97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/CaiK97,
  author       = {Leizhen Cai and
                  J. Mark Keil},
  title        = {Computing Visibility Information in an Inaccurate Simple Polygon},
  journal      = {Int. J. Comput. Geom. Appl.},
  volume       = {7},
  number       = {6},
  pages        = {515--538},
  year         = {1997},
  url          = {https://doi.org/10.1142/S0218195997000326},
  doi          = {10.1142/S0218195997000326},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijcga/CaiK97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cai96,
  author       = {Leizhen Cai},
  title        = {Fixed-Parameter Tractability of Graph Modification Problems for Hereditary
                  Properties},
  journal      = {Inf. Process. Lett.},
  volume       = {58},
  number       = {4},
  pages        = {171--176},
  year         = {1996},
  url          = {https://doi.org/10.1016/0020-0190(96)00050-6},
  doi          = {10.1016/0020-0190(96)00050-6},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/Cai96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CaiCP96,
  author       = {Leizhen Cai and
                  Derek G. Corneil and
                  Andrzej Proskurowski},
  title        = {A generalization of line graphs: (\emph{X, Y})-intersection graphs},
  journal      = {J. Graph Theory},
  volume       = {21},
  number       = {3},
  pages        = {267--287},
  year         = {1996},
  url          = {https://doi.org/10.1002/(SICI)1097-0118(199603)21:3\&\#60;267::AID-JGT2\&\#62;3.0.CO;2-O},
  doi          = {10.1002/(SICI)1097-0118(199603)21:3\&\#60;267::AID-JGT2\&\#62;3.0.CO;2-O},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/CaiCP96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CaiC96,
  author       = {Leizhen Cai and
                  Derek G. Corneil},
  title        = {A generalization of perfect graphs - \emph{i}-perfect graphs},
  journal      = {J. Graph Theory},
  volume       = {23},
  number       = {1},
  pages        = {87--103},
  year         = {1996},
  url          = {https://doi.org/10.1002/(SICI)1097-0118(199609)23:1\&\#60;87::AID-JGT10\&\#62;3.0.CO;2-H},
  doi          = {10.1002/(SICI)1097-0118(199609)23:1\&\#60;87::AID-JGT10\&\#62;3.0.CO;2-H},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/CaiC96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/Cai96,
  author       = {Leizhen Cai},
  editor       = {Frank Fiala and
                  Evangelos Kranakis and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack},
  title        = {Algorithms on Polygonal Embeddings of Graphs},
  booktitle    = {Proceedings of the 8th Canadian Conference on Computational Geometry,
                  Carleton University, Ottawa, Canada, August 12-15, 1996},
  pages        = {300--305},
  publisher    = {Carleton University Press},
  year         = {1996},
  url          = {http://www.cccg.ca/proceedings/1996/cccg1996\_0050.pdf},
  timestamp    = {Wed, 12 May 2021 14:19:37 +0200},
  biburl       = {https://dblp.org/rec/conf/cccg/Cai96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaiC95,
  author       = {Leizhen Cai and
                  Derek G. Corneil},
  title        = {Isomorphic Tree Spanner Problems},
  journal      = {Algorithmica},
  volume       = {14},
  number       = {2},
  pages        = {138--153},
  year         = {1995},
  url          = {https://doi.org/10.1007/BF01293665},
  doi          = {10.1007/BF01293665},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/CaiC95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Cai95,
  author       = {Leizhen Cai},
  title        = {Path decompositions of multigraphs},
  journal      = {J. Graph Theory},
  volume       = {19},
  number       = {3},
  pages        = {297--307},
  year         = {1995},
  url          = {https://doi.org/10.1002/jgt.3190190303},
  doi          = {10.1002/JGT.3190190303},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Cai95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CaiC95,
  author       = {Leizhen Cai and
                  Derek G. Corneil},
  title        = {Tree Spanners},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {8},
  number       = {3},
  pages        = {359--387},
  year         = {1995},
  url          = {https://doi.org/10.1137/S0895480192237403},
  doi          = {10.1137/S0895480192237403},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/CaiC95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asian/Cai95,
  author       = {Leizhen Cai},
  editor       = {Kanchana Kanchanasut and
                  Jean{-}Jacques L{\'{e}}vy},
  title        = {Spanning 2-Trees},
  booktitle    = {Algorithms, Concurrency and Knowledge: 1995 Asian Computing Science
                  Conference, {ACSC} '95, Pathumthani, Thailand, December 11-13, 1995,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1023},
  pages        = {10--22},
  publisher    = {Springer},
  year         = {1995},
  url          = {https://doi.org/10.1007/3-540-60688-2\_31},
  doi          = {10.1007/3-540-60688-2\_31},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/asian/Cai95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/CaiE95,
  author       = {Leizhen Cai and
                  Hazel Everett},
  title        = {Visibility graphs of polygonal rings},
  booktitle    = {Proceedings of the 7th Canadian Conference on Computational Geometry,
                  Quebec City, Quebec, Canada, August 1995},
  pages        = {157--161},
  publisher    = {Carleton University, Ottawa, Canada},
  year         = {1995},
  url          = {http://www.cccg.ca/proceedings/1995/cccg1995\_0026.pdf},
  timestamp    = {Wed, 12 May 2021 14:19:37 +0200},
  biburl       = {https://dblp.org/rec/conf/cccg/CaiE95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Cai94,
  author       = {Leizhen Cai},
  title        = {NP-Completeness of Minimum Spanner Problems},
  journal      = {Discret. Appl. Math.},
  volume       = {48},
  number       = {2},
  pages        = {187--194},
  year         = {1994},
  url          = {https://doi.org/10.1016/0166-218X(94)90073-6},
  doi          = {10.1016/0166-218X(94)90073-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Cai94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CaiK94,
  author       = {Leizhen Cai and
                  J. Mark Keil},
  title        = {Spanners in graphs of bounded degree},
  journal      = {Networks},
  volume       = {24},
  number       = {4},
  pages        = {233--249},
  year         = {1994},
  url          = {https://doi.org/10.1002/net.3230240406},
  doi          = {10.1002/NET.3230240406},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/CaiK94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CaiM93,
  author       = {Leizhen Cai and
                  Fr{\'{e}}d{\'{e}}ric Maffray},
  title        = {On the {SPANNING} \emph{k}-Tree Problem},
  journal      = {Discret. Appl. Math.},
  volume       = {44},
  number       = {1-3},
  pages        = {139--156},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90228-G},
  doi          = {10.1016/0166-218X(93)90228-G},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/CaiM93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cai93,
  author       = {Leizhen Cai},
  title        = {The Recognition of Union Trees},
  journal      = {Inf. Process. Lett.},
  volume       = {45},
  number       = {6},
  pages        = {279--283},
  year         = {1993},
  url          = {https://doi.org/10.1016/0020-0190(93)90037-A},
  doi          = {10.1016/0020-0190(93)90037-A},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Cai93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/CaiK93,
  author       = {Leizhen Cai and
                  J. Mark Keil},
  title        = {Degree-Bounded Spanners},
  journal      = {Parallel Process. Lett.},
  volume       = {3},
  pages        = {457--468},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129626493000484},
  doi          = {10.1142/S0129626493000484},
  timestamp    = {Tue, 24 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ppl/CaiK93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ca/Cai92,
  author       = {Leizhen Cai},
  title        = {Tree spanners, spanning trees that approximate distances},
  school       = {University of Toronto, Canada},
  year         = {1992},
  url          = {https://librarysearch.library.utoronto.ca/permalink/01UTORONTO\_INST/14bjeso/alma991106762633306196},
  timestamp    = {Wed, 10 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/ca/Cai92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CaiE92,
  author       = {Leizhen Cai and
                  John A. Ellis},
  title        = {Edge colouring line graphs of unicyclic graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {36},
  number       = {1},
  pages        = {75--82},
  year         = {1992},
  url          = {https://doi.org/10.1016/0166-218X(92)90206-P},
  doi          = {10.1016/0166-218X(92)90206-P},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/CaiE92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CaiC92,
  author       = {Leizhen Cai and
                  Derek G. Corneil},
  title        = {On cycle double covers of line graphs},
  journal      = {Discret. Math.},
  volume       = {102},
  number       = {1},
  pages        = {103--106},
  year         = {1992},
  url          = {https://doi.org/10.1016/0012-365X(92)90355-J},
  doi          = {10.1016/0012-365X(92)90355-J},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/CaiC92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CaiE91,
  author       = {Leizhen Cai and
                  John A. Ellis},
  title        = {NP-completeness of edge-colouring some restricted graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {30},
  number       = {1},
  pages        = {15--27},
  year         = {1991},
  url          = {https://doi.org/10.1016/0166-218X(91)90010-T},
  doi          = {10.1016/0166-218X(91)90010-T},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/CaiE91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics