Sang‐il Oum

2.2k total citations
64 papers, 875 citations indexed

About

Sang‐il Oum is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Sang‐il Oum has authored 64 papers receiving a total of 875 indexed citations (citations by other indexed papers that have themselves been cited), including 63 papers in Computational Theory and Mathematics, 20 papers in Discrete Mathematics and Combinatorics and 20 papers in Geometry and Topology. Recurrent topics in Sang‐il Oum's work include Advanced Graph Theory Research (60 papers), Complexity and Algorithms in Graphs (21 papers) and Graph Labeling and Dimension Problems (20 papers). Sang‐il Oum is often cited by papers focused on Advanced Graph Theory Research (60 papers), Complexity and Algorithms in Graphs (21 papers) and Graph Labeling and Dimension Problems (20 papers). Sang‐il Oum collaborates with scholars based in South Korea, United States and France. Sang‐il Oum's co-authors include Paul Seymour, Petr Hliněný, Bruno Courcelle, Detlef Seese, Georg Gottlob, O‐joung Kwon, Jim Geelen, Dimitrios M. Thilikos, Jisu Jeong and Donggyu Kim and has published in prestigious journals such as Transactions of the American Mathematical Society, SIAM Journal on Computing and Advances in Mathematics.

In The Last Decade

Sang‐il Oum

56 papers receiving 826 citations

Peers

Sang‐il Oum

CTM

GT

CNC

DMC

AI

Udi Rotics Israel

André Bouchet France

Ronald D. Dutton United States

François Jaeger France

R. E. L. Aldred New Zealand

Daniel H. Ullman United States

Sylvain Gravier France

Claude Tardif Canada

Martin Farber Canada

Bruce A. Reed Canada

Udi Rotics Israel

Sang‐il Oum

1.0k ×1.3

CTM

200 ×0.8

GT

292 ×1.2

CNC

241 ×1.3

DMC

93 ×1.3

AI

Citations per year, relative to Sang‐il Oum Sang‐il Oum (= 1×) peers Udi Rotics

Countries citing papers authored by Sang‐il Oum

Since Specialization

Citations

This map shows the geographic impact of Sang‐il Oum's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Sang‐il Oum with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sang‐il Oum more than expected).

Fields of papers citing papers by Sang‐il Oum

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Sang‐il Oum. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Sang‐il Oum. The network helps show where Sang‐il Oum may publish in the future.

Co-authorship network of co-authors of Sang‐il Oum

This figure shows the co-authorship network connecting the top 25 collaborators of Sang‐il Oum. A scholar is included among the top collaborators of Sang‐il Oum based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Sang‐il Oum. Sang‐il Oum is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Kwon, O‐joung, et al.. (2025). A unified Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups. Mathematische Annalen. 393(2). 2507–2559.

2.

Kim, Donggyu, et al.. (2024). Twin‐width of random graphs. Random Structures and Algorithms. 65(4). 794–831. 3 indexed citations

3.

Oum, Sang‐il, et al.. (2023). A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors. European Journal of Combinatorics. 113. 103761–103761. 1 indexed citations

4.

Kim, Donggyu, et al.. (2023). $$\Gamma $$-Graphic Delta-Matroids and Their Applications. COMBINATORICA. 43(5). 963–983. 1 indexed citations

5.

Kwon, O‐joung, et al.. (2021). Obstructions for bounded shrub-depth and rank-depth. IRIS Research product catalog (Sapienza University of Rome). 3 indexed citations

6.

Kwon, O‐joung, et al.. (2020). A Polynomial Kernel for 3-Leaf Power Deletion. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

7.

Jeong, Jisu, Eun Jung Kim, & Sang‐il Oum. (2018). Finding Branch-Decompositions of Matroids, Hypergraphs, and More. HAL (Le Centre pour la Communication Scientifique Directe). 14. 3 indexed citations

8.

Chudnovsky, Maria & Sang‐il Oum. (2018). Vertex-minors and the Erdős–Hajnal conjecture. Discrete Mathematics. 341(12). 3498–3499. 4 indexed citations

9.

Huynh, Tony, et al.. (2017). Even-cycle decompositions of graphs with no odd-K4-minor. European Journal of Combinatorics. 65. 1–14. 4 indexed citations

10.

Choi, Suyoung, Mikiya Masuda, & Sang‐il Oum. (2016). Classification of real Bott manifolds and acyclic digraphs. Transactions of the American Mathematical Society. 369(4). 2987–3011. 4 indexed citations

11.

Oum, Sang‐il, et al.. (2016). Dynamic coloring of graphs having no K5 minor. Discrete Applied Mathematics. 206. 81–89. 7 indexed citations

12.

Kwon, O‐joung & Sang‐il Oum. (2014). Unavoidable vertex-minors in large prime graphs. European Journal of Combinatorics. 41. 100–127. 5 indexed citations

13.

Oum, Sang‐il, et al.. (2014). Faster algorithms for vertex partitioning problems parameterized by clique-width. Theoretical Computer Science. 535. 16–24. 11 indexed citations

14.

Oum, Sang‐il. (2011). Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices. Linear Algebra and its Applications. 436(7). 2008–2036. 5 indexed citations

15.

Fomin, Fedor V., Sang‐il Oum, & Dimitrios M. Thilikos. (2010). Rank-width and tree-width of H-minor-free graphs. European Journal of Combinatorics. 31(7). 1617–1628. 16 indexed citations

16.

Hliněný, Petr & Sang‐il Oum. (2008). Finding branch-decomposition and rank-decomposition. SIAM Journal on Computing. 38(3). 9 indexed citations

17.

Oum, Sang‐il & Paul Seymour. (2006). Certifying large branch-width. Symposium on Discrete Algorithms. 810–813. 1 indexed citations

18.

Oum, Sang‐il & Paul Seymour. (2006). Testing branch-width. Journal of Combinatorial Theory Series B. 97(3). 385–393. 21 indexed citations

19.

Courcelle, Bruno & Sang‐il Oum. (2006). Vertex-minors, monadic second-order logic, and a conjecture by Seese. Journal of Combinatorial Theory Series B. 97(1). 91–126. 47 indexed citations

20.

Oum, Sang‐il. (2005). Rank-width and vertex-minors. Journal of Combinatorial Theory Series B. 95(1). 79–100. 111 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact