Papers

Submitted / Preprint

1. Hoil Lee, Fadhel Ayed, Paul Jung, Juho Lee, Hongseok Yang, and François Caron, Deep neural networks with dependent weights: Gaussian Process mixture limit, heavy tails, sparsity and compressibility, 2022.
   arXiv:2205.08187Last update: May 21, 2022
2. Ben Lund, Thang Pham, and Vu Thi Huong Thu,  Radial projection theorems in finite spaces, 2022.
   arXiv:2205.07431Last update: May 21, 2022
3. Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee, Hong Liu, and Jaehyeon Seo, On a rainbow extremal problem for color-critical graphs, 2022.
   arXiv:2204.02575Last update: April 7, 2022
4. Jeong Han Kim, Ben Lund, Thang Pham, and Semin Yoo, Threshold functions for incidence properties in finite vector spaces, 2022.
   arXiv:2203.12801Last update: March 26, 2022
5. Stijn Cambie, Jaehoon Kim, Hong Liu, and Tuan Tran, A proof of Frankl’s conjecture on cross-union families, 2022.
   arXiv:2202.10365Last update: February 26, 2022
6. Édouard Bonnet, O-joung Kwon, and David R. Wood, Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond), 2022.
   arXiv:2202.11858Last update: February 25, 2022
7. Eun-Kyung Cho, Jinha Kim, Minki Kim, and Sang-il Oum, Independent domination of graphs with bounded maximum degree, 2022.
   arXiv:2202.09594Last update: February 22, 2022
8. Donggyu Kim and Sang-il Oum, Prime vertex-minors of a prime graph, 2022.
   arXiv:2202.07877Last update: February 17, 2022
9. Maria Axenovich, Laurin Benz, David Offner, and Casey Tompkins, Generalized Turán densities in the hypercube, 2022.
   arXiv:2201.04598Last update: January 18, 2022
10. Jaehoon Kim, Hong Liu, and Tuan Tran,  Exponential decay of intersection volume with applications on list–decodability and Gilbert–Varshamov type bound, 2021.
    arXiv:2112.11274Last update: December 24, 2021
11. Donggyu Kim and Suil O, Eigenvalues and parity factors in graphs, 2021.
    arXiv:2111.12966Last update: December 4, 2021
12. Kevin Hendrey, Ben Lund, Casey Tompkins, and Tuan Tran, Maximal 3-wise intersecting families, 2021.
    arXiv:2110.12708Last update: October 26, 2021
13. Duksang Lee and Sang-il Oum, A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors, 2021.
    arXiv:2110.10390Last update: December 27, 2021
14. Linda Cook, Jake Horsfield, Myriam Preissmann, Cléophée Robin, Paul Seymour, Ni Luh Dewi Sintiari, Nicolas Trotignon, Kristina Vušković, Graphs with all holes the same length, 2021.
    arXiv:2110.09970Last update: October 20, 2021
15. Taesung Kim and O-joung Kwon, A new family of hypohamiltonian graphs generalizing Lindgren’s construction, 2021.
    Last update: December 27, 2021
16. Jungho Ahn, Kevin Hendrey, Donggyu Kim, and Sang-il Oum, Bounds for the twin-width of graphs, 2021.
    arXiv:2110.03957Last update: October 11, 2021
17. Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, and O-Joung Kwon, A Unifying Framework for Characterizing and Computing Width Measures, 2021.
    arXiv:2109.14610Last update: October 1, 2021
18. Mamadou M. Kanté, Eun Jung Kim, O-joung Kwon, and Sang-il Oum, Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k, 2021.
    arXiv:2109.12291Last update: September 28, 2021
19. J. Pascal Gollin, Karl Heuer, and Konstantinos Stavropoulos, Disjoint dijoins for classes of dicuts in finite and infinite digraphs, 2021.
    arXiv:2109.03518Last update: September 9, 2021
20. Minki Kim and Alan Lew, Leray numbers of tolerance complexes, 2021.
    arXiv:2109.03030Last update: September 9, 2021
21. J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku, Casey Tompkins, and Xin Zhang, Counting cliques in 1-planar graphs, 2021.
    arXiv:2109.02906Last update: September 8, 2021
22. Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, and Hong Liu, Fractional Helly theorem for Cartesian products of convex sets, 2021.
    arXiv:2108.09962Last update: August 24, 2021
