Submitted / Preprint

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, arXiv:1910.04666, 2019.

Jimeng Xiao and Casey Tompkins,
On forbidden poset problems in the linear lattice, arXiv:1905.09246, 2019.

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, arXiv:1910.01353, 2019.

Ervin Győri, Addis Paulos, Nike Salia, Casey Tompkins, and Oscar Zamora,
The maximum number of paths of length three in a planar graph, arXiv:1909.13539, 2019.

Ervin Győri, Addis Paulos, Nike Salia, Casey Tompkins, and Oscar Zamora,
The maximum number of pentagons in a planar graph, arXiv:1909.13532, 2019.

Jim Geelen, O-joung Kwon, Rose McCarty, and Paul Wollan,
The grid theorem for vertex-minors, arXiv:1909.08113, 2019.

Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee, and Matt Superdock,
Projective geometries, simplices and clutters, arXiv:1908.10629, 2019.

Minjeong Kang, O-joung Kwon, and Myounghwan Lee,
Graphs without two vertex-disjoint S-cycles, arXiv:1908.09065, 2019.

Abhishek Methuku and István Tomon,
Bipartite Turán problems for ordered graphs, arXiv:1908.03189, 2019.

Martin Balko, Dániel Gerbner, Dong Yeap Kang, Younjin Kim, and Cory Palmer,
Hypergraph based Berge hypergraphs, arXiv:1908.00092, 2019.

Ringi Kim, Sang-il Oum, and Xin Zhang,
Vertex-disjoint large induced forests in graphs, arXiv:1907.09911, 2019.

Sanjeeb Dash, Oktay Günlük, and Dabeen Lee,
Generalized Chvátal-Gomory closures for integer programs with bounds on variables, 2019.

O-joung Kwon and Sang-il Oum,
Graphs of bounded depth-2 rank-brittlenessarXiv:1906.05753, 2019.

Huy-Tung Nguyen and Sang-il Oum,
The average cut-rank of graphsarXiv:1906.02895, 2019.

Matt DeVosO-joung Kwon, and Sang-il Oum,
Branch-depth: Generalizing tree-depth of graphsarXiv:1903.11988, 2019.

O-joung Kwon and Sang-il Oum,
Scattered classes of graphs, arXiv:1801.06004, 2018.



Kevin Hendrey and Ian M. Wanless,
Covering radius in the Hamming permutation space,
European J. Combin., 84:(Article 103025), February 2020. arXiv:1811.09040

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.

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.

Dong Yeap Kang and Jaehoon Kim
On 1-factors with prescribed lengths in tournaments,
J. Combin. Theory Ser. B, 2019.


Reinhard Diestel and Sang-il Oum,
Tangle-tree duality: in graphs, matroids and beyond,
Combinatorica, 39(4):879-910, August 2019.

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.

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.

Refereed Conference Papers

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.