Submitted / Preprint
-
Kevin Hendrey, Sergey Norin, and David Wood, Extremal functions for sparse minors, 2021.
-
Debsoumya Chakraborti, Bipartite independence number and balanced coloring, 2021.
-
Jeong-Ok Choi and Youngmi Hur, Invertibility of circulant matrices of arbitrary size, 2021.
-
Debsoumya Chakraborti and Da Qi Chen, Exact results on generalized Erdős-Gallai problems, 2021.
-
Duksang Lee and Sang-il Oum, Intertwining connectivities for vertex-minors and pivot-minors, 2021.
-
Dabeen Lee and Milan Vojnovic, Learning to schedule, 2021.
-
Debsoumya Chakraborti, Jeong Han Kim, Joonkyung Lee, and Tuan Tran, Majority dynamics on sparse random graphs, 2021.
-
Tony Huynh and O-joung Kwon, On the Erdős-Pósa property for long holes in $C_4$-free graphs, 2021.
-
Lars Jaffke, O-joung Kwon, and Jan Arne Telle, Classes of intersection digraphs with good algorithmic properties, 2021.
-
Donggyu Kim, Duksang Lee, and Sang-il Oum, Γ-graphic delta-matroids and its applications, 2021.
-
Dániel Grósz, Abhishek Methuku, and Casey Tompkins, Ramsey numbers of Boolean lattices, 2021.
-
Debsoumya Chakraborti, Alan Frieze, and Mihir Hasabnis, Colorful Hamilton cycles in random graphs, 2021.
-
J. Pascal Gollin, Kevin Hendrey, Ken-ichi Kawarabayashi, O-joung Kwon, and Sang-il Oum, A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups, 2021.
-
Jinha Kim, The homotopy type of the independence complex of graphs with no induced cycle of length divisible by 3, 2021.
-
Jinha Kim, Minki Kim, and O-joung Kwon, A system of disjoint representatives of line segments with given k directions, 2021.
-
Dabeen Lee, Milan Vojnovic, and Se-Young Yun, Test score algorithms for budgeted stochastic utility maximization, 2020.
-
Fatma Kılınç-Karzan, Simge Küçükyavuz, and Dabeen Lee, Conic mixed-binary 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 nowhere-linear 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 tree-decompositions, 2020.
-
Debsoumya Chakraborti and Po-Shen Loh, Rainbow matchings in edge-colored simple graphs, 2020.
-
Sang-il Oum, Rank connectivity and pivot-minors of 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, Ken-ichi Kawarabayashi, Stephan Kreutzer, and O-joung Kwon, The canonical directed tree decomposition and its applications to the directed disjoint paths problem, 2020.
-
J. Pascal Gollin and Karl Heuer, Characterising k-connected sets in infinite graphs, 2020.
-
Jungho Ahn, Eun Jung Kim, and Euiwoong Lee, Towards constant-factor approximation for chordal / distance-hereditary vertex deletion, 2020.
-
Beka Ergemlidze, Ervin Győri, Abhishek Methuku, Nike Salia, and Casey Tompkins, On 3-uniform 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é, O-joung Kwon, Sang-il Oum, and Daniël Paulusma, Tree pivot-minors and linear rank-width, 2020.
-
Tuan Tran, The smallest singular value of random combinatorial matrices, 2020.
-
Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, and O-joung Kwon, Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth, 2020.
-
Duksang Lee and Sang-il Oum, Characterizing matroids whose bases form graphic delta-matroids, 2020.
-
Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, and Qiqin Xie, Half-integral Erdős-Pósa property of directed odd cycles, 2020.
-
Ervin Győri, Nika Salia, Casey Tompkins, and Oscar Zamora, Inverse Turán numbers, 2020.
-
Nam Ho-Nguyen, Fatma Kılınç-Karzan, Simge Küçükyavuz, and Dabeen Lee, Strong formulations for distributionally robust chance-constrained programs with left-hand side uncertainty under Wasserstein ambiguity, 2020.
-
Dong Yeap Kang, Mihyun Kang, Jaehoon Kim, and Sang-il Oum, Fragile minor-monotone parameters under random edge perturbation, 2020.
-
Jungho Ahn, Lars Jaffke, O-joung Kwon, and Paloma T. Lima, Well-partitioned chordal graphs: obstruction set and disjoint paths, 2020.
-
Yangyan Gu, H. A. Kierstead, Sang-il Oum, Hao Qi, and Xuding Zhu, 3-degenerate induced subgraph of a planar graph, 2020.
-
Ervin Győri, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora, Generalized planar Turán numbers, 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 edge-ordered 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, O-joung Kwon, and Sang-il Oum, A polynomial kernel for 3-leaf power deletion, 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.
Published
Accepted
-
Sanjeeb Dash, Oktay Günlük, and Dabeen Lee, On a generalization of the Chvátal-Gomory closure, Math. Program., accepted, 2021.
-
Jisu Jeong, Eun Jung Kim, and Sang-il Oum, Finding branch-decompositions of matroids, hypergraphs, and more, SIAM J. Discrete Math., accepted, 2021.
-
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, Math. Program., accepted, 2021.
-
Jinha Kim, Minki Kim, and O-joung Kwon, Rainbow independent sets on dense graph classes, Discrete Appl. Math., accepted, 2021.
-
Minki Kim and Alan Lew, Complexes of graphs with bounded independence number, Israel J. Math., accepted, 2021.
-
Nam Ho-Nguyen, Fatma Kılınç-Karzan, Simge Küçükyavuz, and Dabeen Lee, Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity, Math. Program., accepted, 2020.
-
Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, and Dabeen Lee, Idealness of k-wise intersecting families, Math. Program., accepted, 2020.
-
Ringi Kim, Sergey Norin, and Sang-il Oum,
Obstructions for partitioning into forests and outerplanar graphs, Discrete Appl. Math., 2020.
-
Jim Geelen, O-joung Kwon, Rose McCarty, and Paul Wollan,
The grid theorem for vertex-minors, J. Combin. Theory Ser. B, accepted, 2020.
-
Sanjeeb Dash, Oktay Günlük, and Dabeen Lee,
Generalized Chvátal-Gomory closures for integer programs with bounds on variables, Math. Program., accepted, 2020.
2021
-
Matija Bucić, Nemanja Draganić, Benny Sudakov, and Tuan Tran, Unavoidable hypergraphs, J. Combin. Theory Ser. B, 151:307-338, November 2021.
-
Joshua Erde, J. Pascal Gollin, and Attila Joó, Enlarging vertex-flames in countable digraphs, J. Combin. Theory Ser. B, 151:263-281, November 2021.
-
J. Pascal Gollin and Karl Heuer, On the Infinite Lucchesi-Younger Conjecture I, J. Graph Theory, 98(1):27-48, September 2021.
-
Debsoumya Chakraborti, Da Qi Chen, and Mihir Hasabnis, Minimizing the number of edges in $K_{s,t}$-saturated bipartite graphs, SIAM J. Discrete Math., 35(2):1165-1181, June 2021.
-
Debsoumya Chakraborti and Da Qi Chen, Many cliques with few edges and bounded maximum degree, J. Combin. Theory Ser. B, 151:1-20, November 2021.
-
J. Pascal Gollin, Kevin Hendrey, Dillon Mayhew, and Sang-il Oum, Obstructions for bounded branch-depth in matroids, Adv. Comb., 2021:4, 25pp, May 2021.
-
Eduard Eiben, Robert Ganian, Thekla Hamm, and O-joung Kwon, Measuring what matters: A hybrid approach to dynamic programming with treewidth, J. Comput. System Sci., 121:57-75, November 2021.
-
Matija Bucic, Pat Devlin, Mo Hendon, Dru Horne, and Ben Lund, Perfect matchings and derangements on graphs, J. Graph Theory, 97(2):340-354, June 2021.
-
Maria Axenovich, Casey Tompkins, and Lea Weber, Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs, J. Graph Theory, 97(1):34-46, May 2021.
-
Jan Corsten and Tuan Tran, Balanced supersaturation for some degenerate hypergraphs, J. Graph Theory, 97(4):600-623, July 2021.
-
Jaehoon Kim and Sang-il Oum, The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor, Electron. J. Combin., 28(2), P2.9, April 2021.
-
Eun Jung Kim and O-joung Kwon, A polynomial kernel for distance-hereditary vertex deletion, Algorithmica, 83:2096-2141, July 2021.
-
Maria Axenovich, David Offner, and Casey Tompkins, Long path and cycle decompositions of even hypercubes, European J. Combin., 95:103320, June 2021.
-
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, European J. Combin., 95:103321, June 2021.
-
Ringi Kim, Sang-il Oum, and Xin Zhang,
Equitable partition of planar graphs, Discrete Math., 344(6):112351, June 2021.
-
Ron Aharoni, Joseph Briggs, Jinha Kim, and Minki Kim, Badges and rainbow matchings, Discrete Math., 344(6):112363, June 2021.
-
Ahmad Abdi, Gérard Cornuéjols, and Dabeen Lee,
Resistant sets in the unit hypercube, Math. Oper. Res., 46(1):82-114, February 2021.
-
O-joung Kwon, Rose McCarty, Sang-il Oum, and Paul Wollan, Obstructions for bounded shrub-depth and rank-depth, J. Combin. Theory Ser. B, 149:76-91, July 2021.
-
Dong Yeap Kang, Jaehoon Kim, and Hong Liu, On the rational Turán exponents conjecture, J. Combin. Theory Ser. B, 148:149-172, May 2021.
-
Joshua Erde, J. Pascal Gollin, Atilla Joó, Paul Knappe, and Max Pitz, A Cantor-Bernstein-type theorem for spanning trees in infinite graphs, J. Combin. Theory Ser. B, 149:16-22, July 2021.
-
O-joung Kwon and Jean-Florent Raymond, Packing and covering induced subdivisions, SIAM J. Discrete Math., 35(2):597-636, April 2021.
-
Jinha Kim and Minki Kim, Domination numbers and noncover complexes of hypergraphs, J. Combin. Theory Ser. A, 180(Article 105408), May 2021.
-
O-joung Kwon and Sang-il Oum,
Graphs of bounded depth-2 rank-brittleness, J. Graph Theory, 96:361-378, March 2021.
-
Debsoumya Chakraborti and Mihir Hasabnis, The threshold for the full perfect matching color profile in a random coloring of random graphs, Electron. J. Combin., 28(1), #P1.21, January 2021.
-
Archontia Giannopoulou, O-joung Kwon, Jean-Florent Raymond, and Dimitrios M. Thilikos, A Menger-like property of tree-cut width, J. Combin. Theory Ser. B, 148:1-22, May 2021.
-
Reinhard Diestel and Sang-il Oum, Tangle-tree 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.
-
J. Pascal Gollin and Jakob Kneip, Representations of infinite tree sets, Order, 38:79-96, April 2021.
-
Joshua Erde, J. Pascal Gollin, Atilla Joó, Paul Knappe, and Max Pitz,
Base partition for mixed families of finitary and cofinitary matroids, Combinatorica, 41:31-52, February 2021.
2020
-
Matt DeVos, O-joung Kwon, and Sang-il Oum,
Branch-depth: Generalizing tree-depth of graphs, European J. Combin., 90(Article 103186), December 2020.
-
Huy-Tung Nguyen and Sang-il Oum,
The average cut-rank of graphs, European J. Combin., 90(Article 103183), December 2020.
-
Minjeong Kang, O-joung Kwon, and Myounghwan Lee,
Graphs without two vertex-disjoint S-cycles, 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:169-213, November 2020.
-
Jürgen Kritschgau, Abhishek Methuku, Michael Tait, and Craig Timmons, Few H copies in F-saturated graphs, J. Graph Theory, 94:320-348, July 2020.
-
Dániel Grósz, Abhishek Methuku, and Casey Tompkins, On subgraphs of C2k-free graphs and a problem of Kühn and Osthus, Combin. Probab. Comput., 29(3):436-454, May 2020.
-
Eun Jung Kim and O-joung Kwon, Erdős-Pósa property of chordless cycles and its applications, J. Combin. Theory Ser. B., 145:65-112, November 2020.
-
Beka Ergemlidze, Ervin Győri, and Abhishek Methuku, 3-Uniform 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 Berge-F-free 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):351-369, 2020.
-
Dániel Gerbner, Abhishek Methuku, and Cory Palmer, General lemmas for Berge-Turán hypergraph problems, European J. Combin., 86(Article 103082), May 2020.
-
O-joung Kwon and Sang-il Oum,
Scattered classes of graphs, SIAM J. Discrete Math., 34(1):972-999, 2020.
-
Benjamin Bergougnoux, Mamadou Kanté, and O-joung Kwon, An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width, Algorithimca, 82(6):1654-1674, 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 1-factors with prescribed lengths in tournaments,
J. Combin. Theory Ser. B, 141:31-71, March 2020.
-
Ringi Kim, O-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.
2019
-
Nika Salia, Casey Tompkins, Zhiyu Wang, and Oscar Zamora, Ramsey numbers of Berge-hypergraphs 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 Berge-F-free hypergraphs, Electron. J. Combin. 26(4), #P4.7, October 2019.
-
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.
-
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 Choi, Ilkyoo Choi, Jisu 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
-
Jungho Ahn, Lars Jaffke, O-joung Kwon, and Paloma T. Lima, Three problems on well-partitioned chordal graphs, In the Proceedings of the 12th International Conference on Algorithms and Complexity (CIAC2021, May 10-12, 2021), Lecture Notes in Comput. Sci., vol. 12701, pp. 23-36, 2021.
-
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 ACM-SIAM Symposium on Discrete Algorithms (SODA21, January 10-13, 2021, Online), pp. 1206-1225, 2021. Society for Industrial and Applied Mathematics.
-
Benjamin Bergougnoux, Edouard Bonnet, Nick Brettell, and O-joung Kwon, Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth, in the Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC2020, Hong Kong, December 14-18, 2020), Article No. 3; pp. 3:1-3:17, 2020.
-
Jungho Ahn, Eun Jung Kim, and Euiwoong Lee, Towards constant-factor approximation for chordal / distance-hereditary vertex deletion, In the Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC2020, December 14-18, 2020, Hong Kong), Article No. 62; pp. 62:1-62:16, 2020.
-
Jungho Ahn, Eduard Eiben, O-joung Kwon, and Sang-il Oum, A polynomial kernel for 3-leaf power deletion, In the Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS2020, August 24-28, 2020, Prague, Czech Republic), Article No. 5; pp. 5:1-5:14, 2020.
-
Jungho Ahn, Lars Jaffke, O-joung Kwon, and Paloma T. Lima, Well-partitioned chordal graphs: obstruction set and disjoint paths, In the Proceedings of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG2020, June 24-26, 2020, Leeds, UK), Lecture Notes in Comput. Sci., vol. 12301, pp. 148-160, 2020.
-
Sanjeeb Dash, Oktay Günlük, and Dabeen Lee, On a generalization of the Chvátal-Gomory closure, In the Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020, June 8-10, 2020, London, UK), Lecture Notes in Comput. Sci., Vol. 12125, pp. 117-129, 2020.
-
Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, and Dabeen Lee, Idealness of k-wise intersecting families, In the Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020, June 8-10, 2020, London, UK), Lecture Notes in Comput. Sci., vol. 12125, pp. 1-12, 2020.
-
Archontia Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, and O-joung Kwon,
The Directed Flat Wall Theorem,
In the Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA20, January 5-8, 2020, Salt Lake City, Utah, USA), pages 239-258, 2020. Society for Industrial and Applied Mathematics.