23. Marthe Bonamy, Linda Cook, Carla Groenland, and Alexandra Wesolek,  A tight local algorithm for the minimum dominating set problem in outerplanar graphs, 2021.
    arXiv:2108.02697Last update: August 6, 2021
24. Kevin Hendrey, Sergey Norin, and David Wood, Extremal functions for sparse minors, 2021.
    arXiv:2107.08658Last update: July 20, 2021
25. Debsoumya Chakraborti, Bipartite independence number and balanced coloring, 2021.
    arXiv:2107.02506Last update: July 7, 2021
26. Debsoumya Chakraborti and Da Qi Chen, Exact results on generalized Erdős-Gallai problems, 2021.
    arXiv:2006.04681Last update: June 22, 2021
27. Duksang Lee and Sang-il Oum, Intertwining connectivities for vertex-minors and pivot-minors, 2021.
    arXiv:2106.03414Last update: December 27, 2021
28. Dabeen Lee and Milan Vojnovic, Scheduling jobs with stochastic holding costs, 2021.
    arXiv:2105.13655Last update: November 1, 2021
29. Debsoumya Chakraborti, Jeong Han Kim, Joonkyung Lee, and Tuan Tran, Majority dynamics on sparse random graphs, 2021.
    arXiv:2105.12709Last update: June 4, 2021
30. Tony Huynh and O-joung Kwon,  On the Erdős-Pósa property for long holes in $C_4$-free graphs, 2021.
    arXiv:2105.11799Last update: May 27, 2021
31. Lars Jaffke, O-joung Kwon, and Jan Arne Telle, Classes of intersection digraphs with good algorithmic properties, 2021.
    arXiv:2105.01413Last update: May 6, 2021
32. Donggyu Kim, Duksang Lee, and Sang-il Oum, Γ-graphic delta-matroids and their applications, 2021.
    arXiv:2104.11383Last update: December 27, 2021
33. Dániel Grósz, Abhishek Methuku, and Casey Tompkins, Ramsey numbers of Boolean lattices, 2021.
    arXiv:2104.02002Last update: June 4, 2021
34. Debsoumya Chakraborti, Alan Frieze, and Mihir Hasabnis, Colorful Hamilton cycles in random graphs, 2021.
    arXiv:2103.03916Last update: March 9, 2021
35. 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.
    arXiv:2102.01986Last update: February 4, 2021
36. Fatma Kılınç-Karzan, Simge Küçükyavuz, and Dabeen Lee, Conic mixed-binary sets: convex hull characterizations and applications, 2020.
    arXiv:2012.14698Last update: January 1, 2021
37. 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.
    arXiv:1809.00602Last update: December 29, 2020
38. 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.
    arXiv:2012.13070Last update: December 25, 2020
39. Debsoumya Chakraborti and Po-Shen Loh,  Rainbow matchings in edge-colored simple graphs, 2020.
    arXiv:2011.04650Last update: November 11, 2020
40. Sang-il Oum,  Rank connectivity and pivot-minors of graphs, 2020.
    arXiv:2011.03205Last update: November 9, 2020
41. Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, and Daniel Vaz, Vertex sparsification for edge connectivity, 2020.
    arXiv:2007.07862Last update: October 6, 2020
42. 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.
    arXiv:2009.13184Last update: September 29, 2020
43. J. Pascal Gollin and Karl Heuer, Characterising k-connected sets in infinite graphs, 2020.
    arXiv:1811.06411Last update: December 25, 2020
44. Beka Ergemlidze, Ervin Győri, Abhishek Methuku, Nike Salia, and Casey Tompkins, On 3-uniform hypergraphs avoiding a cycle of length four, 2020.
    arXiv:2008.11372Last update: June 4, 2021
45. Tuan Tran, The smallest singular value of random combinatorial matrices, 2020.
    arXiv:2007.06318Last update: August 2, 2020
46. Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, and O-joung Kwon, Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth, 2020.
    arXiv:2007.14179Last update: June 4, 2021
47. Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, and Qiqin Xie,  Half-integral Erdős-Pósa property of directed odd cycles, 2020.
    arXiv:2007.12257Last update: July 27, 2020
48. 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.
    arXiv:2007.06750Last update: July 15, 2020
