Finding four independent trees S Curran, O Lee, X Yu SIAM Journal on Computing 35 (5), 1023-1058, 2006 | 108 | 2006 |

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 | 31 | 2008 |

The eternal dominating set problem for proper interval graphs A Braga, CC de Souza, O Lee Information Processing Letters 115 (6-8), 582-587, 2015 | 25 | 2015 |

Sorting signed permutations by short operations GR Galvão, O Lee, Z Dias Algorithms for Molecular Biology 10 (1), 1-17, 2015 | 23 | 2015 |

Note on a min‐max conjecture of Woodall O Lee, Y Wakabayashi Journal of Graph Theory 38 (1), 36-41, 2001 | 23 | 2001 |

Non-separating paths in 4-connected graphs K Kawarabayashi, O Lee, X Yu Annals of Combinatorics 9, 47-56, 2005 | 22 | 2005 |

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 | 20 | 2009 |

Flow-based formulation for the maximum leaf spanning tree problem MF Reis, O Lee, FL Usberti Electronic Notes in Discrete Mathematics 50, 205-210, 2015 | 10 | 2015 |

On generalizations of the parking permit problem and network leasing problems MS de Lima, MC San Felice, O Lee Electronic Notes in Discrete Mathematics 62, 225-230, 2017 | 9 | 2017 |

The online prize-collecting facility location problem MC San Felice, SS Cheung, O Lee, DP Williamson Electronic Notes in Discrete Mathematics 50, 151-156, 2015 | 8 | 2015 |

Chain decompositions of 4-connected graphs S Curran, O Lee, X Yu SIAM Journal on Discrete Mathematics 19 (4), 848-880, 2005 | 8 | 2005 |

A Randomized -Competitive Algorithm for the Online Connected Facility Location Problem MC San Felice, DP Williamson, O Lee Algorithmica 76 (4), 1139-1157, 2016 | 7 | 2016 |

The online connected facility location problem MC San Felice, DP Williamson, O Lee LATIN 2014: Theoretical Informatics: 11th Latin American Symposium …, 2014 | 7 | 2014 |

Nonseparating planar chains in 4-connected graphs S Curran, O Lee, X Yu SIAM Journal on Discrete Mathematics 19 (2), 399-419, 2005 | 7 | 2005 |

On Linial’s conjecture for spine digraphs M Sambinelli, CN da Silva, O Lee Discrete Mathematics 340 (5), 851-854, 2017 | 6 | 2017 |

Connected Facility Leasing Problems. MS de Lima, MC San Felice, O Lee ICTCS/CILC, 162-173, 2017 | 6 | 2017 |

Gallai's path decomposition conjecture for graphs with treewidth at most 3 F Botler, M Sambinelli, RS Coelho, O Lee Journal of Graph Theory 93 (3), 328-349, 2020 | 5 | 2020 |

Packing Dicycle Covers in Planar Graphs with No *K* _{5}–*e* MinorO Lee, A Williams LATIN 2006: Theoretical Informatics: 7th Latin American Symposium, Valdivia …, 2006 | 5 | 2006 |

α-Diperfect digraphs M Sambinelli, CN da Silva, O Lee Discrete Mathematics 345 (5), 112759, 2022 | 4 | 2022 |

Group parking permit problems MS de Lima, MC San Felice, O Lee Discrete Applied Mathematics 281, 172-194, 2020 | 4 | 2020 |