Submitted / Preprint

Jinha Kim, The homotopy type of the independence complex of ternary graphs, 2021.

Jinha Kim, Minki Kim, and Ojoung Kwon, A system of disjoint representatives of line segments with given k directions, 2021.

Dabeen Lee, Milan Vojnovic, and SeYoung Yun, Test score algorithms for budgeted stochastic utility maximization, 2020.

Fatma KılınçKarzan, Simge Küçükyavuz, and Dabeen Lee, Conic mixedbinary sets: convex hull characterizations and applications, 2020.

Nathan Bowler, Christian Elbrach, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen, Ubiquity in graphs II: Ubiquity of graphs with nowherelinear end structure, 2020.

Nathan Bowler, Christian Elbrach, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen, Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive treedecompositions, 2020.

Matija Bucić, Nemanja Draganić, Benny Sudakov, and Tuan Tran, Unavoidable hypergraphs, 2020.

Debsoumya Chakraborti and PoShen Loh, Rainbow matchings in edgecolored simple graphs, 2020.

Sangil Oum, Rank connectivity and pivotminors of graphs, 2020.

Debsoumya Chakraborti and Mihir Hasabnis, The threshold for the full perfect matching color profile in a random coloring of random graphs, 2020.

Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, and Daniel Vaz, Vertex sparsification for edge connectivity, 2020.

Archontia C. Giannopoulou, Kenichi Kawarabayashi, Stephan Kreutzer, and Ojoung Kwon, The canonical directed tree decomposition and its applications to the directed disjoint paths problem, 2020.

J. Pascal Gollin and Karl Heuer, Characterising kconnected sets in infinite graphs, 2020.

Debsoumya Chakraborti, Da Qi Chen, and Mihir Hasabnis, Minimizing the number of edges in $K_{s,t}$saturated bipartite graphs, 2020.

Jungho Ahn, Eun Jung Kim, and Euiwoong Lee, Towards constantfactor approximation for chordal / distancehereditary vertex deletion, 2020.

Beka Ergemlidze, Ervin Győri, Abhishek Methuku, Nike Salia, and Casey Tompkins, On 3uniform hypergraphs avoiding a cycle of length four, 2020.

Tuan Tran, Two problems in graph Ramsey theory, 2020.

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, Ojoung Kwon, Sangil Oum, and Daniël Paulusma, Tree pivotminors and linear rankwidth, 2020.

Tuan Tran, The smallest singular value of random combinatorial matrices, 2020.

Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, and Ojoung Kwon, Close relatives of Feedback Vertex Set without singleexponential algorithms parameterized by treewidth, 2020.

Duksang Lee and Sangil Oum, Characterizing matroids whose bases form graphic deltamatroids, 2020.

Kenichi Kawarabayashi, Stephan Kreutzer, Ojoung Kwon, and Qiqin Xie, Halfintegral ErdősPósa property of directed odd cycles, 2020.

Ervin Győri, Nika Salia, Casey Tompkins, and Oscar Zamora, Inverse Turán numbers, 2020.

Sanjeeb Dash, Oktay Günlük, and Dabeen Lee, On a generalization of the ChvátalGomory closure, 2020

Nam HoNguyen, Fatma KılınçKarzan, Simge Küçükyavuz, and Dabeen Lee, Strong formulations for distributionally robust chanceconstrained programs with lefthand side uncertainty under Wasserstein ambiguity, 2020.

Dong Yeap Kang, Mihyun Kang, Jaehoon Kim, and Sangil Oum, Fragile minormonotone parameters under random edge perturbation, 2020.

Gábor Damásdi, Balázs Keszegh, David Malec, Casey Tompkins, Zhiyu Wang, and Oscar Zamora, Saturation problems in the Ramsey theory of graphs, posets and point sets, 2020.

J. Pascal Gollin, Kevin Hendrey, Dillon Mayhew, and Sangil Oum, Obstructions for bounded branchdepth in matroids, 2020.

Jaehoon Kim and Sangil Oum, The ErdősHajnal property for graphs with no fixed cycle as a pivotminor, 2020.