49. Dong Yeap Kang, Mihyun Kang, Jaehoon Kim, and Sang-il Oum,  Fragile minor-monotone parameters under random edge perturbation, 2020.
    arXiv:2005.09897Last update: May 21, 2020
50. 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.00849Last update: June 1, 2021
51. Nika Salia, Christoph Spigel, Casey Tompkins, and Oscar Zamora, Independent chains in acyclic posets, 2019.
    arXiv:1912.03288Last update: December 11, 2019
52. Dániel Gerbner, Tamás Mészáros, Abhishek Methuku, and Cory Palmer, Generalized rainbow Turán problems, 2019.
    arXiv:1911.06642Last update: June 1, 2021
53. Jungho Ahn, Eduard Eiben, O-joung Kwon, and Sang-il Oum, A polynomial kernel for 3-leaf power deletion, 2019.
    arXiv:1911.04249Last update: January 30, 2020
54. Ervin Győri, Addis Paulos, Nike Salia, Casey Tompkins, and Oscar Zamora, The maximum number of pentagons in a planar graph, 2019.
    arXiv:1909.13532Last update: October 20, 2019
55. Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee, and Matt Superdock, Projective geometries, simplices and clutters, 2019.
    arXiv:1908.10629Last update: October 21, 2019

Published

Accepted

56. Matija Bucić, Benny Sudakov, and Tuan Tran, Erdős-Szekeres theorem for multidimensional arrays, J. European Math. Soc., accepted, 2022.
    arXiv:1910.13318Last update: May 21, 2022
57. Dabeen Lee, Milan Vojnovic, and Se-Young Yun, Test score algorithms for budgeted stochastic utility maximization, INFORMS J. Optim., accepted, 2022.
    arXiv:2012.15194Last update: May 5, 2022
58. Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, and Hong Liu, Well-mixing vertices and almost expanders, Proc. Amer. Math. Soc., accepted, 2022.
    arXiv:2108.12864Last update: February 18, 2022
59. Abhishek Methuku and István Tomon, Bipartite Turán problems for ordered graphs, Combinatorica, accepted, 2021. *
    doi:10.1007/s00493-021-4296-0 arXiv:1908.03189Last update: January 20, 2022
60. Jeong-Ok Choi and Youngmi Hur, Invertibility of circulant matrices of arbitrary size, Linear and Multilinear Algebra, accepted, 2021.
    doi:10.1080/03081087.2021.1981812 arXiv:2106.13584Last update: October 3, 2021
61. 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.
    doi:10.1007/s10107-021-01688-1 arXiv:1910.01353Last update: July 30, 2021
62. Minki Kim and Alan Lew, Complexes of graphs with bounded independence number, Israel J. Math., accepted, 2021. *
    doi:10.1007/s11856-022-2308-4 arXiv:1912.12605Last update: April 14, 2022
63. 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, 2021.
    doi:10.1007/s10107-020-01605-y arXiv:2003.12685Last update: July 30, 2021
64. Jim Geelen, O-joung Kwon, Rose McCarty, and Paul Wollan, The grid theorem for vertex-minors, J. Combin. Theory Ser. B, accepted, 2020.
    doi:10.1016/j.jctb.2020.08.004 arXiv:1909.08113Last update: September 30, 2020
65. Jungho Ahn, Eun Jung Kim, and Euiwoong Lee, Towards constant-factor approximation for chordal / distance-hereditary vertex deletion, Algorithmica, accepted, 2022.
    doi:10.1007/s00453-022-00963-7 arXiv:2009.00809Last update: April 6, 2022
66. Ervin Győri, Addis Paulos, Nike Salia, Casey Tompkins, and Oscar Zamora, The maximum number of paths of length three in a planar graph, J. Graph Theory, accepted, 2022.
    doi:10.1002/jgt.22836 arXiv:1909.13539Last update: April 21, 2022

2022

67. Tuan Tran, Two problems in graph Ramsey theory, European J. Combin., 104(Article 103552), August 2022.
    doi:10.1016/j.ejc.2022.103552 arXiv:2008.07367Last update: May 21, 2022
68. Jungho Ahn, Lars Jaffke, O-joung Kwon, and Paloma T. Lima, Well-partitioned chordal graphs, Discrete Math., 345(10)(Article 112985), October 2022.
    doi:10.1016/j.disc.2022.112985 arXiv:2002.10859Last update: May 21, 2022
69. Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, and Dabeen Lee, Idealness of k-wise intersecting families, Math. Program., 192:29-50, March 2022.
    doi:10.1007/s10107-020-01587-x arXiv:1912.00614Last update: May 21, 2022
70. Ringi Kim, Sergey Norin, and Sang-il Oum, Obstructions for partitioning into forests and outerplanar graphs, Discrete Appl. Math., 312:15-28, May 2022.
    doi:10.1016/j.dam.2020.09.006 arXiv:1903.08425Last update: March 22, 2022
71. Jinha Kim, Minki Kim, and O-joung Kwon, Rainbow independent sets on dense graph classes, Discrete Appl. Math., 312:45-51, May 2022.
    doi:10.1016/j.dam.2021.04.007 arXiv:2001.10566Last update: March 22, 2022
72. Sanjeeb Dash, Oktay Günlük, and Dabeen Lee,  On a generalization of the Chvátal-Gomory closure, Math. Program., 192:149-175, March 2022.
    doi:10.1007/s10107-021-01697-0 arXiv:2007.04880Last update: May 21, 2022
73. Linda Cook and Paul Seymour, Detecting a long even hole, European J. Combin., 104(Article 103537), August 2022.
    doi:10.1016/j.ejc.2022.103537 arXiv:2009.05691Last update: May 21, 2022
74. Jinha Kim, The homotopy type of the independence complex of graphs with no induced cycle of length divisible by 3, European J. Combin., 104(Article 103534), August 2022.
    doi:10.1016/j.ejc.2022.103534 arXiv:2101.07131Last update: May 21, 2022
75. Ron Aharoni, Joseph Briggs, Minho Cho, and Jinha Kim,  Cooperative conditions for the existence of rainbow matchings, Electron. J. Combin., 29(1), #P1.23, January 2022.
    doi:10.37236/9448 arXiv:2003.08247Last update: January 28, 2022
76. Yana Bromberg, Ariel Aptekmann, Yannick Mahlich, Linda Cook, Stefan Senn, Maximilian Miller, Vikas Nanda, Diego Ferreiro, and Paul Falkowski, Quantifying structural relationships of metal-binding sites suggests origins of biological electron transfer, Sci. Adv., 8(2):eabj3984, January 2022.
    doi:10.1126/sciadv.abj3984Last update: January 17, 2022
77. Ervin Győri, Nika Salia, Casey Tompkins, and Oscar Zamora,  Inverse Turán numbers, Discrete Math., 345(5)(Article 112779), May 2022.
    doi:10.1016/j.disc.2021.112779 arXiv:2007.07042Last update: May 21, 2022
78. Martin Balko, Dániel Gerbner, Dong Yeap Kang, Younjin Kim, and Cory Palmer, Hypergraph based Berge hypergraphs, Graphs and Combinatorics, 38(11):1-13, February 2022. *
    doi:10.1007/s00373-021-02419-1 arXiv:1908.00092Last update: May 21, 2022
79. Duksang Lee and Sang-il Oum, Characterizing matroids whose bases form graphic delta-matroids, European J. Combin., 101(Article 103476), March 2022.
    doi:10.1016/j.ejc.2021.103476 arXiv:2007.13298Last update: May 21, 2022
80. Yangyan Gu, H. A. Kierstead, Sang-il Oum, Hao Qi, and Xuding Zhu, 3-degenerate induced subgraph of a planar graph, J. Graph Theory, 99(2):251-277, February 2022.
    doi:10.1002/jgt.22740 arXiv:2002.07984Last update: December 8, 2021

2021

81. 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, SIAM J. Discrete Math., 35(4):2922-2945, December 2021.
    doi:10.1137/21M1402339 arXiv:2008.00561Last update: May 21, 2022
82. Ervin Győri, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora, Generalized planar Turán numbers, Electron. J. Combin., 28(4), #P4.32, November 2021.
    doi:10.37236/9603 arXiv:2002.04579Last update: December 4, 2021
83. Jisu Jeong, Eun Jung Kim, and Sang-il Oum, Finding branch-decompositions of matroids, hypergraphs, and more, SIAM J. Discrete Math., 35(4):2544-2617, November 2021.
    doi:10.1137/19M1285895 arXiv:1711.01381Last update: May 21, 2022
