Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Leizhen Cai
2010 – today
- 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. Journal of 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. Discrete Math. 24(4): 1322-1335 (2010)
- [c5]
2000 – 2009
- 2009
- [j25]Leizhen Cai, Weifan Wang: The Surviving Rate of a Graph for the Firefighter Problem. SIAM J. Discrete 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. Discrete Applied Mathematics 156(12): 2241-2249 (2008)
- [c4]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
- [c3]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. Discrete Applied Mathematics 127(3): 415-429 (2003)
- [j21]Leizhen Cai: The complexity of the locally connected spanning tree problem. Discrete Applied Mathematics 131(1): 63-75 (2003)
- 2001
- [j20]Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski: Stable 2-pairs and (X, Y)-intersection graphs. Discrete Mathematics 230(1-3): 119-131 (2001)
- [j19]Leizhen Cai, Xuding Zhu: Game chromatic index of k-degenerate graphs. Journal of 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. Discrete Applied Mathematics 73(1): 27-34 (1997)
- [j16]
- [j15]Leizhen Cai, J. Mark Keil: Computing Visibility Information in an Inaccurate Simple Polygon. Int. J. Comput. Geometry 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. Journal of Graph Theory 21(3): 267-287 (1996)
- [j12]Leizhen Cai, Derek G. Corneil: A generalization of perfect graphs - i-perfect graphs. Journal of Graph Theory 23(1): 87-103 (1996)
- [c2]
- 1995
- [j11]
- [j10]
- [j9]
- [c1]
- 1994
- [j8]Leizhen Cai: NP-Completeness of Minimum Spanner Problems. Discrete Applied Mathematics 48(2): 187-194 (1994)
- [j7]
- 1993
- [j6]Leizhen Cai, Frédéric Maffray: On the SPANNING k-Tree Problem. Discrete Applied Mathematics 44(1-3): 139-156 (1993)
- [j5]
- [j4]
- 1992
- [j3]Leizhen Cai, John A. Ellis: Edge colouring line graphs of unicyclic graphs. Discrete Applied Mathematics 36(1): 75-82 (1992)
- [j2]Leizhen Cai, Derek G. Corneil: On cycle double covers of line graphs. Discrete Mathematics 102(1): 103-106 (1992)
- 1991
- [j1]Leizhen Cai, John A. Ellis: NP-completeness of edge-colouring some restricted graphs. Discrete Applied Mathematics 30(1): 15-27 (1991)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-06 20:47 CEST by the dblp team