Orlando Lee
Orlando Lee
Professor of Computer Science, University of Campinas, Brazil
Verified email at ic.unicamp.br
Title
Cited by
Cited by
Year
Finding four independent trees
S Curran, O Lee, X Yu
SIAM Journal on Computing 35 (5), 1023-1058, 2006
1002006
A weaker version of Lovász'path removal conjecture
K Kawarabayashi, O Lee, B Reed, P Wollan
Journal of Combinatorial Theory, Series B 98 (5), 972-979, 2008
282008
Non-separating paths in 4-connected graphs
K Kawarabayashi, O Lee, X Yu
Annals of Combinatorics 9 (1), 47-56, 2005
242005
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
CG Fernandes, O Lee, Y Wakabayashi
Discrete Applied Mathematics 157 (2), 272-279, 2009
202009
Note on a min‐max conjecture of Woodall
O Lee, Y Wakabayashi
Journal of Graph Theory 38 (1), 36-41, 2001
172001
Chain decompositions of 4-connected graphs
S Curran, O Lee, X Yu
SIAM Journal on Discrete Mathematics 19 (4), 848-880, 2005
82005
Nonseparating planar chains in 4-connected graphs
S Curran, O Lee, X Yu
SIAM Journal on Discrete Mathematics 19 (2), 399-419, 2005
72005
Chain decompositions and independent trees in 4-connected graphs
S Curran, O Lee, X Yu
Symposium on Discrete Algorithms: Proceedings of the fourteenth annual ACM …, 2003
42003
On the circuit cover problem for mixed graphs
O Lee, Y Wakabayashi
Combinatorics, Probability & Computing 11 (1), 43, 2002
32002
Removable cycles in non-bipartite graphs
K Kawarabayashi, B Reed, O Lee
Journal of Combinatorial Theory, Series B 99 (1), 30-38, 2009
22009
Packing Dicycle Covers in Planar Graphs with No K 5e Minor
O Lee, A Williams
Latin American Symposium on Theoretical Informatics, 677-688, 2006
22006
Cobertura por circuitos em grafos mistos
O Lee
11999
Circuit covers in series-parallel mixed graphs
O Lee, Y Wakabayashi
Latin American Symposium on Theoretical Informatics, 226-238, 1998
11998
The system can't perform the operation now. Try again later.
Articles 1–13