84. Manik Dhar, Zeev Dvir, and Ben Lund, Simple proofs for Furstenberg sets over finite fields, Discrete Analysis, 2021:22, 16pp, October 2021.
    doi:10.19086/da.29067 arXiv:1909.03180Last update: October 14, 2021
85. Sanjeeb Dash, Oktay Günlük, and Dabeen Lee, Generalized Chvátal-Gomory closures for integer programs with bounds on variables, Math. Program., 190:393-425, November 2021.
    doi:10.1007/s10107-020-01539-5Last update: October 9, 2021
86. Jinha Kim, Minki Kim, and O-joung Kwon, A system of disjoint representatives of line segments with given k directions, Discrete Math., 344(12)(Article 112621), December 2021.
    doi:10.1016/j.disc.2021.112621 arXiv:2101.02887Last update: May 21, 2022
87. Matija Bucić, Nemanja Draganić, Benny Sudakov, and Tuan Tran,  Unavoidable hypergraphs, J. Combin. Theory Ser. B, 151:307-338, November 2021.
    doi:10.1016/j.jctb.2021.06.010 arXiv:2011.12944Last update: July 15, 2021
88. Joshua Erde, J. Pascal Gollin, and Attila Joó,  Enlarging vertex-flames in countable digraphs, J. Combin. Theory Ser. B, 151:263-281, November 2021.
    doi:10.1016/j.jctb.2021.06.011 arXiv:2003.06178Last update: July 15, 2021
89. J. Pascal Gollin and Karl Heuer, On the Infinite Lucchesi-Younger Conjecture I, J. Graph Theory, 98(1):27-48, September 2021.
    doi:10.1002/jgt.22680 arXiv:1909.08373Last update: July 14, 2021
90. 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.
    doi:10.1137/20M1368835 arXiv:2009.07651Last update: June 4, 2021
91. 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.
    doi:10.1016/j.jctb.2021.05.005 arXiv:2003.07943Last update: June 9, 2021
92. 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.
    doi:10.19086/aic.24227 arXiv:2003.13975Last update: May 21, 2021
93. 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.
    doi:10.1016/j.jcss.2021.04.005 arXiv:1908.10132Last update: June 1, 2021
94. 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.
    doi:10.1002/jgt.22658 arXiv:1906.05908Last update: April 17, 2021
95. 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.
    doi:10.1002/jgt.22639Last update: April 17, 2021
96. Jan Corsten and Tuan Tran, Balanced supersaturation for some degenerate hypergraphs, J. Graph Theory, 97(4):600-623, July 2021.
    doi:10.1002/jgt.22674 arXiv:1707.03788Last update: June 10, 2021
97. 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.
    doi:10.37236/9536 arXiv:2003.12960Last update: April 9, 2021
98. Eun Jung Kim and O-joung Kwon, A polynomial kernel for distance-hereditary vertex deletion, Algorithmica, 83:2096-2141, July 2021.
    doi:10.1007/s00453-021-00820-z arXiv:1610.07229Last update: June 23, 2021
99. Maria Axenovich, David Offner, and Casey Tompkins, Long path and cycle decompositions of even hypercubes, European J. Combin., 95(Article 103320), June 2021.
    doi:10.1016/j.ejc.2021.103320 arXiv:1905.10114Last update: May 21, 2022
100. 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(Article 103321), June 2021.
     doi:10.1016/j.ejc.2021.103321 arXiv:2004.06097Last update: May 21, 2022
101. Ringi Kim, Sang-il Oum, and Xin Zhang, Equitable partition of planar graphs, Discrete Math., 344(6):112351, June 2021.
     doi:10.1016/j.disc.2021.112351 arXiv:1907.09911Last update: March 1, 2021
102. Ron Aharoni, Joseph Briggs, Jinha Kim, and Minki Kim, Badges and rainbow matchings, Discrete Math., 344(6):112363, June 2021.
     doi:10.1016/j.disc.2021.112363 arXiv:2004.07590Last update: March 8, 2021
103. Ahmad Abdi, Gérard Cornuéjols, and Dabeen Lee, Resistant sets in the unit hypercube, Math. Oper. Res., 46(1):82-114, February 2021.
     doi:10.1287/moor.2019.1048Last update: February 9, 2021
104. 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.
     doi:10.1016/j.jctb.2021.01.005 arXiv:1911.00230Last update: January 26, 2021
105. 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.
     doi:10.1016/j.jctb.2020.12.003 arXiv:1811.06916Last update: February 9, 2021
