Conferences

• O. Lee and A. Williams. Packing dicycle covers in planar graphs with no $K_5-e$ minor. Proceedings of the 7th Latin American Theoretical Informatics Symposium (LATIN'06), Valdivia, Chile. Lecture Notes in Comp. Science 3887 (2006), 677-688.
• S. Curran, O. Lee and X. Yu, Chain decompositions and independent spanning trees in 4-connected graphs, Proceedings of the Fourteenth ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003.
• O. Lee and Y. Wakabayashi, Circuit covers in series-parallel mixed graphs, Proceedings of the Third Latin American Symposium on Theoretical Informatics (LATIN) - Lecture Notes in Computer Science, 1380, 226-238 (1998).
• O. Lee and Y. Wakabayashi, Caminhos mínimos em grafos mistos, Anais do XVIII Congresso de Matemática Aplicada e Computacional (CNMAC), 329-333, 1995.

Journals

• K. Kawarabayashi, B. Reed and O. Lee, Removable cycles in nonbipartite graphs. J. Comb. Theory Ser. B 99 (2009), 30-38.
• C.G. Fernandes, O. Lee and Y. Wakabayashi, The minimum cycle cover and the Chinese postman problems on mixed graphs with bounded tree-width. Discrete Appl. Math. 157 (2009) 272-279.
• K. Kawarabayashi, O. Lee, B. Reed and P. Wollan, A weaker version of Lovász' path removal conjecture . J. Comb. Theory Ser. B 98 (2008), 972-979.
• S. Curran, O. Lee and X. Yu, Finding four independent trees. SIAM J. Comp. 35 (2006), 1023-1058.
• S. Curran, O. Lee and X. Yu, Chain decompositions of 4-connected graphs. SIAM J. Discr. Math. 19 (2005), 848--880 (electronic)..
• S. Curran, O. Lee and X. Yu, Non-separating planar chains in 4-connected graphs. SIAM J. Discr. Math. 19 (2005), 399-419 (electronic).
• K. Kawarabayashi, O. Lee and X. Yu. Non-separating paths in 4-connected graphs, Annals of Combinatorics 9 (2005), 47-56.
• O. Lee and Y. Wakabayashi, Note on a conjecture of Woodall, J. Graph Theory 38 (2001), 36-41.
• O. Lee and Y. Wakabayashi, Circuit covers in mixed graphs, Combinatorics, Probability and Computing 11 (2001), 43-59.