| 2008 |
|---|
| 12 | EE | Chuan-Min Lee,
Maw-Shang Chang:
Variations of Y-dominating functions on graphs.
Discrete Mathematics 308(18): 4185-4204 (2008) |
| 2006 |
|---|
| 11 | EE | Sheng-Lung Peng,
Ton Kloks,
Chuan-Min Lee:
The Maximum Interval Graphs on Distance Hereditary Graphs.
JCIS 2006 |
| 10 | EE | Ton Kloks,
Dieter Kratsch,
Chuan-Min Lee,
Jiping Liu:
Improved bottleneck domination algorithms.
Discrete Applied Mathematics 154(11): 1578-1592 (2006) |
| 9 | EE | Chuan-Min Lee,
Maw-Shang Chang:
Distance-hereditary graphs are clique-perfect.
Discrete Applied Mathematics 154(3): 525-536 (2006) |
| 2005 |
|---|
| 8 | EE | Chuan-Min Lee,
Ling-Ju Hung,
Maw-Shang Chang,
Chia-Ben Shen,
Chuan Yi Tang:
An improved algorithm for the maximum agreement subtree problem.
Inf. Process. Lett. 94(5): 211-216 (2005) |
| 7 | EE | Gregory Gutin,
Ton Kloks,
Chuan-Min Lee,
Anders Yeo:
Kernels in planar digraphs.
J. Comput. Syst. Sci. 71(2): 174-184 (2005) |
| 2004 |
|---|
| 6 | EE | Chuan-Min Lee,
Ling-Ju Hung,
Maw-Shang Chang,
Chuan Yi Tang:
An Improved Algorithm for the Maximum Agreement Subtree Problem.
BIBE 2004: 533-536 |
| 5 | EE | Maw-Shang Chang,
Chin-Hua Lin,
Chuan-Min Lee:
New upper bounds on feedback vertex numbers in butterflies.
Inf. Process. Lett. 90(6): 279-285 (2004) |
| 4 | EE | Ton Kloks,
Chuan-Min Lee,
Jiping Liu:
Stickiness, Edge-Thickness, and Clique-Thickness in Graphs.
J. Inf. Sci. Eng. 20(2): 207-217 (2004) |
| 2003 |
|---|
| 3 | EE | Ton Kloks,
Chuan-Min Lee,
Jiping Liu,
Haiko Müller:
On the Recognition of General Partition Graphs.
WG 2003: 273-283 |
| 2002 |
|---|
| 2 | EE | Ton Kloks,
Chuan-Min Lee,
Jiping Liu:
New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs.
WG 2002: 282-295 |
| 2001 |
|---|
| 1 | EE | Maw-Shang Chang,
Ton Kloks,
Chuan-Min Lee:
Maximum Clique Transversals.
WG 2001: 32-43 |