106. 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.
     doi:10.1016/j.jctb.2021.01.004 arXiv:1907.09338Last update: January 20, 2021
107. O-joung Kwon and Jean-Florent Raymond, Packing and covering induced subdivisions, SIAM J. Discrete Math., 35(2):597-636, April 2021.
     doi:10.1137/18M1226166 arXiv:1803.07581Last update: April 28, 2021
108. Jinha Kim and Minki Kim, Domination numbers and noncover complexes of hypergraphs, J. Combin. Theory Ser. A, 180(Article 105408), May 2021.
     doi:10.1016/j.jcta.2021.105408 arXiv:2101.01850Last update: January 29, 2021
109. O-joung Kwon and Sang-il Oum, Graphs of bounded depth-2 rank-brittleness, J. Graph Theory, 96:361-378, March 2021.
     doi:10.1002/jgt.22619 arXiv:1906.05753Last update: January 16, 2021
110. 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.
     doi:10.37236/9066 arXiv:1910.07674Last update: February 5, 2021
111. 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.
     doi:10.1016/j.jctb.2020.12.005 arXiv:1808.00863Last update: December 23, 2020
112. Reinhard Diestel and Sang-il Oum, Tangle-tree duality in abstract separation systems, Adv. Math., 377(Article 107470), January 2021.
     doi:10.1016/j.aim.2020.107470 arXiv:1701.02509Last update: December 11, 2020
113. J. Pascal Gollin and Karl Heuer, An analogue of Edmonds’ Branching Theorem for infinite digraphs, European J. Combin., 92(Article 103182), February 2021.
     doi:10.1016/j.ejc.2020.103182 arXiv:1805.02933Last update: August 25, 2020
114. J. Pascal Gollin and Jakob Kneip, Representations of infinite tree sets, Order, 38:79-96, April 2021.
     doi:10.1007/s11083-020-09529-0 arXiv:1908.10327Last update: May 7, 2021
115. 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.
     doi:10.1007/s00493-020-4422-4 arXiv:1910.05601Last update: April 17, 2021

2020

116. Matt DeVos, O-joung Kwon, and Sang-il Oum, Branch-depth: Generalizing tree-depth of graphs, European J. Combin., 90(Article 103186), December 2020.
     doi:10.1016/j.ejc.2020.103186 arXiv:1903.11988Last update: July 23, 2020
117. 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.02895Last update: July 16, 2020
118. Minjeong Kang, O-joung Kwon, and Myounghwan Lee, Graphs without two vertex-disjoint S-cycles, Discrete Math., 343(10)(Article 111997), October 2020.
     doi:10.1016/j.disc.2020.111997 arXiv:1908.09065Last update: May 21, 2022
119. 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.
     doi:10.1016/j.jctb.2020.05.005 arXiv:1712.07079Last update: June 1, 2021
120. 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.
     doi:10.1002/jgt.22525 arXiv:1810.00939Last update: June 1, 2021
121. 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):436-454, May 2020.
     doi:10.1017/S0963548319000452Last update: June 1, 2021
122. 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.
     doi:10.1016/j.jctb.2020.05.002 arXiv:1711.00667Last update: May 21, 2020
123. 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/8806Last update: June 1, 2021
124. 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.103109Last update: June 1, 2021
125. 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/18M1225227Last update: June 1, 2021
126. 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.103082Last update: June 1, 2021
127. 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.06004Last update: April 13, 2020
128. 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.06095Last update: April 13, 2020
129. 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.09040Last update: July 16, 2020
130. 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.04666Last update: June 1, 2021
131. 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.09246Last update: April 1, 2020
132. 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.003Last update: December 31, 2019
133. 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.
     doi:10.1016/j.jctb.2019.06.001Last update: April 13, 2020

2019

134. 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.
     doi:10.37236/8892 arXiv:1808.09863Last update: September 9, 2020
135. 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/8504Last update: June 1, 2021
136. 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.012Last update: October 30, 2019
137. 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-5Last update: October 20, 2019
138. 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/S0963548318000548Last update: October 20, 2019
139. 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.
     doi:10.1002/jgt.22445Last update: October 20, 2019

Refereed Conference Papers

