Submitted / Preprint

  1. Joshua Erde, Pascal Gollin, Atilla Joó, Paul Knappe, and Max Pitz,
    Base partition for finitary-cofinatary matroid families, 2019. arXiv:1910.05601
  2. Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Casey Tompkins, and Chuanqi Xiao,
    Set systems related to a house allocation problem, 2019. arXiv:1910.04666
  3. Jimeng Xiao and Casey Tompkins,
    On forbidden poset problems in the linear lattice, 2019. arXiv:1905.09246
  4. Fatma Kılınç-Karzan, Simge Küçükyavuz, and Dabeen Lee,
    Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens, 2019 arXiv:1910.01353
  5. Ervin Győri, Addis Paulos, Nike Salia, Casey Tompkins, and Oscar Zamora,
    The maximum number of pentagons in a planar graph, 2019. arXiv:1909.13532
  6. Ervin Győri, Addis Paulos, Nike Salia, Casey Tompkins, and Oscar Zamora,
    The maximum number of paths of length three in a planar graph, 2019. arXiv:1909.13539
  7. Jim Geelen, O-joung Kwon, Rose McCarty, and Paul Wollan,
    The grid theorem for vertex-minors, 2019. arXiv:1909.08113
  8. Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee, and Matt Superdock,
    Projective geometries, simplices and clutters, 2019. arXiv:1908.10629
  9. Minjeong Kang, O-joung Kwon, and Myounghwan Lee,
    Graphs without two vertex-disjoint S-cycles, 2019. arXiv:1908.09065
  10. Abhishek Methuku and István Tomon,
    Bipartite Turán problems for ordered graphs, 2019. arXiv:1908.03189
  11. Martin Balko, Dániel Gerbner, Dong Yeap Kang, Younjin Kim, and Cory Palmer,
    Hypergraph based Berge hypergraphs, 2019. arXiv:1908.00092
  12. Ringi Kim, Sang-il Oum, and Xin Zhang,
    Vertex-disjoint large induced forests in graphs, 2019. arXiv:1907.09911
  13. Sanjeeb Dash, Oktay Günlük, and Dabeen Lee,
    Generalized Chvátal-Gomory closures for integer programs with bounds on variables, 2019.
  14. O-joung Kwon and Sang-il Oum,
    Graphs of bounded depth-2 rank-brittleness, 2019. arXiv:1906.05753
  15. Huy-Tung Nguyen and Sang-il Oum,
    The average cut-rank of graphs, 2019. arXiv:1906.02895
  16. Matt DeVosO-joung Kwon, and Sang-il Oum,
    Branch-depth: Generalizing tree-depth of graphs, 2019. arXiv:1903.11988
  17. O-joung Kwon and Sang-il Oum,
    Scattered classes of graphs, 2018. arXiv:1801.06004



  1. Kevin Hendrey and Ian M. Wanless,
    Covering radius in the Hamming permutation space,
    European J. Combin., 84:(Article 103025), February 2020. doi:10.1016/j.ejc.2019.103025 arXiv:1811.09040
  2. Lars Jaffke, O-joung Kwon, Torstein Strømme, and Jan Arne Telle,
    Mim-Width III: Graph powers and generalized distance domination problems,
    Theoret. Comput. Sci., 2019. doi:10.1016/j.tcs.2019.09.012
  3. Dong Yeap Kang and Jaehoon Kim
    On 1-factors with prescribed lengths in tournaments,
    J. Combin. Theory Ser. B, 2019. doi:10.1016/j.jctb.2019.06.003
  4. Ringi KimO-joung Kwon, Sang-il Oum, and Vaidy Sivaraman,
    Classes of graphs with no long cycle as a vertex-minor are polynomially 𝜒-bounded,
    J. Combin. Theory Ser. B, 2019. doi:10.1016/j.jctb.2019.06.001


  1. Reinhard Diestel and Sang-il Oum,
    Tangle-tree duality: in graphs, matroids and beyond,
    Combinatorica, 39(4):879-910, August 2019. doi:10.1007/s00493-019-3798-5
  2. Dong Yeap Kang and Sang-il Oum,
    Improper colouring of graphs with no odd clique minor
    Combin. Probab. Comput., 28(5):740-754, September 2019. doi:10.1017/S0963548318000548
  3. Hojin ChoiIlkyoo ChoiJisu Jeong, and Sang-il Oum,
    Online Ramsey theory for a triangle on F-free graphs,
    J. Graph Theory, 92(2):152-171, October 2019. doi:10.1002/jgt.22445

Refereed Conference Papers

  1. Archontia Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, and O-joung Kwon,
    The Directed Flat Wall Theorem,
    In the Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA20, January 5-8, 2020, Salt Lake City, Utah, USA), accepted.