 | 2008 |
|---|
| 24 |       | Leizhen Cai,
Elad Verbin,
Lin Yang:
Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential Algorithm.
ISAAC 2008: 258-269 |
| 23 | | 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) |
| 22 | | Leizhen Cai:
Parameterized Complexity of Cardinality Constrained Optimization Problems.
Comput. J. 51(1): 102-121 (2008) |
| 21 | | Weifan Wang,
Leizhen Cai:
Labelling planar graphs without 4-cycles with a condition on distance two.
Discrete Applied Mathematics 156(12): 2241-2249 (2008) |
| 2006 |
|---|
| 20 | | Leizhen Cai,
Siu Man Chan,
Siu On Chan:
Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems.
IWPEC 2006: 239-250 |
| 2003 |
|---|
| 19 | | Leizhen Cai:
Parameterized Complexity of Vertex Colouring.
Discrete Applied Mathematics 127(3): 415-429 (2003) |
| 18 | | Leizhen Cai:
The complexity of the locally connected spanning tree problem.
Discrete Applied Mathematics 131(1): 63-75 (2003) |
| 2001 |
|---|
| 17 | | Leizhen Cai,
Derek G. Corneil,
Andrzej Proskurowski:
Stable 2-pairs and (X, Y)-intersection graphs.
Discrete Mathematics 230(1-3): 119-131 (2001) |
| 1999 |
|---|
| 16 | | Leizhen Cai,
Yin-Feng Xu,
Binhai Zhu:
Computing the Optimal Bridge Between Two Convex Polygons.
Inf. Process. Lett. 69(3): 127-130 (1999) |
| 1997 |
|---|
| 15 | | 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) |
| 14 | | Leizhen Cai:
On Spanning 2-trees in a Graph.
Discrete Applied Mathematics 74(3): 203-216 (1997) |
| 13 |  | Leizhen Cai,
J. Mark Keil:
Computing Visibility Information in an Inaccurate Simple Polygon.
Int. J. Comput. Geometry Appl. 7(6): 515-538 (1997) |
| 1996 |
|---|
| 12 | | Leizhen Cai:
Algorithms on Polygonal Embeddings of Graphs.
CCCG 1996: 300-305 |
| 11 | | Leizhen Cai:
Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties.
Inf. Process. Lett. 58(4): 171-176 (1996) |
| 1995 |
|---|
| 10 | | Leizhen Cai:
Spanning 2-Trees.
ASIAN 1995: 10-22 |
| 9 | | Leizhen Cai,
Derek G. Corneil:
Isomorphic Tree Spanner Problems.
Algorithmica 14(2): 138-153 (1995) |
| 8 | | Leizhen Cai,
Derek G. Corneil:
Tree Spanners.
SIAM J. Discrete Math. 8(3): 359-387 (1995) |
| 1994 |
|---|
| 7 | | Leizhen Cai:
NP-Completeness of Minimum Spanner Problems.
Discrete Applied Mathematics 48(2): 187-194 (1994) |
| 1993 |
|---|
| 6 | | Leizhen Cai,
Frédéric Maffray:
On the SPANNING k-Tree Problem.
Discrete Applied Mathematics 44(1-3): 139-156 (1993) |
| 5 | | Leizhen Cai:
The Recognition of Union Trees.
Inf. Process. Lett. 45(6): 279-283 (1993) |
| 4 | | Leizhen Cai,
J. Mark Keil:
Degree-Bounded Spanners.
Parallel Processing Letters 3: 457-468 (1993) |
| 1992 |
|---|
| 3 | | Leizhen Cai,
John A. Ellis:
Edge colouring line graphs of unicyclic graphs.
Discrete Applied Mathematics 36(1): 75-82 (1992) |
| 2 | | Leizhen Cai,
Derek G. Corneil:
On cycle double covers of line graphs.
Discrete Mathematics 102(1): 103-106 (1992) |
| 1991 |
|---|
| 1 | | Leizhen Cai,
John A. Ellis:
NP-completeness of edge-colouring some restricted graphs.
Discrete Applied Mathematics 30(1): 15-27 (1991) |
