Papers

Preprints

1. Branch-width of connectivity functions is fixed-parameter tractable (with Tuukka Korhonen), 2026.
   https://arxiv.org/abs/2601.04756
2. Blind cop-width and balanced minors of graphs (with Hector Buffière, Rutger Campbell, and Kevin Hendrey), 2025.
   https://arxiv.org/abs/2511.22278
3. The Erdős-Pósa property for circle graphs as vertex-minors (with Rutger Campbell, J. Pascal Gollin, Meike Hatzel, O-joung Kwon^권오정, Rose McCarty, and Sebastian Wiederrecht), 2025.
   https://arxiv.org/abs/2506.03973
4. Unavoidable pivot-minors in graphs of large rank-depth (with Jungho Ahn^안정호, Kevin Hendrey, and O-joung Kwon^권오정), 2025.
   https://arxiv.org/abs/2507.12697
5. Colouring t-perfect graphs (with Maria Chudnovsky, Linda Cook, James Davies, and Jane Tan), 2024.
   https://arxiv.org/abs/2412.17735
6. Sharing tea on a graph (with J. Pascal Gollin, Kevin Hendrey, Hao Huang, Tony Huynh, Bojan Mohar, Wei-Hsuan Yu, Ningyuan Yang, and Xuding Zhu), 2024.
   https://arxiv.org/abs/2405.15353
7. Computing pivot-minors (with Konrad K. Dabrowski, François Dross, Mamadou Moustapha Kanté, O-joung Kwon^권오정, Daniël Paulusma, and Jisu Jeong^정지수), 2023.
   https://arxiv.org/abs/2311.04656

My papers on arXiv

Journal Papers

2026

1. Fragile minor-monotone parameters under random edge perturbation (with Dong Yeap Kang^강동엽, Mihyun Kang^강미현, and Jaehoon Kim^김재훈), European J. Combin., 133:104305, March 2026.
   https://doi.org/10.1016/j.ejc.2025.104305https://arxiv.org/abs/2005.09897
2. Reuniting χ-boundedness with polynomial χ-boundedness (with Maria Chudnovsky, Linda Cook, and James Davies), J. Combin. Theory Ser. B, 176:30-73, January 2026.
   https://doi.org/10.1016/j.jctb.2025.08.002https://arxiv.org/abs/2310.11167

2025

1. Linear bounds on treewidth in terms of excluded planar minors (with J. Pascal Gollin, Kevin Hendrey, and Bruce Reed), Electron. J. Combin., 32(4):P4.68, December 2025.
   https://doi.org/10.37236/12834https://arxiv.org/abs/2402.17255
2. The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs (with Jungho Ahn^안정호 and Seonghyuk Im^임성혁), Discrete Appl. Math., 377:10-17, December 2025.
   https://doi.org/10.1016/j.dam.2025.06.026https://arxiv.org/abs/2208.08330
3. A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups (with J. Pascal Gollin, Kevin Hendrey, O-joung Kwon^권오정, and Youngho Yoo^유영호), Math. Ann., 393:2507-2559, October 2025.
   https://doi.org/10.1007/s00208-025-03293-5https://arxiv.org/abs/2209.09488
4. Space-efficient parameterized algorithms on graphs of low shrubdepth (with Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Michał Pilipczuk, Erik Jan van Leeuwen, Benjamin Bergougnoux, and Matthias Mnich), ACM Trans. Comput. Theory, 17(3):1-42, September 2025.
   https://doi.org/10.1145/3723880https://arxiv.org/abs/2307.01285
5. Note on Hamiltonicity of basis graphs of even delta-matroids (with Donggyu Kim^김동규), J. Graph Theory, 109(4):446-453, August 2025.
   https://doi.org/10.1002/jgt.23237https://arxiv.org/abs/2308.05772
6. Clustered colouring of odd-H-minor-free graphs (with Robert Hickingbotham, Dong Yeap Kang^강동엽, Raphael Steiner, and David R. Wood), In: D. R. Wood, A. M. Etheridge, J. de Gier, N. Joshi (eds), 2023 MATRIX Annals. MATRIX Book Series, vol 6., pp. 73-80, Springer, July 2025.
   https://doi.org/10.1007/978-3-031-76738-8_4
7. Twin-width of subdivisions of multigraphs (with Jungho Ahn^안정호, Debsoumya Chakraborti, and Kevin Hendrey), SIAM J. Discrete Math., 39(2):607-862, 2025.
   https://doi.org/10.1137/23M1621514https://arxiv.org/abs/2306.05334

2024

1. Twin-width of random graphs (with Jungho Ahn^안정호, Debsoumya Chakraborti, Kevin Hendrey, and Donggyu Kim^김동규), Random Structures Algorithms, 65(4):794-831, December 2024.
   https://doi.org/10.1002/rsa.21247https://arxiv.org/abs/2212.07880
2. Vertex-minors of graphs: A survey (with Donggyu Kim^김동규), Discrete Appl. Math., 351:54-73, July 2024.
   https://doi.org/10.1016/j.dam.2024.03.011
3. Prime vertex-minors of a prime graph (with Donggyu Kim^김동규), European J. Combin., 118:103871, May 2024.
   https://doi.org/10.1016/j.ejc.2023.103871https://arxiv.org/abs/2202.07877
4. A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups (with J. Pascal Gollin, Kevin Hendrey, Ken-ichi Kawarabayashi^{河原林 健一}, and O-joung Kwon^권오정), J. Lon. Math. Soc., 109(1):e12858, January 2024.
   https://doi.org/10.1112/jlms.12858https://arxiv.org/abs/2102.01986

2023

1. A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors (with Duksang Lee^이덕상), European J. Combin., 113:103761, October 2023.
   https://doi.org/10.1016/j.ejc.2023.103761https://arxiv.org/abs/2110.10390
2. A polynomial kernel for 3-leaf power deletion (with Jungho Ahn^안정호, Eduard Eiben, and O-joung Kwon^권오정), Algorithmica, 85(10):3058-3087, October 2023. (An extended abstract appeared in MFCS 2020.).
   https://doi.org/10.1007/s00453-023-01129-9https://arxiv.org/abs/1911.04249
3. Γ-graphic delta-matroids and their applications (with Donggyu Kim^김동규 and Duksang Lee^이덕상), Combinatorica, 43(5):963-983, October 2023.
   https://doi.org/10.1007/s00493-023-00043-6https://arxiv.org/abs/2104.11383
4. Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k (with Mamadou Moustapha Kanté, Eun Jung Kim^김은정, and O-joung Kwon^권오정), J. Combin. Theory Ser. B, 160:15-35, May 2023.
   https://doi.org/10.1016/j.jctb.2022.12.004https://arxiv.org/abs/2109.12291
5. Rank connectivity and pivot-minors of graphs, European J. Combin., 108:103634, February 2023.
   https://doi.org/10.1016/j.ejc.2022.103634https://arxiv.org/abs/2011.03205
6. Independent domination of graphs with bounded maximum degree (with Eun-Kyung Cho^조은경, Jinha Kim^김진하, and Minki Kim^김민기), J. Combin. Theory Ser. B, 158:341-352, January 2023.
   https://doi.org/10.1016/j.jctb.2022.10.004https://arxiv.org/abs/2202.09594
7. Intertwining connectivities for vertex-minors and pivot-minors (with Duksang Lee^이덕상), SIAM J. Discrete Math., 37(1):304-314, 2023.
   https://doi.org/10.1137/22M1485073https://arxiv.org/abs/2106.03414

2022

1. Obstructions for partitioning into forests and outerplanar graphs (with Ringi Kim^김린기 and Sergey Norin), Discrete Appl. Math., 312:15-28, May 2022. [open access].
   https://doi.org/10.1016/j.dam.2020.09.006https://arxiv.org/abs/1903.08425
2. Characterizing matroids whose bases form graphic delta-matroids (with Duksang Lee^이덕상), European J. Combin., 101:103476, March 2022.
   https://doi.org/10.1016/j.ejc.2021.103476https://arxiv.org/abs/2007.13298
3. 3-degenerate induced subgraphs of a planar graph (with H. A. Kierstead, Xuding Zhu, Yangyan Gu, and Hao Qi), J. Graph Theory, 99(2):251-277, February 2022.
   https://doi.org/10.1002/jgt.22740https://arxiv.org/abs/2002.07984
4. Bounds for the twin-width of graphs (with Jungho Ahn^안정호, Kevin Hendrey, and Donggyu Kim^김동규), SIAM J. Discrete Math., 36(3):2352-2366, 2022.
   https://doi.org/10.1137/21M1452834https://arxiv.org/abs/2110.03957

2021

1. Tree pivot-minors and linear rank-width (with Konrad K. Dabrowski, François Dross, Mamadou Moustapha Kanté, O-joung Kwon^권오정, Daniël Paulusma, and Jisu Jeong^정지수), SIAM J. Discrete Math., 35(4), 2922-2945, December 2021.
   https://doi.org/10.1137/21M1402339https://arxiv.org/abs/2008.00561
2. Finding branch-decompositions of matroids, hypergraphs, and more (with Jisu Jeong^정지수 and Eun Jung Kim^김은정), SIAM J. Discrete Math., 35(4):2544-2617, November 2021. (An extended abstract appeared in ICALP 2018.).
   https://doi.org/10.4230/LIPIcs.ICALP.2018.80https://arxiv.org/abs/1711.01381
3. Obstructions for bounded shrub-depth and rank-depth (with O-joung Kwon^권오정, Rose McCarty, and Paul Wollan), J. Combin. Theory Ser. B, 149, 76-91, July 2021.
   https://doi.org/10.1016/j.jctb.2021.01.005https://arxiv.org/abs/1911.00230
4. Equitable partition of planar graphs (with Ringi Kim^김린기 and Xin Zhang), Discrete Math., 344(6):112351, June 2021.
   https://doi.org/10.1016/j.disc.2021.112351https://arxiv.org/abs/1907.09911
5. Obstructions for bounded branch-depth in matroids (with J. Pascal Gollin, Kevin Hendrey, and Dillon Mayhew), Adv. Comb., 2021:4, 25pp, May 2021. [open access].
   https://doi.org/10.19086/aic.24227https://arxiv.org/abs/2003.13975
6. The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor (with Jaehoon Kim^김재훈), Electron. J. Combin., 28, #P2.9, April 2021.
   https://doi.org/10.37236/9536https://arxiv.org/abs/2003.12960
7. Graphs of bounded depth-2 rank-brittleness (with O-joung Kwon^권오정), J. Graph Theory, 96, 361-378, March 2021.
   https://doi.org/10.1002/jgt.22619https://arxiv.org/abs/1906.05753
8. Tangle-tree duality in abstract separation systems (with Reinhard Diestel), Adv. Math., 377, 107470, January 2021. (This is an updated version of the first half of a manuscript “Unifying duality theorems for width parameters in graphs and matroids. I. Weak and strong duality“.).
   https://doi.org/10.1016/j.aim.2020.107470https://arxiv.org/abs/1701.02509

2020

1. Branch-depth: Generalizing tree-depth of graphs (with Matt DeVos and O-joung Kwon^권오정), European J. Combin., 90, 103186, December 2020. [open access].
   https://doi.org/10.1016/j.ejc.2020.103186https://arxiv.org/abs/1903.11988
2. The average cut-rank of graphs (with Tung H. Nguyen), European J. Combin., 90, 103183, December 2020. [open access].
   https://doi.org/10.1016/j.ejc.2020.103183https://arxiv.org/abs/1906.02895
3. Scattered classes of graphs (with O-joung Kwon^권오정), SIAM J. Discrete Math., 34, no. 1, pp. 972-999, March 2020.
   https://doi.org/10.1137/19M1293776https://arxiv.org/abs/1801.06004
4. Classes of graphs with no long cycle as a vertex-minor are polynomially 𝜒-bounded (with Ringi Kim^김린기, O-joung Kwon^권오정, and Vaidy Sivaraman), J. Combin. Theory Ser. B, 140, pp. 372-386, January 2020.
   https://doi.org/10.1016/j.jctb.2019.06.001https://arxiv.org/abs/1809.04278

2019

1. Online Ramsey theory for a triangle on F-free graphs (with Hojin Choi^최호진, Ilkyoo Choi^최일규, and Jisu Jeong^정지수), J. Graph Theory, 92, no. 2, pp. 152-171, October 2019.
   https://doi.org/10.1002/jgt.22445https://arxiv.org/abs/1901.03009
2. Improper colouring of graphs with no odd clique minor (with Dong Yeap Kang^강동엽), Combin. Probab. Comput., 28, no. 5, pp. 740-754, September 2019.
   https://doi.org/10.1017/S0963548318000548https://arxiv.org/abs/1612.05372