140. Hyungi Lee, Eunggu Yun, Hongseok Yang, and Juho Lee, Scale Mixtures of Neural Network Gaussian Processes, In the Proceedings of the Tenth International Conference on Learning Representations (ICLR2022, Virtual, April 25-29, 2022), accepted, 2022.
     Last update: March 30, 2022
141. Geon-Hyeong Kim, Seokin Seo, Jongmin Lee, Wonseok Jeon, HyeongJoo Hwang, Hongseok Yang, and Kee-Eung Kim, DemoDICE: Offline Imitation Learning with Supplementary Imperfect Demonstrations, In the Proceedings of the Tenth International Conference on Learning Representations (ICLR2022, Virtual, April 25-29, 2022), accepted, 2022.
     Last update: March 30, 2022
142. Lars Jaffke, O-joung Kwon, and Jan Arne Telle, Classes of intersection digraphs with good algorithmic properties, In the Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022, Marseille, March 15-18, 2022), Article No. 38; pp. 38:1-38:18, 2022.
     doi:10.4230/LIPIcs.STACS.2022.38 arXiv:2105.01413Last update: March 9, 2022
143. Mamadou M. Kanté, Eun Jung Kim, O-joung Kwon, and Sang-il Oum, Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k, In the Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022, Marseille, March 15-18, 2022), Article No. 40; pp. 40:1-40:14, 2022.
     doi:10.4230/LIPIcs.STACS.2022.40 arXiv:2109.12291Last update: March 9, 2022
144. Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, and O-Joung Kwon, A Unifying Framework for Characterizing and Computing Width Measures, In the Proceedings of the 13th Innovations in Theoretical Computer Science Conference (ITCS 2022, January 31-February 3, 2022), Article No. 63; pp. 63:1-63:23, 2022.
     doi:10.4230/LIPIcs.ITCS.2022.63 arXiv:2109.14610Last update: January 27, 2022
145. Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, and O-joung Kwon, Directed tangle-tree decomposition and its applications, In the Proceedings of the Thirty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA22, January 9-12, 2022, Alexandria, Virginia, USA), pp. 377-405, 2022.
     doi:10.1137/1.9781611977073.19 arXiv:2009.13184Last update: January 11, 2022
146. Dabeen Lee and Milan Vojnovic, Scheduling jobs with stochastic holding costs, In the Proceedings of the Thirty-fifth Conference on Neural Information Processing Systems (NeurIPS 2021, December 6-14, 2021), accepted, 2021
     Last update: December 23, 2021
147. Donggyu Kim, Duksang Lee, and Sang-il Oum, Γ-graphic delta-matroids and their applications, In the Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC2021, December 6-8, 2021, Fukuoka, Japan), Article No. 70, pp. 70:1-70:13, 2021.
     doi:10.4230/LIPIcs.ISAAC.2021.70Last update: December 27, 2021
148. Marthe Bonamy, Linda Cook, Carla Groenland, and Alexandra Wesolek,  A tight local algorithm for the minimum dominating set problem in outerplanar graphs, 35th International Symposium on Distributed Computing (DISC 2021, October 4-8, 2021, Freiburg, Germany), Article No. 13; pp. 13:1-13:8, 2021.
     doi:10.4230/LIPIcs.DISC.2021.13 arXiv:2108.02697Last update: October 5, 2021
149. 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.
     doi:10.1007/978-3-030-75242-2_2 arXiv:2002.10859Last update: May 7, 2021
150. 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 Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA21, January 10-13, 2021, Online), pp. 1206-1225, 2021. Society for Industrial and Applied Mathematics.
     doi:10.1137/1.9781611976465.74 arXiv:2007.07862Last update: October 3, 2021
151. 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.
     doi:10.4230/LIPIcs.IPEC.2020.3 arXiv:2007.14179Last update: December 5, 2020
152. 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.
     doi:10.4230/LIPIcs.ISAAC.2020.62 arXiv:2009.00809Last update: March 1, 2021
153. 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.
     doi:10.4230/LIPIcs.MFCS.2020.5 arXiv:1911.04249Last update: August 18, 2020
154. 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.
     doi:10.1007/978-3-030-60440-0_12 arXiv:2002.10859Last update: December 5, 2020
155. 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_10Last update: April 25, 2020
156. 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_1Last update: April 25, 2020
157. Archontia Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, and O-joung Kwon, The Directed Flat Wall Theorem, In the Proceedings of the Thirty-First 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.15Last update: October 3, 2021