图论的结构、拓扑及算法问题

2015-2019：博士，Technische Universität Ilmenau

2013-2015：硕士，Rheinische Friedrich-Wilhelms-Universität Bonn

2009-2013：学士，香港中文大学

2025-至今：特聘研究员，同济大学

2022-2024：博士后，横浜国立大学

2021-2022：博士后，Université de Montréal

2020-2021：博士后，厦门大学

2019-2020：博士后，中国科学技术大学

1. O.-H. S. Lo and C. T. Zamfirescu, Counting cycles in planar triangulations, Journal of Combinatorial Theory, Series B, 170:335–351, 2025.

2. J. Goedgebeur, J. Jooken, O.-H. S. Lo, B. Seamone, and C. T. Zamfirescu, Few Hamiltonian cycles in graphs with one or two vertex degrees, Mathematics of Computation, 93:3059–3082, 2024.

3. O.-H. S. Lo and J. M. Schmidt, Generalized cut trees for edge-connectivity, Journal of Combinatorial Theory, Series B, 165:47–67, 2024.

4. O.-H. S. Lo, J. M. Schmidt, N. Van Cleemput, and C. T. Zamfirescu, Shortness parameters of polyhedral graphs with few distinct vertex degrees, Discrete Mathematics, 348(8):114518, 2025.

5. O.-H. S. Lo, Cycles in 3-connected claw-free planar graphs and 4-connected planar graphs without 4-cycles, Journal of Graph Theory, 107(4):702–728, 2024.

6. O.-H. S. Lo, B. Seamone, and X. Zhu, Defective acyclic colorings of planar graphs, Journal of Graph Theory, 107(4):729–741, 2024.

7. O.-H. S. Lo, Distribution of subtree sums, European Journal of Combinatorics, 108:103615, 2023.

8. O.-H. S. Lo and C. T. Zamfirescu, Tight cycle spectrum gaps of cubic 3-connected toroidal graphs, Discrete Mathematics, 346(1):113170, 2023.

9. O.-H. S. Lo and J. Qian, Hamiltonian cycles in 4-connected planar and projective planar triangulations with few 4-separators, SIAM Journal on Discrete Mathematics, 36(2):1496–1501, 2022.

10. O.-H. S. Lo, On the Hamiltonian property hierarchy of 3-connected planar graphs, Electronic Journal of Combinatorics, 29(4):P4.18, 2022.

11. Q. Cui and O.-H. S. Lo, Tight gaps in the cycle spectrum of 3-connected planar graphs, SIAM Journal on Discrete Mathematics, 35(3):2039–2048, 2021.

12. O.-H. S. Lo, Find subtrees of specified weight and cycles of specified length in linear time, Journal of Graph Theory, 98(3):531–552, 2021.

13. O.-H. S. Lo and J. M. Schmidt, Cycle spectra of contraction-critically 4-connected planar graphs, Graphs and Combinatorics, 37:2129–2137, 2021.

14. O.-H. S. Lo, J. M. Schmidt, and M. Thorup, Compact cactus representations of all non-trivial min-cuts, Discrete Applied Mathematics, 303:296–304, 2021.

15. O.-H. S. Lo, Hamiltonian cycles in 4-connected plane triangulations with few 4-separators, Discrete Mathematics, 343(12):112126, 2020.

16. O.-H. S. Lo, J. M. Schmidt, N. Van Cleemput, and C. T. Zamfirescu, Shortness coefficient of cyclically 4-edge-connected cubic planar graphs, Electronic Journal of Combinatorics, 27(1):P1.43, 2020.

17. O.-H. S. Lo and J. M. Schmidt, Longest cycles in cyclically 4-edge-connected cubic planar graphs, Australasian Journal of Combinatorics, 72(1):155–162, 2018.

18. O.-H. S. Lo and J. M. Schmidt, A cut tree representation for pendant pairs, Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC'18), 2018, pp. 38:1–38:9.