3. Tangle-tree duality: in graphs, matroids and beyond (with Reinhard Diestel), Combinatorica, 39, no. 4, pp. 879-910, August 2019. (This is an updated version of the second half of a manuscript “Unifying duality theorems for width parameters in graphs and matroids. I. Weak and strong duality“.).
   https://doi.org/10.1007/s00493-019-3798-5https://arxiv.org/abs/1701.02651
4. Defective colouring of graphs excluding a subgraph or minor (with Patrice Ossona de Mendez and David R. Wood), Combinatorica, 39(2), pp. 377-410, April 2019.
   https://doi.org/10.1007/s00493-018-3733-1https://arxiv.org/abs/1611.09060
5. Chi-boundedness of graph classes excluding wheel vertex-minors (with O-joung Kwon^권오정, Paul Wollan, and Hojin Choi^최호진), J. Combin. Theory Ser. B, 135, pp. 319-348, March 2019.
   https://doi.org/10.1016/j.jctb.2018.08.009https://arxiv.org/abs/1702.07851
6. Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (with Robert Brignall, Hojin Choi^최호진, and Jisu Jeong^정지수), Discrete Applied Math., 257, pp. 60-66, March 2019.
   https://doi.org/10.1016/j.dam.2018.10.030https://arxiv.org/abs/1607.06864

2018

1. A remark on the paper “Properties of intersecting families of ordered sets” by O. Einstein (with Sounggun Wee^위성군), Combinatorica, 38, no 5., pp. 1279-1284, October 2018.
   https://doi.org/10.1007/s00493-018-3812-3https://arxiv.org/abs/1705.10947
2. An FPT 2-approximation for tree-cut decomposition (with Eun Jung Kim^김은정, Christophe Paul, Ignasi Sau, and Dimitrios M. Thilikos), Algorithmica, 80, no. 1, pp. 116-135, January 2018.
   https://doi.org/10.1007/s00453-016-0245-5https://arxiv.org/abs/1509.04880
3. Partitioning H-minor free graphs into three subgraphs with no large components (with Chun-Hung Liu), J. Combin. Theory Ser. B, 128, pp. 114-133, January 2018.
   https://doi.org/10.1016/j.jctb.2017.08.003https://arxiv.org/abs/1503.08371
4. Characterization of cycle obstruction sets for improper coloring planar graphs (with Ilkyoo Choi^최일규 and Chun-Hung Liu), SIAM J. Discrete Math., **32(**2018), no. 2, pp. 1209-1228, 2018.
   https://doi.org/10.1137/16M1106882https://arxiv.org/abs/1806.06212
5. Vertex-minors and the Erdős-Hajnal conjecture (with Maria Chudnovsky), Discrete Math., 341, pp. 3498-3499, 2018.
   https://doi.org/10.1016/j.disc.2018.09.007https://arxiv.org/abs/1804.11008

2017

1. Rank-width: algorithmic and structural results, Discrete Applied Math., 231, pp. 15-24, November 2017.
   https://doi.org/10.1016/j.dam.2016.08.006https://arxiv.org/abs/1601.03800
2. The “art of trellis decoding” is fixed-parameter tractable (with Jisu Jeong^정지수 and Eun Jung Kim^김은정), IEEE Trans. Inform. Theory, 63, no. 11, pp. 7178-7205. (Previous title: constructive algorithm for path-width of matroids), November 2017.
   https://doi.org/10.1109/TIT.2017.2740283https://arxiv.org/abs/1507.02184
3. Even-cycle decompositions of graphs with no odd-K₄-minor (with Tony Huynh and Maryam Verdian-Rizi), European J. Combin., 65, pp. 1-14, October 2017.
   https://doi.org/10.1016/j.ejc.2017.04.010https://arxiv.org/abs/1211.1868
4. Majority colouring of digraphs (with Stephan Kreutzer, Paul Seymour, David R. Wood, and Dominic van der Zypen), Electron. J. Combin., 24, #P2.25, May 2017.
   https://doi.org/10.37236/6410https://arxiv.org/abs/1608.03040
5. Classification of real Bott manifolds and acyclic digraphs (with Suyoung Choi^최수영 and Mikiya Masuda), Trans. Amer. Math. Soc., 369, no. 4, pp. 2987-3011, April 2017.
   https://doi.org/10.1090/tran/6896https://arxiv.org/abs/1006.4658
6. Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (with Ilkyoo Choi^최일규 and O-joung Kwon^권오정), J. Combin. Theory Ser. B, 123, pp. 126-147, March 2017.
   https://doi.org/10.1016/j.jctb.2016.11.007https://arxiv.org/abs/1512.03481
7. Strongly even-cycle decomposable graphs (with Tony Huynh, Andrew D. King, and Maryam Verdian-Rizi), J. Graph Theory, 84, no. 2, pp. 158-175, February 2017.
   https://doi.org/10.1002/jgt.22018https://arxiv.org/abs/1209.0160

2016

1. Dynamic coloring of graphs having no K₅ minor (with Younjin Kim^김연진 and Sang June Lee^이상준), Discrete Applied Math., 206, pp. 81-89, June 2016.
   https://doi.org/10.1016/j.dam.2016.01.022https://arxiv.org/abs/1210.2142
2. Unavoidable induced subgraphs in large graphs with no homogeneous sets (with Maria Chudnovsky, Ringi Kim^김린기, and Paul Seymour), J. Combin. Theory Ser. B, 118, pp. 1-12, May 2016.
   https://doi.org/10.1016/j.jctb.2016.01.008https://arxiv.org/abs/1504.05322

2015

1. Number of cliques in graphs with a forbidden subdivision (with Choongbum Lee^이중범), SIAM J. Discrete Math., 29, no. 4, pp. 1999-2005, October 2015.
   https://doi.org/10.1137/140979988https://arxiv.org/abs/1407.7707
2. A relative of Hadwiger’s conjecture (with Katherine Edwards, Dong Yeap Kang^강동엽, Jaehoon Kim^김재훈, and Paul Seymour), SIAM J. Discrete Math., 29, no. 4, pp. 2385–2388, 2015.
   https://doi.org/10.1137/141002177https://arxiv.org/abs/1407.5236

2014

1. Hyperbolic surface subgroups of one-ended doubles of free groups (with Sang-hyun Kim^김상현), J. Topology, 7, no. 4, pp. 927-947, December 2014.
   https://doi.org/10.1112/jtopol/jtu004https://arxiv.org/abs/1009.3820
2. Excluded vertex-minors for graphs of linear rank-width at most k (with Jisu Jeong^정지수 and O-joung Kwon^권오정), European J. Combin., 41, pp. 242-257, October 2014.
   https://doi.org/10.1016/j.ejc.2014.04.010https://arxiv.org/abs/1311.2618
3. Unavoidable vertex-minors in large prime graphs (with O-joung Kwon^권오정), European J. Combin., 41, pp. 100-127, October 2014.
   https://doi.org/10.1016/j.ejc.2014.03.013https://arxiv.org/abs/1306.3066
4. Faster algorithms for vertex partitioning problems parameterized by clique-width (with Sigve Hortemo Sæther and Martin Vatshelle), Theoret. Comput. Sci., 535, pp. 16-24, May 2014.
   https://doi.org/10.1016/j.tcs.2014.03.024https://arxiv.org/abs/1311.0224
5. Graphs of small rank-width are pivot-minors of graphs of small tree-width (with O-joung Kwon^권오정), Discrete Applied Math., 168, pp. 108-118, May 2014.
   https://doi.org/10.1016/j.dam.2013.01.007https://arxiv.org/abs/1203.3606

2012

1. Rank-width of Random Graphs (with Choongbum Lee^이중범 and Joonkyung Lee^이준경), J. Graph Theory, 70, no. 3, pp. 339-347, July 2012.
   https://doi.org/10.1002/jgt.20620https://arxiv.org/abs/1001.0461
2. Finding minimum clique capacity (with Maria Chudnovsky and Paul Seymour), Combinatorica, 32, no. 3, pp. 283-287, April 2012.
   https://doi.org/10.1007/s00493-012-2891-9
3. Rank-width and Well-quasi-ordering of skew-symmetric or symmetric matrices, Linear Algebra Appl., 436(April 1, 2012), no. 7, pp. 2008-2036, April 2012.
   https://doi.org/10.1016/j.laa.2011.09.027https://arxiv.org/abs/1007.3807

2011

1. Perfect Matchings in Claw-free Cubic Graphs, Electron. J. Combin., 18, #P62 (pp. 6), 2011.
   https://doi.org/10.37236/549https://arxiv.org/abs/0906.2261

2010

1. Rank-width and tree-width of H-minor-free graphs (with Fedor V. Fomin and Dimitrios M. Thilikos), European J. Combin., 31, no. 7, pp. 1617-1628, 2010.
   https://doi.org/10.1016/j.ejc.2010.05.003https://arxiv.org/abs/0910.0079