Joshua Erde, J. Pascal Gollin, and Attila Joó, Enlarging vertexflames in countable digraphs, 2020.

Maria Axenovich, David Offner, and Casey Tompkins, Long path and cycle decompositions of even hypercubes, 2019.

Jungho Ahn, Lars Jaffke, Ojoung Kwon, and Paloma T. Lima, Wellpartitioned chordal graphs: obstruction set and disjoint paths, 2020.

Yangyan Gu, H. A. Kierstead, Sangil Oum, Hao Qi, and Xuding Zhu, 3degenerate induced subgraph of a planar graph, 2020.

Ervin Győri, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora, Generalized planar Turán numbers, 2020.

Jinha Kim, Minki Kim, and Ojoung Kwon, Rainbow independent sets on dense graph classes, 2020.

Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, and Máté Vizer, Turán problems for edgeordered graphs, 2020.

Nika Salia, Christoph Spigel, Casey Tompkins, and Oscar Zamora, Independent chains in acyclic posets, 2019.

Dániel Gerbner, Tamás Mészáros, Abhishek Methuku, and Cory Palmer, Generalized rainbow Turán problems, 2019.

Jungho Ahn, Eduard Eiben, Ojoung Kwon, and Sangil Oum, A polynomial kernel for 3leaf power deletion, 2019.

J. Pascal Gollin and Karl Heuer, On the Infinite LucchesiYounger Conjecture I, 2019.

Fatma KılınçKarzan, Simge Küçükyavuz, and Dabeen Lee, Joint chanceconstrained programs and the intersection of mixing sets through a submodularity lens, 2019

Ervin Győri, Addis Paulos, Nike Salia, Casey Tompkins, and Oscar Zamora, The maximum number of pentagons in a planar graph, 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, 2019.

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

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

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

Ringi Kim, Sangil Oum, and Xin Zhang,
Equitable partition of planar graphs, 2019.
Published
Accepted

Ojoung Kwon and JeanFlorent Raymond, Packing and covering induced subdivisions, SIAM J. Discrete Math., accepted, 2021.

Ojoung Kwon, Rose McCarty, Sangil Oum, and Paul Wollan, Obstructions for bounded shrubdepth and rankdepth, J. Combin. Theory Ser. B, accepted, 2021.

Matija Bucic, Pat Devlin, Mo Hendon, Dru Horne, and Ben Lund, Perfect matchings and derangements on graphs, J. Graph Theory, accepted, 2021.

Nam HoNguyen, Fatma KılınçKarzan, Simge Küçükyavuz, and Dabeen Lee, Distributionally robust chanceconstrained programs with righthand side uncertainty under Wasserstein ambiguity, Math. Program., accepted, 2020.

Maria Axenovich, Casey Tompkins, and Lea Weber, Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs, J. Graph Theory, accepted, 2020.

Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, and Dabeen Lee, Idealness of kwise intersecting families, Math. Program., accepted, 2020.

Ringi Kim, Sergey Norin, and Sangil Oum,
Obstructions for partitioning into forests and outerplanar graphs, Discrete Appl. Math., 2020.

Jim Geelen, Ojoung Kwon, Rose McCarty, and Paul Wollan,
The grid theorem for vertexminors, J. Combin. Theory Ser. B, accepted, 2020.

Sanjeeb Dash, Oktay Günlük, and Dabeen Lee,
Generalized ChvátalGomory closures for integer programs with bounds on variables, Math. Program., accepted, 2020.

J. Pascal Gollin and Jakob Kneip, Representations of infinite tree sets, Order, accepted, 2020.

Ahmad Abdi, Gérard Cornuéjols, and Dabeen Lee,
Resistant sets in the unit hypercube, Math. Oper. Res., accepted, 2019.

Joshua Erde, J. Pascal Gollin, Atilla Joó, Paul Knappe, and Max Pitz,
Base partition for mixed families of finitary and cofinitary matroids, Combinatorica, accepted, 2020.
2021

