Sang-il Oum

IBS Discrete Mathematics Group

Students & Postdocs

Students & Postdocs

Current Graduate Students

Current Postdocs

Former Graduate Students

Former Postdocs

Current position: Senior Research Fellow at the IBS Discrete Mathematics Group

Papers written by my students NOT coauthored with me

I am not a co-author of some of the papers of my students. Below, I try to list such papers.

Journal papers

Submitted

  1. Mujin Choi최무진, Claire Hilaire, Martin Milanic, and Sebastian Wiederrecht, Excluding an induced wheel minor in graphs without large induced stars, 2025.
    https://arxiv.org/abs/2506.08829
  2. Mujin Choi최무진, Maximilian Gorsky, Gunwoo Kim, Caleb McFarland, and Sebastian Wiederrecht, Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes, 2025.
    https://arxiv.org/abs/2511.10019
  3. Donggyu Kim김동규 and Hyunwoo Lee이현우, Reconstructing hypergraph matching polynomials, 2025.
    https://arxiv.org/abs/2501.19081
  4. Matthew Baker, Changxin Ding, and Donggyu Kim김동규, The Jacobian of a regular orthogonal matroid and torsor structures on spanning quasi-trees of ribbon graphs, 2025.
    https://arxiv.org/abs/2501.08796
  5. Seokbeom Kim김석범, Taite Lagrange, Mathieu Rundström, Arpan Sadhukhan, and Sophie Spirkl, The structure of Delta(1,2,2)-free tournaments, 2025.
    https://arxiv.org/abs/2511.03234
  6. Duksang Lee이덕상, Nam Ho-Nguyen, and Dabeen Lee이다빈, Non-smooth and Holder-smooth submodular maximization, 2023.
    https://arxiv.org/abs/2210.06061
  7. Jungho Ahn안정호, Jinha Kim김진하, and O-joung Kwon권오정, Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes, 2022.
    https://arxiv.org/abs/2207.06660

2025

  1. Tong Jin and Donggyu Kim김동규, Orthogonal matroids over tracts, Forum Math. Sigma, 13:e130, August 2025.
    https://doi.org/10.1017/fms.2025.10085https://arxiv.org/abs/2303.05353
  2. Donggyu Kim김동규, Baker-Bowler theory for Lagrangian Grassmannians, Int. Math. Res. Not. IMRN, 8:1-41, 2025.
    https://doi.org/10.1093/imrn/rnaf094https://arxiv.org/abs/2403.02356

2023

  1. Donggyu Kim김동규 and Suil O, Eigenvalues and parity factors in graphs, Discrete Math., 346:2021, 2023.
    https://doi.org/10.1016/j.disc.2022.113290https://arxiv.org/abs/2111.12966

2022

  1. Jungho Ahn안정호, Lars Jaffke, O-joung Kwon권오정, and Paloma T. Lima, Well-partitioned chordal graphs, Discrete Math., 345(10)(Article 112985), October 2022.
    https://doi.org/10.1016/j.disc.2022.112985https://arxiv.org/abs/2002.10859
  2. Jungho Ahn안정호, Eun Jung Kim김은정, and Euiwoong Lee이의웅, Towards constant-factor approximation for chordal / distance-hereditary vertex deletion, Algorithmica, 84:2106-2133, July 2022.
    https://doi.org/10.1007/s00453-022-00963-7https://arxiv.org/abs/2009.00809
  3. Martin Balko, Daniel Gerbner, Dong Yeap Kang강동엽, Younjin Kim김연진, and Cory Palmer, Hypergraph based Berge hypergraphs, Graphs and Combinatorics, 38:11, 1-13, February 2022.
    https://doi.org/10.1007/s00373-021-02419-1https://arxiv.org/abs/1908.00092

2021

  1. Dong Yeap Kang강동엽, Jaehoon Kim김재훈, and Hong Liu, On the rational Turan exponents conjecture, J. Combin. Theory Ser. B, 148:149-172, May 2021.
    https://doi.org/10.1016/j.jctb.2020.12.003https://arxiv.org/abs/1811.06916

2020

  1. Dong Yeap Kang강동엽 and Jaehoon Kim김재훈, On 1-factors with prescribed lengths in tournaments, J. Combin. Theory Ser. B, 141:31-71, March 2020.
    https://doi.org/10.1016/j.jctb.2019.06.003https://arxiv.org/abs/1802.09049

2019

  1. Dong Yeap Kang강동엽, Sparse highly connected spanning subgraphs in dense directed graphs, Combin. Probab. Comput., 28(3):423-464, May 2019.
    https://doi.org/10.1017/S0963548318000469https://arxiv.org/abs/1801.01795

2018

  1. Jisu Jeong정지수, Seongmin Ok옥성민, and Geewon Suh서기원, Characterizing graphs of maximum matching width at most 2, Discrete Appl. Math., 248:102-113, October 2018.
    https://doi.org/10.1016/j.dam.2017.07.028
  2. Jisu Jeong정지수, Sigve Hortemo Sæther, and Jan Arne Telle, Maximum matching width: new characterizations and a fast algorithm for dominating set, Discrete Appl. Math., 248:114-124, October 2018.
    https://doi.org/10.1016/j.dam.2017.09.019

