Papers

Preprints

  1. Sharing tea on a graph (with J. Pascal Gollin, Kevin Hendrey, Hao Huang, Tony Huynh, Bojan Mohar, Ningyuan Yang, Wei-Hsuan Yu, and Xuding Zhu), arXiv:2405.15353, 2024.
  2. Linear bounds on treewidth in terms of excluded planar minors (with J. Pascal Gollin, Kevin Hendrey, and Bruce Reed), arXiv:2402.17255, submitted, 2024.
  3. Computing piv0t-minors (with Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, and Daniël Paulusma), arXiv:2311.04656, submitted, 2023.
  4. Reuniting χ-boundedness with polynomial χ-boundedness (with Maria Chudnovsky, Linda Cook, and James Davies), arXiv:2310.11167, submitted, 2023.
  5. Clustered colouring of odd-H-minor-free graphs (with Robert Hickingbotham, Dong Yeap Kang, Raphael Steiner, and David R. Wood), submitted, 2023.
  6. Note on Hamiltonicity of basis graphs of even delta-matroids (with Donggyu Kim), arXiv:2308.05772, submitted, 2023.
  7. Space-efficient parameterized algorithms on graphs of low shrubdepth (with Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou M. Kanté, Matthias Mnich, Michał Pilipczuk, and Erik Jan van Leeuwen), arXiv:2307.01285, 2023. 
  8. Twin-width of subdivisions of multigraphs (with Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey), arXiv:2306.05334, submitted, 2023.
  9. 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), arXiv:2209.09488, submitted, 2022.
  10. 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), arXiv:2208.08330, submitted, 2022.
  11. Fragile minor-monotone parameters under random edge perturbation (with Dong Yeap Kang, Mihyun Kang, and Jaehoon Kim), arXiv:2005.09897, 2020.

My papers on arXiv

Journal Papers

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.21247 arXiv: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. 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.12858 arXiv:2102.01986 [open access]
  4. 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.103871 arXiv:2202.07877

