default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeizhen Cai
Person information
- affiliation: Chinese University of Hong Kong
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j34]Leizhen Cai, Junjie Ye:
Two edge-disjoint paths with length constraints. Theor. Comput. Sci. 795: 275-284 (2019)- [c13]Ho Lam Pang, Leizhen Cai:
Complexity of Vertex Switching on Edge-Bicolored Graphs. CIAC 2019: 339-351 - 2018
- [i5]Leizhen Cai, On Yin Leung:
Alternating Path and Coloured Clustering. CoRR abs/1807.10531 (2018) - [i4]Leizhen Cai:
Vertex Covers Revisited: Indirect Certificates and FPT Algorithms. CoRR abs/1807.11339 (2018) - 2016
- [c12]Leizhen Cai, Junjie Ye
:
Finding Two Edge-Disjoint Paths with Length Constraints. WG 2016: 62-73 - 2015
- [j33]Leizhen Cai, Yufei Cai:
Incompressibility of H-Free Edge Modification Problems. Algorithmica 71(3): 731-757 (2015) - [j32]Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam:
Guest Editors Foreword. Algorithmica 73(4): 621-622 (2015) - [j31]Leizhen Cai, Junjie Ye:
Parameterized complexity of finding connected induced subgraphs. Theor. Comput. Sci. 607: 49-59 (2015) - [j30]Chengwei Guo, Leizhen Cai:
Obtaining split graphs by edge contraction. Theor. Comput. Sci. 607: 60-67 (2015) - [i3]Leizhen Cai, Junjie Ye:
Finding Two Edge-Disjoint Paths with Length Constraints. CoRR abs/1509.05559 (2015) - 2014
- [c11]Chengwei Guo, Leizhen Cai:
Obtaining Split Graphs by Edge Contraction. AAIM 2014: 208-218 - [c10]Leizhen Cai, Junjie Ye:
Parameterized Complexity of Connected Induced Subgraph Problems. AAIM 2014: 219-230 - [c9]Leizhen Cai, Junjie Ye:
Dual Connectedness of Edge-Bicolored Graphs and Beyond. MFCS (2) 2014: 141-152 - 2013
- [c8]Leizhen Cai, Yufei Cai:
Incompressibility of H-Free Edge Modification. IPEC 2013: 84-96 - [c7]Leizhen Cai, Chengwei Guo:
Contracting Few Edges to Remove Forbidden Induced Subgraphs. IPEC 2013: 97-109 - [e1]Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam:
Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings. Lecture Notes in Computer Science 8283, Springer 2013, ISBN 978-3-642-45029-7 [contents] - [i2]Leizhen Cai, Chengwei Guo:
Contracting Graphs to Split Graphs and Threshold Graphs. CoRR abs/1310.5786 (2013) - 2011
- [j29]Mingyu Xiao, Leizhen Cai, Andrew Chi-Chih Yao:
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem. Algorithmica 59(4): 510-520 (2011) - [j28]Leizhen Cai, Boting Yang:
Parameterized complexity of even/odd subgraph problems. J. Discrete Algorithms 9(3): 231-240 (2011) - 2010
- [j27]Leizhen Cai, Weifan Wang, Xuding Zhu:
Choosability of toroidal graphs without short cycles. J. Graph Theory 65(1): 1-15 (2010) - [j26]Leizhen Cai, Yongxi Cheng, Elad Verbin, Yuan Zhou:
Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem. SIAM J. Discret. Math. 24(4): 1322-1335 (2010) - [c6]Leizhen Cai, Boting Yang:
Parameterized Complexity of Even/Odd Subgraph Problems. CIAC 2010: 85-96
2000 – 2009
- 2009
- [j25]Leizhen Cai, Weifan Wang:
The Surviving Rate of a Graph for the Firefighter Problem. SIAM J. Discret. Math. 23(4): 1814-1826 (2009) - 2008
- [j24]Leizhen Cai:
Parameterized Complexity of Cardinality Constrained Optimization Problems. Comput. J. 51(1): 102-121 (2008) - [j23]Weifan Wang, Leizhen Cai:
Labelling planar graphs without 4-cycles with a condition on distance two. Discret. Appl. Math. 156(12): 2241-2249 (2008) - [c5]Leizhen Cai, Elad Verbin, Lin Yang:
Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential Algorithm. ISAAC 2008: 258-269 - [i1]Mingyu Xiao, Leizhen Cai, Andrew C. Yao:
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem. CoRR abs/0811.3723 (2008) - 2006
- [c4]Leizhen Cai, Siu Man Chan, Siu On Chan:
Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems. IWPEC 2006: 239-250 - 2003
- [j22]Leizhen Cai:
Parameterized Complexity of Vertex Colouring. Discret. Appl. Math. 127(3): 415-429 (2003) - [j21]Leizhen Cai:
The complexity of the locally connected spanning tree problem. Discret. Appl. Math. 131(1): 63-75 (2003) - 2001
- [j20]Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski:
Stable 2-pairs and (X, Y)-intersection graphs. Discret. Math. 230(1-3): 119-131 (2001) - [j19]Leizhen Cai, Xuding Zhu:
Game chromatic index of k-degenerate graphs. J. Graph Theory 36(3): 144-155 (2001)
1990 – 1999
- 1999
- [j18]Leizhen Cai, Yin-Feng Xu, Binhai Zhu:
Computing the Optimal Bridge Between Two Convex Polygons. Inf. Process. Lett. 69(3): 127-130 (1999) - 1997
- [j17]Leizhen Cai, Baruch Schieber:
A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph. Discret. Appl. Math. 73(1): 27-34 (1997) - [j16]Leizhen Cai:
On Spanning 2-trees in a Graph. Discret. Appl. Math. 74(3): 203-216 (1997) - [j15]Leizhen Cai, J. Mark Keil:
Computing Visibility Information in an Inaccurate Simple Polygon. Int. J. Comput. Geom. Appl. 7(6): 515-538 (1997) - 1996
- [j14]Leizhen Cai:
Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties. Inf. Process. Lett. 58(4): 171-176 (1996) - [j13]Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski:
A generalization of line graphs: (X, Y)-intersection graphs. J. Graph Theory 21(3): 267-287 (1996) - [j12]Leizhen Cai, Derek G. Corneil:
A generalization of perfect graphs - i-perfect graphs. J. Graph Theory 23(1): 87-103 (1996) - [c3]Leizhen Cai:
Algorithms on Polygonal Embeddings of Graphs. CCCG 1996: 300-305 - 1995
- [j11]Leizhen Cai, Derek G. Corneil:
Isomorphic Tree Spanner Problems. Algorithmica 14(2): 138-153 (1995) - [j10]Leizhen Cai:
Path decompositions of multigraphs. J. Graph Theory 19(3): 297-307 (1995) - [j9]Leizhen Cai, Derek G. Corneil:
Tree Spanners. SIAM J. Discret. Math. 8(3): 359-387 (1995) - [c2]Leizhen Cai:
Spanning 2-Trees. ASIAN 1995: 10-22 - [c1]Leizhen Cai, Hazel Everett:
Visibility graphs of polygonal rings. CCCG 1995: 157-161 - 1994
- [j8]Leizhen Cai:
NP-Completeness of Minimum Spanner Problems. Discret. Appl. Math. 48(2): 187-194 (1994) - [j7]Leizhen Cai, J. Mark Keil:
Spanners in graphs of bounded degree. Networks 24(4): 233-249 (1994) - 1993
- [j6]Leizhen Cai, Frédéric Maffray:
On the SPANNING k-Tree Problem. Discret. Appl. Math. 44(1-3): 139-156 (1993) - [j5]Leizhen Cai:
The Recognition of Union Trees. Inf. Process. Lett. 45(6): 279-283 (1993) - [j4]Leizhen Cai, J. Mark Keil:
Degree-Bounded Spanners. Parallel Process. Lett. 3: 457-468 (1993) - 1992
- [b1]Leizhen Cai:
Tree spanners, spanning trees that approximate distances. University of Toronto, Canada, 1992 - [j3]Leizhen Cai, John A. Ellis:
Edge colouring line graphs of unicyclic graphs. Discret. Appl. Math. 36(1): 75-82 (1992) - [j2]Leizhen Cai, Derek G. Corneil:
On cycle double covers of line graphs. Discret. Math. 102(1): 103-106 (1992) - 1991
- [j1]Leizhen Cai, John A. Ellis:
NP-completeness of edge-colouring some restricted graphs. Discret. Appl. Math. 30(1): 15-27 (1991)
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-24 23:03 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:
