Papers

Submitted / Preprint

  1. Ervin Győri, Nika Salia, Casey Tompkins, and Oscar Zamora,  Inverse Turán numbers, 2020. arXiv:2007.07042
  2. Sanjeeb Dash, Oktay Günlük, and Dabeen LeeOn a generalization of the Chvátal-Gomory closure, 2020 arXiv:2007.04880
  3. Nam Ho-Nguyen, Fatma Kılınç-Karzan, Simge Küçükyavuz, and Dabeen LeeStrong formulations for distributionally robust chance-constrained programs with left-hand side uncertainty under Wasserstein ambiguity, 2020. arXiv:2007.06750
  4. Dong Yeap Kang, Mihyun Kang, Jaehoon Kim, and Sang-il OumFragile minor-monotone parameters under random edge perturbation, 2020. arXiv:2005.09897
  5. 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. arXiv:2004.06097
  6. 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, 2020. arXiv:2003.12685
  7. J. Pascal Gollin, Kevin Hendrey, Dillon Mayhew, and Sang-il Oum, Obstructions for bounded branch-depth in matroids, 2020. arXiv:2003.13975
  8. Jaehoon Kim and Sang-il Oum, The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor, 2020. arXiv:2003.12960
  9. Joshua Erde, J. Pascal Gollin, and Attila JoóEnlarging vertex-flames in countable digraphs, 2020. arXiv:2003.06178
  10. Maria Axenovich, David Offner, and Casey Tompkins, Long path and cycle decompositions of even hypercubes, 2019. arXiv:1905.10114
  11. Jungho Ahn, Lars Jaffke, O-joung Kwon, and Paloma T. Lima, Well-partitioned chordal graphs: obstruction set and disjoint paths, 2020. arXiv:2002.10859
  12. H. A. Kierstead, Sang-il Oum, Hao Qi, and Xuding Zhu, 3-degenerate induced subgraph of a planar graph, 2020. arXiv:2002.07984
  13. Ervin Győri, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora, Generalized planar Turán numbers, 2020. arXiv:2002.04579
  14. Jinha Kim, Minki Kim, and O-joung Kwon, Rainbow independent sets on dense graph classes, 2020. arXiv:2001.10566
  15. 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. arXiv:2001.00849
  16. Nika Salia, Christoph SpigelCasey Tompkins, and Oscar Zamora, Independent chains in acyclic posets, 2019. arXiv:1912.03288
  17. Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, and Dabeen Lee, Idealness of k-wise intersecting families, 2019. arXiv:1912.00614
  18. Dániel Gerbner, Tamás MészárosAbhishek Methuku, and Cory Palmer, Generalized rainbow Turán problems, 2019. arXiv:1911.06642
  19. Jungho Ahn, Eduard EibenO-joung Kwon, and Sang-il Oum, A polynomial kernel for 3-leaf power deletion, 2019. arXiv:1911.04249
  20. O-joung Kwon, Rose McCarty, Sang-il Oum, and Paul Wollan, Obstructions for bounded shrub-depth and rank-depth, 2019. arXiv:1911.00230
  21. Ringi Kim, Sergey Norin, and Sang-il OumObstructions for partitioning into forests and outerplanar graphs, 2019. arXiv:1903.08425
  22. J. Pascal Gollin and Karl Heuer, On the Infinite Lucchesi-Younger Conjecture I, 2019. arXiv:1909.08373
  23. 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
  24. 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
  25. 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
  26. Jim Geelen, O-joung Kwon, Rose McCarty, and Paul Wollan, The grid theorem for vertex-minors, 2019. arXiv:1909.08113
  27. Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee, and Matt Superdock, Projective geometries, simplices and clutters, 2019. arXiv:1908.10629
  28. Abhishek Methuku and István Tomon, Bipartite Turán problems for ordered graphs, 2019. arXiv:1908.03189
  29. Martin Balko, Dániel Gerbner, Dong Yeap Kang, Younjin Kim, and Cory Palmer, Hypergraph based Berge hypergraphs, 2019. arXiv:1908.00092
  30. Ringi Kim, Sang-il Oum, and Xin Zhang, Equitable partition of planar graphs, 2019. arXiv:1907.09911
  31. O-joung Kwon and Sang-il Oum, Graphs of bounded depth-2 rank-brittleness, 2019. arXiv:1906.05753

Published

Accepted

  1. 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. doi:10.1007/s10107-020-01539-5
  2. Matt DeVosO-joung Kwon, and Sang-il Oum, Branch-depth: Generalizing tree-depth of graphs, European J. Combin., accepted, 2020. arXiv:1903.11988
  3. J. Pascal Gollin and Karl Heuer, An analogue of Edmonds’ Branching Theorem for infinite digraphs, European J. Combin., accepted, 2020. arXiv:1805.02933
  4. J. Pascal Gollin and Jakob Kneip, Representations of infinite tree sets, Order, accepted, 2020. doi:10.1007/s11083-020-09529-0 arXiv:1908.10327
  5. Ahmad Abdi, Gérard Cornuéjols, and Dabeen Lee, Resistant sets in the unit hypercube, Math. Oper. Res., accepted, 2019.
  6. 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. arXiv:1910.05601

2020

  1. Huy-Tung Nguyen and Sang-il Oum, The average cut-rank of graphs, European J. Combin., 90(Article 103183), December 2020. doi:10.1016/j.ejc.2020.103183 arXiv:1906.02895
  2. Minjeong Kang, O-joung Kwon, and Myounghwan Lee, Graphs without two vertex-disjoint S-cycles, Discrete Math., 343(10):111997, October 2020. doi:10.1016/j.disc.2020.111997 arXiv:1908.09065
  3. Dániel Gerbner, Ervin GyőriAbhishek Methuku, and Máté Vize,  Generalized Turán problems for even cycles, J. Combin.  Theory Ser. B, 145:169-213, November 2020. doi:10.1016/j.jctb.2020.05.005 arXiv:1712.07079
  4. Jürgen KritschgauAbhishek Methuku, Michael Tait, and Craig TimmonsFew H copies in F-saturated graphs, J. Graph Theory, 94:320-348, July 2020. doi:10.1002/jgt.22525 arXiv:1810.00939
  5. 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. doi:10.1017/S0963548319000452
  6. Eun Jung Kim and O-joung KwonErdős-Pósa property of chordless cycles and its applications, J. Combin. Theory Ser. B., 145:65-112, November 2020. doi:10.1016/j.jctb.2020.05.002 arXiv:1711.00667
  7. 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.* doi:10.37236/8806
  8. 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. doi:10.1016/j.ejc.2020.103109
  9. 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. doi:10.1137/18M1225227
  10. Dániel Gerbner, Abhishek Methuku, and Cory Palmer, General lemmas for Berge-Turán hypergraph problems, European J. Combin., 86(Article 103082), May 2020. doi:10.1016/j.ejc.2020.103082
  11. O-joung Kwon and Sang-il Oum, Scattered classes of graphs, SIAM J. Discrete Math., 34(1):972-999, 2020. doi:10.1137/19M1293776 arXiv:1801.06004
  12. 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. doi:10.1007/s00453-019-00663-9 arXiv:1702.06095
  13. 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
  14. 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. doi:10.1016/j.disc.2020.111886 arXiv:1910.04666
  15. Jimeng Xiao and Casey Tompkins, On forbidden poset problems in the linear lattice, Electron. J. Combin., 27(1), #P1.18, January 2020. doi:10.37236/8831 arXiv:1905.09246
  16. Dong Yeap Kang and Jaehoon Kim, On 1-factors with prescribed lengths in tournaments, J. Combin. Theory Ser. B, 141:31-71, March 2020. doi:10.1016/j.jctb.2019.06.003
  17. 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

2019

  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. doi:10.37236/8892 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. doi:10.37236/8504
  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. Jungho Ahn, Eduard EibenO-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), accepted, 2020. arXiv:1911.04249
  2. 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), accepted, 2020.
  3. 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. doi:10.1007/978-3-030-45771-6_10
  4. 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. doi:10.1007/978-3-030-45771-6_1
  5. 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. doi:10.1137/1.9781611975994.15