2023

  1. Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k (with Mamadou M. 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.004 arXiv:2109.12291
  2. Rank connectivity and pivot-minors of graphs, European J. Combin., 108:103634, February 2023. https://doi.org/10.1016/j.ejc.2022.103634 arXiv:2011.03205
  3. 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.004 arXiv:2202.09594
  4. 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/22M1485073 arXiv:2106.03414
  5. 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.103761 arXiv:2110.10390
  6. A polynomial kernel for 3-leaf power deletion (with Jungho Ahn, Eduard Eiben, O-joung Kwon, Algorithmica, 85(10):3058-3087, October 2023. https://doi.org/10.1007/s00453-023-01129-9 arXiv:1911.04249 (An extended abstract appeared in MFCS 2020.)
  7. Γ-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-6 arXiv:2104.11383

2022

  1. 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/21M1452834 arXiv:2110.03957
  2. Obstructions for partitioning into forests and outerplanar graphs (with Ringi Kim and Sergey Norin), Discrete Appl. Math., 312:15-28, May 2022. https://doi.org/10.1016/j.dam.2020.09.006 [open access]
  3. 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.103476 arXiv:2007.13298
  4. 3-degenerate induced subgraphs of a planar graph (with Yangyan Gu, H. A. Kierstead, Hao Qi, and Xuding Zhu), J. Graph Theory, 99(2):251-277, February 2022. https://doi.org/10.1002/jgt.22740 arXiv:2002.07984

2021

  1. Tree pivot-minors and linear rank-width (with Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, and Daniël Paulusma), SIAM J. Discrete Math., 35(4), 2922-2945, December 2021. https://doi.org/10.1137/21M1402339 arXiv: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. https://doi.org/10.1137/19M1285895 arXiv:1711.01381 (An extended abstract appeared in ICALP 2018.)
  3. Obstructions for bounded branch-depth in matroids (with J. Pascal Gollin, Kevin Hendrey, and Dillon Mayhew), Adv. Comb., 2021:4, 25pp, May 2021. https://doi.org/10.19086/aic.24227 arXiv:2003.13975 [open access]
  4. The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor (with Jaehoon Kim), Electron. J. Combin., 28(April 2021), #P2.9. https://doi.org/10.37236/9536 arXiv:2003.12960
  5. 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.112351 arXiv:1907.09911
  6. Obstructions for bounded shrub-depth and rank-depth (with O-joung Kwon, Rose McCarty, and Paul Wollan), J. Combin. Theory Ser. B, 149(July 2021), 76-91, July 2021. https://doi.org/10.1016/j.jctb.2021.01.005
  7. Tangle-tree duality in abstract separation systems (with Reinhard Diestel), Adv. Math.,377(January 2021), 107470. https://doi.org/10.1016/j.aim.2020.107470 (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“.)
  8. Graphs of bounded depth-2 rank-brittleness (with O-joung Kwon), J. Graph Theory, 96(March 2021), 361-378. https://doi.org/10.1002/jgt.22619

2020

  1. Branch-depth: Generalizing tree-depth of graphs (with Matt DeVos and O-joung Kwon), European J. Combin., 90(December 2020), 103186. https://doi.org/10.1016/j.ejc.2020.103186 [open access]
  2. The average cut-rank of graphs (with Huy-Tung Nguyen), European J. Combin., 90(December 2020), 103183. https://doi.org/10.1016/j.ejc.2020.103183 [open access]
  3. Scattered classes of graphs (with O-joung Kwon), SIAM J. Discrete Math., 34(March 2020), no. 1, pp. 972-999. https://doi.org/10.1137/19M1293776
  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(January 2020), pp. 372-386. https://doi.org/10.1016/j.jctb.2019.06.001

2019

  1. Chi-boundedness of graph classes excluding wheel vertex-minors (with Hojin Choi, O-joung Kwon, and Paul Wollan), J. Combin. Theory Ser. B, 135(March 2019), pp. 319-348. https://doi.org/10.1016/j.jctb.2018.08.009
  2. Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (with Robert Brignall, Hojin Choi, Jisu Jeong), Discrete Applied Math., 257(March 2019), pp. 60-66. https://doi.org/10.1016/j.dam.2018.10.030
  3. Defective colouring of graphs excluding a subgraph or minor (with Patrice Ossona de Mendez and David R. Wood), Combinatorica, 39(2)(April 2019), pp. 377-410. https://doi.org/10.1007/s00493-018-3733-1
  4. Tangle-tree duality: in graphs, matroids and beyond (with Reinhard Diestel), Combinatorica, 39(August 2019), no. 4, pp. 879-910. https://doi.org/10.1007/s00493-019-3798-5
    (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“.)
  5. Improper colouring of graphs with no odd clique minor (with Dong Yeap Kang), Combin. Probab. Comput., 28(September 2019), no. 5, pp. 740-754. https://doi.org/10.1017/S0963548318000548
  6. Online Ramsey theory for a triangle on F-free graphs (with Hojin Choi, Ilkyoo Choi, and Jisu Jeong), J. Graph Theory, 92(October 2019), no. 2, pp. 152-171. https://doi.org/10.1002/jgt.22445

2018

  1. Vertex-minors and the Erdős-Hajnal conjecture (with Maria Chudnovsky), Discrete Math., 341(2018), pp. 3498-3499. https://doi.org/10.1016/j.disc.2018.09.007 arXiv:1804.11008
  2. 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. https://doi.org/10.1137/16M1106882
  3. A remark on the paper “Properties of intersecting families of ordered sets” by O. Einstein (with Sounggun Wee), Combinatorica, 38(October 2018), no 5., pp. 1279-1284. https://doi.org/10.1007/s00493-018-3812-3
  4. An FPT 2-approximation for tree-cut decomposition (with Eunjung Kim, Christophe Paul, Ignasi Sau, and Dimitrios M. Thilikos), Algorithmica, 80(January 2018), no. 1, pp. 116-135. https://doi.org/10.1007/s00453-016-0245-5
  5. Partitioning H-minor free graphs into three subgraphs with no large components (with Chun-Hung Liu), J. Combin. Theory Ser. B, 128(January 2018), pp. 114-133. https://doi.org/10.1016/j.jctb.2017.08.003

2017

  1. The “art of trellis decoding” is fixed-parameter tractable (with Jisu Jeong and Eun Jung Kim), IEEE Trans. Inform. Theory, 63(November 2017), no. 11, pp. 7178-7205. https://doi.org/10.1109/TIT.2017.2740283 (Previous title: constructive algorithm for path-width of matroids)
  2. Rank-width: algorithmic and structural results, Discrete Applied Math., 231(November 2017), pp. 15-24. https://doi.org/10.1016/j.dam.2016.08.006
  3. Even-cycle decompositions of graphs with no odd-K4-minor (with Tony Huynh and Maryam Verdian-Rizi), European J. Combin., 65(October 2017), pp. 1-14. https://doi.org/10.1016/j.ejc.2017.04.010
  4. Majority colouring of digraphs (with Stephan Kreutzer, Paul Seymour, Dominic van der Zypen, and David R. Wood), Electron. J. Combin., 24 (May 2017), #P2.25.
  5. Classification of real Bott manifolds and acyclic digraphs (with Suyoung Choi and Mikiya Masuda), Trans. Amer. Math. Soc., 369(April 2017), no. 4, pp. 2987-3011. https://doi.org/10.1090/tran/6896
  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(March 2017), pp. 126-147. https://doi.org/10.1016/j.jctb.2016.11.007
  7. Strongly even-cycle decomposable graphs (with Tony Huynh, Andrew D. King, and Maryam Verdian-Rizi), J. Graph Theory, 84(February 2017), no. 2, pp. 158-175. https://doi.org/10.1002/jgt.22018

2016

  1. Unavoidable induced subgraphs in large graphs with no homogeneous sets (with Maria Chudnovsky, Ringi Kim, and Paul Seymour), J. Combin. Theory Ser. B, 118(May 2016), pp. 1-12. https://doi.org/10.1016/j.jctb.2016.01.008
  2. Dynamic coloring of graphs having no K5 minor (with Younjin Kim and Sang June Lee), Discrete Applied Math., 206(June 2016), pp. 81-89. https://doi.org/10.1016/j.dam.2016.01.022

2015

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

2014

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

2012

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

2011

  1. Perfect Matchings in Claw-free Cubic Graphs, Electron. J. Combin., 18 (2011), #P62 (pp. 6)

2010

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

2009

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

2008

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

2007

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

2006

  1. Approximating Clique-width and Branch-width (with Paul Seymour). J. Combin. Theory Ser. B 96 (2006), no. 4, pp. 514-528. https://doi.org/10.1016/j.jctb.2005.10.006 (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)

2005

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

Ph.D. Thesis Paper

Refereed Conference Papers

  1. Space-efficient parameterized algorithms on graphs of low shrubdepth (with Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou M. Kanté, Matthias Mnich, Michał Pilipczuk, and Erik Jan van Leeuwen), 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, 2023. https://doi.org/10.4230/LIPIcs.ESA.2023.18
  2. Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k (with Mamadou M. 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, 2022. https://doi.org/10.4230/LIPIcs.STACS.2022.40
  3. Γ-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, 2021. https://doi.org/10.4230/LIPIcs.ISAAC.2021.70
  4. 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, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.5
  5. Computing small pivot-minors (with Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O- joung Kwon, and Daniel Paulusma), 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, 2018. https://doi.org/10.1007/978-3-030-00256-5_11
  6. 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, 2018. https://doi.org/10.4230/LIPIcs.ICALP.2018.80
  7. Constructive algorithm for path-width of matroids (with Jisu Jeong and Eunjung 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
  8. An FPT 2-approximation for tree-cut decomposition (with Eunjung 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
  9. Excluded vertex-minors for graphs of linear rank-width at most k (with Jisu Jeong, 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
  10. 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, 2012. https://doi.org/10.1007/978-3-642-31585-5_24
  11. 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, 2007. https://doi.org/10.1007/978-3-642-31585-5_24
  12. 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
  13. 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 Refereed Articles

  1. Branch-width and Tangles (with Illya V. Hicks), Wiley Encyclopedia of Operations Research and Management Sciences, 2011. https://doi.org/10.1002/9780470400531.eorms0121

Other Articles

  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

Manuscripts

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

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