Dong Yeap Kang, Jaehoon Kim, and Hong Liu, On the rational Turán exponents conjecture, J. Combin. Theory Ser. B, 148:149172, 2021.

Joshua Erde, J. Pascal Gollin, Atilla Joó, Paul Knappe, and Max Pitz, A CantorBernsteintype theorem for spanning trees in infinite graphs, J. Combin. Theory Ser. B, 149:1622, July 2021.

Jinha Kim and Minki Kim, Domination numbers and noncover complexes of hypergraphs, J. Combin. Theory Ser. A, 180(Article 105408), May 2021.

Ojoung Kwon and Sangil Oum,
Graphs of bounded depth2 rankbrittleness, J. Graph Theory, 96:361378, March 2021.

Archontia Giannopoulou, Ojoung Kwon, JeanFlorent Raymond, and Dimitrios M. Thilikos, A Mengerlike property of treecut width, J. Combin. Theory Ser. B, 148:122, May 2021.

Reinhard Diestel and Sangil Oum, Tangletree duality in abstract separation systems, Adv. Math., 377(Article 107470), January 2021.

J. Pascal Gollin and Karl Heuer, An analogue of Edmonds’ Branching Theorem for infinite digraphs, European J. Combin., 92(Article 103182), February 2021.
2020

Matt DeVos, Ojoung Kwon, and Sangil Oum,
Branchdepth: Generalizing treedepth of graphs, European J. Combin., 90(Article 103186), December 2020.

HuyTung Nguyen and Sangil Oum,
The average cutrank of graphs, European J. Combin., 90(Article 103183), December 2020.

Minjeong Kang, Ojoung Kwon, and Myounghwan Lee,
Graphs without two vertexdisjoint Scycles, Discrete Math., 343(10):111997, October 2020.

Dániel Gerbner, Ervin Győri, Abhishek Methuku, and Máté Vize, Generalized Turán problems for even cycles, J. Combin. Theory Ser. B, 145:169213, November 2020.

Jürgen Kritschgau, Abhishek Methuku, Michael Tait, and Craig Timmons, Few H copies in Fsaturated graphs, J. Graph Theory, 94:320348, July 2020.

Dániel Grósz, Abhishek Methuku, and Casey Tompkins, On subgraphs of C_{2k}free graphs and a problem of Kühn and Osthus, Combin. Probab. Comput., 29(3):436454, May 2020.

Eun Jung Kim and Ojoung Kwon, ErdősPósa property of chordless cycles and its applications, J. Combin. Theory Ser. B., 145:65112, November 2020.

Beka Ergemlidze, Ervin Győri, and Abhishek Methuku, 3Uniform hypergraphs without a cycle of length five, Electron. J. Combin. 27(2), #P2.16, May 2020.*

Dániel Grósz, Abhishek Methuku, and Casey Tompkins, Uniformity thresholds for the asymptotic size of extremal BergeFfree hypergraphs, European J. Combin., 88(Article 103109), August 2020.

Dániel Gerbner, Abhishek Methuku, Gholamreza Omidi, and Máté Vizer, Ramsey problems for Berge hypergraphs, SIAM J. Discrete Math., 34(1):351369, 2020.

Dániel Gerbner, Abhishek Methuku, and Cory Palmer, General lemmas for BergeTurán hypergraph problems, European J. Combin., 86(Article 103082), May 2020.

Ojoung Kwon and Sangil Oum,
Scattered classes of graphs, SIAM J. Discrete Math., 34(1):972999, 2020.

Benjamin Bergougnoux, Mamadou Kanté, and Ojoung Kwon, An optimal XP algorithm for Hamiltonian cycle on graphs of bounded cliquewidth, Algorithimca, 82(6):16541674, June 2020.

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

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, Discrete Math., 343(7)(Article 111886), July 2020.

Jimeng Xiao and Casey Tompkins,
On forbidden poset problems in the linear lattice, Electron. J. Combin., 27(1), #P1.18, January 2020.

Dong Yeap Kang and Jaehoon Kim,
On 1factors with prescribed lengths in tournaments,
J. Combin. Theory Ser. B, 141:3171, March 2020.