2009

1. Circle Graph Obstructions under Pivoting (with Jim Geelen), J. Graph Theory, 61, no. 1, pp. 1-11, 2009.
   https://doi.org/10.1002/jgt.20363
2. Computing rank-width exactly, Information Proc. Letters, 109, no. 13, pp. 745-748, 2009.
   https://doi.org/10.1016/j.ipl.2009.03.018
3. Excluding a Bipartite Circle Graph from Line Graphs, J. Graph Theory, 60, no. 3, pp. 183-203, 2009.
   https://doi.org/10.1002/jgt.20353

2008

1. Approximating rank-width and clique-width quickly, ACM Trans. Algorithms, 5. no. 1, Art. No. 10, 2008.
   https://doi.org/10.1145/1435375.1435385
2. Finding Branch-decompositions and Rank-decompositions (with Petr Hliněný), SIAM J. Comput., 38, no. 3, pp. 1012-1032, 2008.
   https://doi.org/10.1137/070685920
3. Rank-width and Well-quasi-ordering, SIAM J. Discrete Math., 22, no. 2, pp. 666-682, 2008.
   https://doi.org/10.1137/050629616
4. Rank-width is less than or equal to branch-width, J. Graph Theory, 57, no. 3, pp. 239-244, 2008.
   https://doi.org/10.1002/jgt.20280
5. Width Parameters Beyond Tree-width and Their Applications (with Petr Hliněný, Detlef Seese, and Georg Gottlob), The Computer Journal, 51, no. 3, pp. 326-362, 2008.
   https://doi.org/10.1093/comjnl/bxm052

2007

1. Testing Branch-width (with Paul Seymour), J. Combin. Theory Ser. B, 97, no. 3, pp. 385-393., 2007. Corrigendum to our paper “Testing branch-width”.
   https://doi.org/10.1016/j.jctb.2006.06.006
2. Vertex-Minors, Monadic Second-Order Logic, and a Conjecture by Seese (with Bruno Courcelle), J. Combin. Theory Ser. B, 97, no. 1, pp. 91-126, 2007.
   https://doi.org/10.1016/j.jctb.2006.04.003

2006

1. Approximating Clique-width and Branch-width (with Paul Seymour), J. Combin. Theory Ser. B, 96, no. 4, pp. 514-528., 2006. (the 9th in the most downloaded papers between Jan-Mar 2006 from JCT B) (In the list of classic papers in Discrete Mathematics of 2006 by Google Scholar).
   https://doi.org/10.1016/j.jctb.2005.10.006

2005

1. Rank-width and Vertex-minors, J. Combin. Theory Ser. B, 95, no. 1, pp. 79-100, 2005. Corrigendum to: “Rank-width and vertex-minors”, 2009. (the 9th in the most downloaded papers between Jul-Sep 2005 from JCT B).
   https://doi.org/10.1016/j.jctb.2005.03.003

Ph.D. Thesis

1. Graphs of Bounded Rank-width, Princeton University, 2005.

Conference Papers

2023

1. Space-efficient parameterized algorithms on graphs of low shrubdepth (with Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Michał Pilipczuk, Erik Jan van Leeuwen, Benjamin Bergougnoux, and Matthias Mnich), In the Proceedings of the 31st Annual European Symposium on Algorithms (ESA 2023, Amsterdam, Netherlands, September 4-6, 2023), Article No. 18; pp. 18:1-18:8, September 2023.
   https://doi.org/10.4230/LIPIcs.ESA.2023.18

2022

1. Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k (with Mamadou Moustapha Kanté, Eun Jung Kim^김은정, and O-joung Kwon^권오정), 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, March 2022.
   https://doi.org/10.4230/LIPIcs.STACS.2022.40

2021

1. Γ-graphic delta-matroids and their applications (with Donggyu Kim^김동규 and Duksang Lee^이덕상), 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, December 2021.
   https://doi.org/10.4230/LIPIcs.ISAAC.2021.70

2020

1. A polynomial kernel for 3-leaf power deletion (with Jungho Ahn^안정호, Eduard Eiben, and O-joung Kwon^권오정), 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, August 2020.
   https://doi.org/10.4230/LIPIcs.MFCS.2020.5

2018