2017

  1. Dong Yeap Kang강동엽, O-joung Kwon권오정, Torstein J. F. Strømme, and Jan Arne Telle, A width parameter useful for chordal and co-comparability graphs, Theoretical Computer Sci., 704:1-17, December 2017.
    https://doi.org/10.1016/j.tcs.2017.09.006
  2. Mamadou Moustapha Kanté, Eun Jung Kim김은정, O-joung Kwon권오정, and Christophe Paul, An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion, Algorithmica, 79(1):66-95, September 2017.
    https://doi.org/10.1007/s00453-016-0230-z
  3. Isolde Adler, Mamadou Moustapha Kanté, and O-joung Kwon권오정, Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm, Algorithmica, 78:342-377, May 2017.
    https://doi.org/10.1007/s00453-016-0164-5
  4. Hojin Choi최호진, Ilkyoo Choi최일규, Jisu Jeong정지수, and Geewon Suh서기원, (1,k)-coloring of graphs with girth at least 5 on a surface, J. Graph Theory, 84:521-535, April 2017.
    https://doi.org/10.1002/jgt.22039https://arxiv.org/abs/1412.0344
  5. Hans L. Bodlaender, Stefan Kratsch, Vincent Kreuzen, O-joung Kwon권오정, and Seongmin Ok옥성민, Characterizing width two for variants of treewidth, Discrete Appl. Math., 216:29-46, January 2017.
    https://doi.org/10.1016/j.dam.2015.01.015
  6. Hojin Choi최호진 and Young Soo Kwon, On t-common list-colorings, Electronic J. Combin., 24, #P3.32, 2017.
  7. Dong Yeap Kang강동엽, Jaehoon Kim김재훈, Younjin Kim김연진, and Hiu-Fai Law, On the number of r-matchings in a tree, Electronic J. Combin., 24, #P1.24, 2017.
    https://doi.org/10.37236/6681
  8. Dong Yeap Kang강동엽, Jaehoon Kim김재훈, Younjin Kim김연진, and Geewon Suh서기원, Sparse spanning k-connected subgraphs in tournaments, SIAM J. Discrete Math., 31(3):2206-2227, 2017.
    https://doi.org/10.1137/16M1064805

2016

  1. Petr Hliněný, O-joung Kwon권오정, Jan Obdržálek, and Sebastian Ordyniak, Tree-depth and vertex-minors, European J. Combin., 56:46-56, 2016.
    https://doi.org/10.1016/j.ejc.2016.03.001

2015

  1. Dong Yeap Kang강동엽, Jaehoon Kim김재훈, and Younjin Kim김연진, On the Erdos-Ko-Rado theorem and the Bollobas theorem for t-intersecting families, European J. Combin., 47:68-74, 2015.
    https://doi.org/10.1016/j.ejc.2015.01.009

Refereed Conference Papers

2025

  1. Mujin Choi최무진, Claire Hilaire, Martin Milanic, and Sebastian Wiederrecht, Excluding an induced wheel minor in graphs without large induced stars, WG 2025, In the Proceedings of the 51st International Workshop on Graph-Theoretic Concepts in Computer Science (WG2025, Otzenhausen, Germany, June 11-13), accepted, 2025. accepted.

2023

  1. Jungho Ahn안정호, Jinha Kim김진하, and O-joung Kwon권오정, Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes, ISAAC 2023, In the Proceedings of the 34th International Symposium on Algorithms and Computation (ISAAC 2023, Kyoto, Japan, December 3-6, 2023), 283:Art. no. 5, December 2023.
    https://doi.org/10.4230/LIPIcs.ISAAC.2023.5

2021

  1. Jungho Ahn안정호, Lars Jaffke, O-joung Kwon권오정, and Paloma T. Lima, Three problems on well-partitioned chordal graphs, CIAC 2021, 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.
    https://doi.org/10.1007/978-3-030-75242-2_2

2020

  1. Jungho Ahn안정호, Eun Jung Kim김은정, and Euiwoong Lee이의웅, Towards constant-factor approximation for chordal / distance-hereditary vertex deletion, ISAAC 2020, 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.
    https://doi.org/10.4230/LIPIcs.ISAAC.2020.62
  2. Jungho Ahn안정호, Lars Jaffke, O-joung Kwon권오정, and Paloma T. Lima, Well-partitioned chordal graphs: obstruction set and disjoint paths, WG 2020, 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.
    https://doi.org/10.1007/978-3-030-60440-0_12

2017

  1. Dong Yeap Kang강동엽, O-joung Kwon권오정, Torstein J. F. Strømme, and Jan Arne Telle, A width parameter useful for chordal and co-comparability graphs, WALCOM 2017, In S. H. Poon, M. Rahman, H. C. Yen, editors, WALCOM: Algorithms and Computations (Hsinchu, Taiwan, March 29-31, 2017), volume 10167 of Lecture Notes in Comput. Sci., pages 93-105, Springer, 2017.
    https://doi.org/10.1007/978-3-319-53925-6_8

2015

  1. Jisu Jeong정지수, Sigve Hortemo Sæther, and Jan Arne Telle, Maximum matching width: New characterizations and a fast algorithm for dominating set, IPEC 2015, In T. Husfeldt and I. Kanj, editors, 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), volume 43 of Leibniz International Proceedings in Informatics (LIPIcs), pages 212-223, Dagstuhl, Germany, 2015.
    https://doi.org/10.4230/LIPIcs.IPEC.2015.212

2014

  1. Isolde Adler, Mamadou Moustapha Kanté, and O-joung Kwon권오정, Linear rank-width of distance-hereditary graphs, WG 2014, In D. Kratsch and I. Todinca, editors, Graph-Theoretic Concepts in Computer Science: 40th International Workshop, WG 2014, volume 8747 of Lecture Notes in Comput. Sci., pages 42-55, Springer, 2014.
    https://doi.org/10.1007/978-3-319-12340-0_4