Ringi Kim, Ojoung Kwon, Sangil Oum, and Vaidy Sivaraman,
Classes of graphs with no long cycle as a vertexminor are polynomially 𝜒bounded,
J. Combin. Theory Ser. B, 140:372386, January 2020.
2019

Nika Salia, Casey Tompkins, Zhiyu Wang, and Oscar Zamora, Ramsey numbers of Bergehypergraphs and related structures, Electron. J. Combin., 26(4), #P4.40, December 2019.

Sean English, Dániel Gerbner, Abhishek Methuku, and Cory Palmer, On the weight of BergeFfree hypergraphs, Electron. J. Combin. 26(4), #P4.7, October 2019.

Lars Jaffke, Ojoung Kwon, Torstein Strømme, and Jan Arne Telle, MimWidth III: Graph powers and generalized distance domination problems, Theoret. Comput. Sci., 796:216236, December 2019.

Reinhard Diestel and Sangil Oum, Tangletree duality: in graphs, matroids and beyond, Combinatorica, 39(4):879910, August 2019.

Dong Yeap Kang and Sangil Oum, Improper colouring of graphs with no odd clique minor, Combin. Probab. Comput., 28(5):740754, September 2019.

Hojin Choi, Ilkyoo Choi, Jisu Jeong, and Sangil Oum, Online Ramsey theory for a triangle on Ffree graphs, J. Graph Theory, 92(2):152171, October 2019.
Refereed Conference Papers

Jungho Ahn, Lars Jaffke, Ojoung Kwon, and Paloma T. Lima, Three problems on wellpartitioned chordal graphs, In the Proceedings of the 12th International Conference on Algorithms and Complexity (CIAC2021, May 1012, 2021), accepted, 2020.

Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, and Daniel Vaz, Vertex sparsification for edge connectivity, In the Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms (SODA21, January 1013, 2021, Online), accepted, 2020. Society for Industrial and Applied Mathematics.

Benjamin Bergougnoux, Edouard Bonnet, Nick Brettell, and Ojoung Kwon, Close relatives of Feedback Vertex Set without singleexponential algorithms parameterized by treewidth, in the Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC2020, Hong Kong, December 1418, 2020), Article No. 3; pp. 3:13:17, 2020.

Jungho Ahn, Eun Jung Kim, and Euiwoong Lee, Towards constantfactor approximation for chordal / distancehereditary vertex deletion, In the Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC2020, December 1418, 2020, Hong Kong), Article No. 62; pp. 62:162:16, 2020.

Jungho Ahn, Eduard Eiben, Ojoung Kwon, and Sangil Oum, A polynomial kernel for 3leaf power deletion, In the Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS2020, August 2428, 2020, Prague, Czech Republic), Article No. 5; pp. 5:15:14, 2020.

Jungho Ahn, Lars Jaffke, Ojoung Kwon, and Paloma T. Lima, Wellpartitioned chordal graphs: obstruction set and disjoint paths, In the Proceedings of the 46th International Workshop on GraphTheoretic Concepts in Computer Science (WG2020, June 2426, 2020, Leeds, UK), Lecture Notes in Comput. Sci., vol. 12301, pp. 148160, 2020.

Sanjeeb Dash, Oktay Günlük, and Dabeen Lee, On a generalization of the ChvátalGomory closure, In the Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020, June 810, 2020, London, UK), Lecture Notes in Comput. Sci., Vol. 12125, pp. 117129, 2020.

Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, and Dabeen Lee, Idealness of kwise intersecting families, In the Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020, June 810, 2020, London, UK), Lecture Notes in Comput. Sci., vol. 12125, pp. 112, 2020.

Archontia Giannopoulou, Kenichi Kawarabayashi, Stephan Kreutzer, and Ojoung Kwon,
The Directed Flat Wall Theorem,
In the Proceedings of the Fourteenth Annual ACMSIAM Symposium on Discrete Algorithms (SODA20, January 58, 2020, Salt Lake City, Utah, USA), pages 239258, 2020. Society for Industrial and Applied Mathematics.