Submitted / Preprint

  1. Nika Salia, Christoph SpigelCasey Tompkins, and Oscar Zamora, Independent chains in acyclic posets, 2019. arXiv:1912.03288
  2. Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, and Dabeen Lee, Idealness of k-wise intersecting families, 2019. arXiv:1912.00614
  3. Dániel Gerbner, Tamás MészárosAbhishek Methuku, and Cory Palmer, Generalized rainbow Turán problems, 2019. arXiv:1911.06642
  4. Jungho Ahn, Eduard Eiben, O-joung Kwon, and Sang-il Oum, A polynomial kernel for 3-leaf power deletion, 2019. arXiv:1911.04249
  5. O-joung Kwon, Rose McCarty, Sang-il Oum, and Paul Wollan, Obstructions for bounded shrub-depth and rank-depth, 2019. arXiv:1911.00230
  6. Ringi Kim, Sergey Norin, and Sang-il OumObstructions for partitioning into forests and outerplanar graphs, 2019. arXiv:1903.08425
  7. Joshua Erde, Pascal Gollin, Atilla Joó, Paul Knappe, and Max Pitz, Base partition for finitary-cofinatary matroid families, 2019. arXiv:1910.05601
  8. 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
  9. Jimeng Xiao and Casey Tompkins, On forbidden poset problems in the linear lattice, 2019. arXiv:1905.09246
  10. 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
  11. 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
  12. 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
  13. Jim Geelen, O-joung Kwon, Rose McCarty, and Paul Wollan, The grid theorem for vertex-minors, 2019. arXiv:1909.08113
  14. Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee, and Matt Superdock, Projective geometries, simplices and clutters, 2019. arXiv:1908.10629
  15. Minjeong Kang, O-joung Kwon, and Myounghwan Lee, Graphs without two vertex-disjoint S-cycles, 2019. arXiv:1908.09065
  16. Abhishek Methuku and István Tomon, Bipartite Turán problems for ordered graphs, 2019. arXiv:1908.03189
  17. Martin Balko, Dániel Gerbner, Dong Yeap Kang, Younjin Kim, and Cory Palmer, Hypergraph based Berge hypergraphs, 2019. arXiv:1908.00092
  18. Ringi Kim, Sang-il Oum, and Xin Zhang, Vertex-disjoint large induced forests in graphs, 2019. arXiv:1907.09911
  19. Sanjeeb Dash, Oktay Günlük, and Dabeen Lee, Generalized Chvátal-Gomory closures for integer programs with bounds on variables, 2019.
  20. O-joung Kwon and Sang-il Oum, Graphs of bounded depth-2 rank-brittleness, 2019. arXiv:1906.05753
  21. Huy-Tung Nguyen and Sang-il Oum, The average cut-rank of graphs, 2019. arXiv:1906.02895
  22. Matt DeVosO-joung Kwon, and Sang-il Oum, Branch-depth: Generalizing tree-depth of graphs, 2019. arXiv:1903.11988
  23. O-joung Kwon and Sang-il Oum, Scattered classes of graphs, 2018. arXiv:1801.06004



  1. Benjamin Bergougnoux, Mamadou Kanté, and O-joung Kwon, An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width, Algorithimca, accepted, 2019. arXiv:1702.06095
  2. Dániel Gerbner, Ervin GyőriAbhishek Methuku, and Máté Vize,  Generalized Turán problems for even cycles, accepted to J. Combin.  Theory Ser. B, 2019. arXiv:1712.07079
  3. Jürgen KritschgauAbhishek Methuku, Michael Tait, and Craig TimmonsFew T copies in H-saturated graphs, accepted to J. Graph Theory, 2019. doi:10.1002/jgt.22525 arXiv:1810.00939
  4. Ahmad Abdi, Gérard Cornuéjols, and Dabeen Lee, Resistant sets in the unit hypercube, Math. Oper. Res., accepted, 2019.
  5. Dong Yeap Kang and Jaehoon KimOn 1-factors with prescribed lengths in tournaments, J. Combin. Theory Ser. B, 2019. doi:10.1016/j.jctb.2019.06.003


  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. 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, 140:372-386, January 2020. doi:10.1016/j.jctb.2019.06.001


  1. Nika Salia, Casey Tompkins, Zhiyu Wang, and Oscar Zamora, Ramsey numbers of Berge-hypergraphs and related structures, Elctron. J. Combin., 26(4), #P4.40, December 2019. arXiv:1808.09863
  2. Sean English, Dániel Gerbner, Abhishek Methuku, and Cory Palmer, On the weight of Berge-F-free hypergraphs, Electron. J. Combin. 26(4), #P4.7, October 2019.
  3. 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., 796:216-236, December 2019. doi:10.1016/j.tcs.2019.09.012
  4. 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
  5. 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
  6. 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.