Sang-il Oum - RankMe

118 papers A* 5A 4B 7Journal 101Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Branch-width of connectivity functions is fixed-parameter tractable. CoRR Tuukka Korhonen, Sang-il Oum
2026	J	`jnl`	Fragile minor-monotone parameters under a random edge perturbation. Eur. J. Comb. Dong Yeap Kang, Mihyun Kang, Jaehoon Kim, Sang-il Oum
2026	J	`jnl`	Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions. CoRR Sang-il Oum, Marek Sokolowski
2026	J	`jnl`	Reuniting χ-boundedness with polynomial χ-boundedness. J. Comb. Theory B Maria Chudnovsky, Linda Cook, James Davies, Sang-il Oum
2026	A*	`conf`	The Erdős-Pósa property for circle graphs as vertex-minors. SODA Rutger Campbell, Jochen Pascal Gollin, Meike Hatzel, O-joung Kwon, Rose McCarty, Sang-il Oum, Sebastian Wiederrecht
2025	J	`jnl`	Linear Bounds on Treewidth in Terms of Excluded Planar Minors. Electron. J. Comb. Jochen Pascal Gollin, Kevin Hendrey, Sang-il Oum, Bruce Reed
2025	J	`jnl`	Note on Hamiltonicity of Basis Graphs of Even Delta-Matroids. J. Graph Theory Donggyu Kim, Sang-il Oum
2025	A*	`conf`	Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-Width. LICS Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, Sang-il Oum
2025	J	`jnl`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ACM Trans. Comput. Theory Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2025	J	`jnl`	The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs. Discret. Appl. Math. Jungho Ahn, Seonghyuk Im, Sang-il Oum
2025	J	`jnl`	Twin-Width of Subdivisions of Multigraphs. SIAM J. Discret. Math. Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Sang-il Oum
2024	J	`jnl`	Colouring t-perfect graphs. CoRR Maria Chudnovsky, Linda Cook, James Davies, Sang-il Oum, Jane Tan
2024	J	`jnl`	Prime vertex-minors of a prime graph. Eur. J. Comb. Donggyu Kim, Sang-il Oum
2024	J	`jnl`	Twin-width of random graphs. Random Struct. Algorithms Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Donggyu Kim, Sang-il Oum
2024	J	`jnl`	Vertex-minors of graphs: A survey. Discret. Appl. Math. Donggyu Kim, Sang-il Oum
2023	J	`jnl`	A Polynomial Kernel for 3-Leaf Power Deletion. Algorithmica Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
2023	J	`jnl`	A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors. Eur. J. Comb. Duksang Lee, Sang-il Oum
2023	J	`jnl`	Computing pivot-minors. CoRR Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
2023	J	`jnl`	Independent domination of graphs with bounded maximum degree. J. Comb. Theory B Eun-Kyung Cho, Jinha Kim, Minki Kim, Sang-il Oum
2023	J	`jnl`	Intertwining Connectivities for Vertex-Minors and Pivot-Minors. SIAM J. Discret. Math. Duksang Lee, Sang-il Oum
2023	J	`jnl`	Obstructions for matroids of path-width at most J. Comb. Theory B Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum
2023	J	`jnl`	Rank connectivity and pivot-minors of graphs. Eur. J. Comb. Sang-il Oum
2023	J	`jnl`	Reuniting χ-boundedness with polynomial χ-boundedness. CoRR Maria Chudnovsky, Linda Cook, James Davies, Sang-il Oum
2023	A	`conf`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2023	J	`jnl`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2023	J	`jnl`	Twin-width of subdivisions of multigraphs. CoRR Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Sang-il Oum
2023	J	`jnl`	Γ-Graphic Delta-Matroids and Their Applications. Comb. Donggyu Kim, Duksang Lee, Sang-il Oum
2022	J	`jnl`	3-Degenerate induced subgraph of a planar graph. J. Graph Theory Yangyan Gu, Hal A. Kierstead, Sang-il Oum, Hao Qi, Xuding Zhu
2022	J	`jnl`	Bounds for the Twin-Width of Graphs. SIAM J. Discret. Math. Jungho Ahn, Kevin Hendrey, Donggyu Kim, Sang-il Oum
2022	J	`jnl`	Characterizing matroids whose bases form graphic delta-matroids. Eur. J. Comb. Duksang Lee, Sang-il Oum
2022	A	`conf`	Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. STACS Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum
2022	J	`jnl`	Obstructions for partitioning into forests and outerplanar graphs. Discret. Appl. Math. Ringi Kim, Sergey Norin, Sang-il Oum
2022	J	`jnl`	The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs. CoRR Jungho Ahn, Seonghyuk Im, Sang-il Oum
2022	J	`jnl`	Twin-width of random graphs. CoRR Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Donggyu Kim, Sang-il Oum
2021	J	`jnl`	Bounds for the Twin-width of Graphs. CoRR Jungho Ahn, Kevin Hendrey, Donggyu Kim, Sang-il Oum
2021	J	`jnl`	Equitable partition of planar graphs. Discret. Math. Ringi Kim, Sang-il Oum, Xin Zhang
2021	J	`jnl`	Finding Branch-Decompositions of Matroids, Hypergraphs, and More. SIAM J. Discret. Math. Jisu Jeong, Eun Jung Kim, Sang-il Oum
2021	J	`jnl`	Graphs of bounded depth-2 rank-brittleness. J. Graph Theory O-joung Kwon, Sang-il Oum
2021	J	`jnl`	Obstructions for bounded shrub-depth and rank-depth. J. Comb. Theory B O-joung Kwon, Rose McCarty, Sang-il Oum, Paul Wollan
2021	J	`jnl`	The Erdős-Hajnal Property for Graphs with No Fixed Cycle as a Pivot-Minor. Electron. J. Comb. Jaehoon Kim, Sang-il Oum
2021	J	`jnl`	Tree Pivot-Minors and Linear Rank-Width. SIAM J. Discret. Math. Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
2021	B	`conf`	Γ-Graphic Delta-Matroids and Their Applications. ISAAC Donggyu Kim, Duksang Lee, Sang-il Oum
2020	B	`conf`	A Polynomial Kernel for 3-Leaf Power Deletion. MFCS Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
2020	J	`jnl`	Branch-depth: Generalizing tree-depth of graphs. Eur. J. Comb. Matt DeVos, O-joung Kwon, Sang-il Oum
2020	J	`jnl`	Classes of graphs with no long cycle as a vertex-minor are polynomially J. Comb. Theory, Ser. B Ringi Kim, O-joung Kwon, Sang-il Oum, Vaidy Sivaraman
2020	B	`conf`	How to Decompose a Graph into a Tree-Like Structure (Invited Talk). ISAAC Sang-il Oum
2020	J	`jnl`	Scattered Classes of Graphs. SIAM J. Discret. Math. O-joung Kwon, Sang-il Oum
2020	J	`jnl`	The average cut-rank of graphs. Eur. J. Comb. Huy-Trung Nguyen, Sang-il Oum
2020	J	`jnl`	Tree pivot-minors and linear rank-width. CoRR Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
2019	J	`jnl`	A polynomial kernel for $3$-leaf power deletion. CoRR Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
2019	J	`jnl`	Chi-boundedness of graph classes excluding wheel vertex-minors. J. Comb. Theory B Ho-Jin Choi, O-joung Kwon, Sang-il Oum, Paul Wollan
2019	J	`jnl`	Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs. Discret. Appl. Math. Robert Brignall, Ho-Jin Choi, Jisu Jeong, Sang-il Oum
2019	J	`jnl`	Defective Colouring of Graphs Excluding A Subgraph or Minor. Comb. Patrice Ossona de Mendez, Sang-il Oum, David R. Wood
2019	J	`jnl`	Improper colouring of graphs with no odd clique minor. Comb. Probab. Comput. Dong Yeap Kang, Sang-il Oum
2019	J	`jnl`	Obstructions for bounded shrub-depth and rank-depth. CoRR O-joung Kwon, Rose McCarty, Sang-il Oum, Paul Wollan
2019	J	`jnl`	Online Ramsey theory for a triangle on -free graphs. J. Graph Theory Ho-Jin Choi, Ilkyoo Choi, Jisu Jeong, Sang-il Oum
2019	J	`jnl`	Tangle-Tree Duality: In Graphs, Matroids and Beyond. Comb. Reinhard Diestel, Sang-il Oum
2018	J	`jnl`	A Remark on the Paper "Properties of Intersecting Families of Ordered Sets" by O. Einstein. Comb. Sang-il Oum, Sounggun Wee
2018	J	`jnl`	An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica Eun Jung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2018	J	`jnl`	Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs. SIAM J. Discret. Math. Ilkyoo Choi, Chun-Hung Liu, Sang-il Oum
2018	J	`jnl`	Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded. CoRR Ringi Kim, O-joung Kwon, Sang-il Oum, Vaidy Sivaraman
2018	B	`conf`	Computing Small Pivot-Minors. WG Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
2018	A*	`conf`	Finding Branch-Decompositions of Matroids, Hypergraphs, and More. ICALP Jisu Jeong, Eun Jung Kim, Sang-il Oum
2018	J	`jnl`	Partitioning J. Comb. Theory B Chun-Hung Liu, Sang-il Oum
2018	J	`jnl`	Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015. Discret. Appl. Math. Derek G. Corneil, Sang-il Oum, Christophe Paul
2018	J	`jnl`	Vertex-minors and the Erdős-Hajnal conjecture. Discret. Math. Maria Chudnovsky, Sang-il Oum
2017	J	`jnl`	Chi-boundedness of graph classes excluding wheel vertex-minors. Electron. Notes Discret. Math. Ho-Jin Choi, O-joung Kwon, Sang-il Oum, Paul Wollan
2017	J	`jnl`	Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors. J. Comb. Theory B Ilkyoo Choi, O-joung Kwon, Sang-il Oum
2017	J	`jnl`	Even-cycle decompositions of graphs with no odd-K Eur. J. Comb. Tony Huynh, Sang-il Oum, Maryam Verdian-Rizi
2017	J	`jnl`	Finding branch-decompositions of matroids, hypergraphs, and more. CoRR Jisu Jeong, Eun Jung Kim, Sang-il Oum
2017	J	`jnl`	Majority Colourings of Digraphs. Electron. J. Comb. Stephan Kreutzer, Sang-il Oum, Paul D. Seymour, Dominic van der Zypen, David R. Wood
2017	J	`jnl`	Rank-width: Algorithmic and structural results. Discret. Appl. Math. Sang-il Oum
2017	J	`jnl`	Strongly Even-Cycle Decomposable Graphs. J. Graph Theory Tony Huynh, Andrew D. King, Sang-il Oum, Maryam Verdian-Rizi
2017	J	`jnl`	The "Art of Trellis Decoding" Is Fixed-Parameter Tractable. IEEE Trans. Inf. Theory Jisu Jeong, Eun Jung Kim, Sang-il Oum
2016	A*	`conf`	Constructive algorithm for path-width of matroids. SODA Jisu Jeong, Eun Jung Kim, Sang-il Oum
2016	J	`jnl`	Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs. CoRR Robert Brignall, Ho-Jin Choi, Jisu Jeong, Sang-il Oum
2016	J	`jnl`	Dynamic coloring of graphs having no K Discret. Appl. Math. Younjin Kim, Sangjune Lee, Sang-il Oum
2016	J	`jnl`	Rank-width: Algorithmic and structural results. CoRR Sang-il Oum
2016	J	`jnl`	Unavoidable induced subgraphs in large graphs with no homogeneous sets. J. Comb. Theory B Maria Chudnovsky, Ringi Kim, Sang-il Oum, Paul D. Seymour
2015	J	`jnl`	A Relative of Hadwiger's Conjecture. SIAM J. Discret. Math. Katherine Edwards, Dong Yeap Kang, Jaehoon Kim, Sang-il Oum, Paul D. Seymour
2015	J	`jnl`	An FPT 2-Approximation for Tree-Cut Decomposition. CoRR Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2015	B	`conf`	An FPT 2-Approximation for Tree-cut Decomposition. WAOA Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2015	J	`jnl`	Constructive algorithm for path-width of matroids. CoRR Jisu Jeong, Eun Jung Kim, Sang-il Oum
2015	J	`jnl`	Number of Cliques in Graphs with a Forbidden Subdivision. SIAM J. Discret. Math. Choongbum Lee, Sang-il Oum
2015	J	`jnl`	Partitioning H-minor free graphs into three subgraphs with no large components. Electron. Notes Discret. Math. Chun-Hung Liu, Sang-il Oum
2014	J	`jnl`	Excluded vertex-minors for graphs of linear rank-width at most k. Eur. J. Comb. Jisu Jeong, O-joung Kwon, Sang-il Oum
2014	J	`jnl`	Faster algorithms for vertex partitioning problems parameterized by clique-width. Theor. Comput. Sci. Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle
2014	J	`jnl`	Graphs of small rank-width are pivot-minors of graphs of small tree-width. Discret. Appl. Math. O-joung Kwon, Sang-il Oum
2014	J	`jnl`	Guest editors' foreword. Discret. Appl. Math. Pinar Heggernes, Jan Kratochvíl, Sang-il Oum
2014	J	`jnl`	Unavoidable vertex-minors in large prime graphs. Eur. J. Comb. O-joung Kwon, Sang-il Oum
2014	B	`conf`	Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract). WG Reinhard Diestel, Sang-il Oum
2013	A	`conf`	Excluded vertex-minors for graphs of linear rank-width at most k. STACS Jisu Jeong, O-joung Kwon, Sang-il Oum
2013	J	`jnl`	Faster Algorithms Parameterized by Clique-width. CoRR Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle
2012	—	`conf`	Deciding First Order Properties of Matroids. ICALP (2) Tomas Gavenciak, Daniel Král, Sang-il Oum
2012	J	`jnl`	Finding minimum clique capacity. Comb. Maria Chudnovsky, Sang-il Oum, Paul D. Seymour
2012	J	`jnl`	Graphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width CoRR O-joung Kwon, Sang-il Oum
2012	J	`jnl`	Rank-width of random graphs. J. Graph Theory Choongbum Lee, Joonkyung Lee, Sang-il Oum
2012	J	`jnl`	Strongly even cycle decomposable graphs CoRR Tony Huynh, Andrew D. King, Sang-il Oum, Maryam Verdian-Rizi
2011	J	`jnl`	Deciding first order logic properties of matroids CoRR Tomas Gavenciak, Daniel Král, Sang-il Oum
2011	J	`jnl`	Perfect Matchings in Claw-free Cubic Graphs. Electron. J. Comb. Sang-il Oum
2011	J	`jnl`	Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract). Electron. Notes Discret. Math. Sang-il Oum
2010	J	`jnl`	Rank-width and tree-width of H-minor-free graphs. Eur. J. Comb. Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos
2009	J	`jnl`	Circle graph obstructions under pivoting. J. Graph Theory Jim Geelen, Sang-il Oum
2009	J	`jnl`	Computing rank-width exactly. Inf. Process. Lett. Sang-il Oum
2009	J	`jnl`	Excluding a bipartite circle graph from line graphs. J. Graph Theory Sang-il Oum
2008	J	`jnl`	Approximating rank-width and clique-width quickly. ACM Trans. Algorithms Sang-il Oum
2008	J	`jnl`	Finding Branch-Decompositions and Rank-Decompositions. SIAM J. Comput. Petr Hlinený, Sang-il Oum
2008	J	`jnl`	Rank-Width and Well-Quasi-Ordering. SIAM J. Discret. Math. Sang-il Oum
2008	J	`jnl`	Rank-width is less than or equal to branch-width. J. Graph Theory Sang-il Oum
2008	J	`jnl`	Width Parameters Beyond Tree-width and their Applications. Comput. J. Petr Hlinený, Sang-il Oum, Detlef Seese, Georg Gottlob
2007	A	`conf`	Finding Branch-Decompositions and Rank-Decompositions. ESA Petr Hlinený, Sang-il Oum
2007	J	`jnl`	Testing branch-width. J. Comb. Theory B Sang-il Oum, Paul D. Seymour
2007	J	`jnl`	Vertex-minors, monadic second-order logic, and a conjecture by Seese. J. Comb. Theory B Bruno Courcelle, Sang-il Oum
2006	J	`jnl`	Approximating clique-width and branch-width. J. Comb. Theory B Sang-il Oum, Paul D. Seymour
2006	A*	`conf`	Certifying large branch-width. SODA Sang-il Oum, Paul D. Seymour
2005	B	`conf`	Approximating Rank-Width and Clique-Width Quickly. WG Sang-il Oum
2005	J	`jnl`	Rank-width and Well-quasi-ordering of Skew-symmetric Matrices: (extended abstract). Electron. Notes Discret. Math. Sang-il Oum
2005	J	`jnl`	Rank-width and vertex-minors. J. Comb. Theory B Sang-il Oum