1. Finding branch-decompositions of matroids, hypergraphs, and more (with Jisu Jeong^정지수 and Eun Jung Kim^김은정), In the Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP2018), Prague, Czech Republic, July 9-13, 2018, Leibniz International Proceedings in Informatics (LIPIcs), Vol. 107, pp. 80:1-80:14, July 2018.
   https://doi.org/10.4230/LIPIcs.ICALP.2018.80
2. Computing small pivot-minors (with Konrad K. Dabrowski, Jisu Jeong^정지수, Mamadou Moustapha Kanté, O-joung Kwon^권오정, Daniël Paulusma, and François Dross), In the Proceedings of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science (WG2018, Cottbus, Germany, June 27-29, 2018), Lecture Notes in Comput. Sci., vol 11159, pp. 125-138, June 2018.
   https://doi.org/10.1007/978-3-030-00256-5_11

2016

1. An FPT 2-approximation for tree-cut decomposition (with Eun Jung Kim^김은정, Christophe Paul, Ignasi Sau, and Dimitrios M. Thilikos), In the Proceedings of the 13th Workshop on Approximation and Online Algorithms (WAOA 2015), pp 35-46, 2016.
   https://doi.org/10.1007/978-3-319-28684-6_4
2. Constructive algorithm for path-width of matroids (with Jisu Jeong^정지수 and Eun Jung Kim^김은정), In the Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA2016, Arlington, VA, 2016). pp. 1695-1704, 2016.
   https://doi.org/10.1137/1.9781611974331.ch116

2013

1. Excluded vertex-minors for graphs of linear rank-width at most k (with Jisu Jeong^정지수 and O-joung Kwon^권오정), In the Proceedings of the 30th Symposium on Theoretical Aspects of Computer Science (STACS’13), Kiel, Germany, Feb. 27-Mar. 02, 2013, Leibniz International Proceedings in Informatics (LIPIcs), Vol. 20, pp. 221-232, 2013.
   https://doi.org/10.4230/LIPIcs.STACS.2013.221

2012

1. Deciding first order logic properties of matroids (with Tomáš Gavenčiak and Daniel Kráľ), In the Proceedings of the 39th International Colloquium on Automata, Languages, and Programming (ICALP 2012), Warwick, UK, July 9-13, 2012, Part II, Lecture Notes in Comput. Sci., Vol. 7392, pp. 239-250, July 2012.
   https://doi.org/10.1007/978-3-642-31585-5_24

2007

1. Finding Branch-decompositions and Rank-decompositions (with Petr Hliněný), In the Proceedings of the 15th Annual European Symposium on Algorithms (ESA 2007, Eilat, Israel, October 8-10, 2007), Lecture Notes in Comput. Sci., vol 4698, pp. 163-174, October 2007.
   https://doi.org/10.1007/978-3-642-31585-5_24

2006

1. Certifying Large Branch-width (with Paul Seymour), In the Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (Miami, FL, 2006). SODA ’06. ACM, New York, pp. 810-813, 2006.
   https://doi.org/10.1145/1109557.1109646

2005

1. Approximating Rank-width and Clique-width Quickly, 31st International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Comput. Sci., vol 3787, pp. 49-58, 2005.
   https://doi.org/10.1007/11604686_5

Other

1. Unifying duality theorems for width parameters in graphs and matroids (with Reinhard Diestel), 40th International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Comput. Sci., vol 8747, pp. 1-14, 2014.
   https://doi.org/10.1007/978-3-319-12340-0_1
2. Branch-width and Tangles (with Illya V. Hicks), Wiley Encyclopedia of Operations Research and Management Sciences, 2011.
   https://doi.org/10.1002/9780470400531.eorms0121

Manuscripts

1. An upper bound on tricolored ordered sum-free sets (with Taegyun Kim^김태균), 2017.
   https://arxiv.org/abs/1708.07263
2. Unifying duality theorems for width parameters in graphs and matroids. II. General duality (with Reinhard Diestel), 2014.
   https://arxiv.org/abs/1406.3798
3. Deciding first order logic properties of matroids (with Tomáš Gavenčiak and Daniel Kráľ), 2011.
   https://arxiv.org/abs/1108.5457
4. Injective Chromatic Number and Chromatic Number of the Square of Graphs (with Seog-Jin Kim^김석진), manuscript, 2009., 2011.

AMS MathSciNet Author ID: 765385
Scopus Author ID: 55912957400
ResearchID: C-1692-2011
Google Scholar