| 2009 |
|---|
| 10 | EE | Cristina G. Fernandes,
Orlando Lee,
Yoshiko Wakabayashi:
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width.
Discrete Applied Mathematics 157(2): 272-279 (2009) |
| 9 | EE | Ken-ichi Kawarabayashi,
Bruce A. Reed,
Orlando Lee:
Removable cycles in non-bipartite graphs.
J. Comb. Theory, Ser. B 99(1): 30-38 (2009) |
| 2008 |
|---|
| 8 | EE | Ken-ichi Kawarabayashi,
Orlando Lee,
Bruce A. Reed,
Paul Wollan:
A weaker version of Lovász' path removal conjecture.
J. Comb. Theory, Ser. B 98(5): 972-979 (2008) |
| 2006 |
|---|
| 7 | EE | Orlando Lee,
Aaron Williams:
Packing Dicycle Covers in Planar Graphs with No K5-e Minor.
LATIN 2006: 677-688 |
| 6 | EE | Sean Curran,
Orlando Lee,
Xingxing Yu:
Finding Four Independent Trees .
SIAM J. Comput. 35(5): 1023-1058 (2006) |
| 2005 |
|---|
| 5 | EE | Sean Curran,
Orlando Lee,
Xingxing Yu:
Nonseparating Planar Chains in 4-Connected Graphs.
SIAM J. Discrete Math. 19(2): 399-419 (2005) |
| 4 | EE | Sean Curran,
Orlando Lee,
Xingxing Yu:
Chain Decompositions of 4-Connected Graphs.
SIAM J. Discrete Math. 19(4): 848-880 (2005) |
| 2003 |
|---|
| 3 | EE | Sean Curran,
Orlando Lee,
Xingxing Yu:
Chain decompositions and independent trees in 4-connected graphs.
SODA 2003: 186-191 |
| 2002 |
|---|
| 2 | | Orlando Lee,
Yoshiko Wakabayashi:
On The Circuit Cover Problemfor Mixed Graphs
Combinatorics, Probability & Computing 11(1): (2002) |
| 1998 |
|---|
| 1 | EE | Orlando Lee,
Yoshiko Wakabayashi:
Circuit Covers in Series-Parallel Mixed Graphs.
LATIN 1998: 226-238 |
