O‐joung Kwon

496 total citations
30 papers, 126 citations indexed

About

O‐joung Kwon is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, O‐joung Kwon has authored 30 papers receiving a total of 126 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Computational Theory and Mathematics, 11 papers in Computer Networks and Communications and 10 papers in Discrete Mathematics and Combinatorics. Recurrent topics in O‐joung Kwon's work include Advanced Graph Theory Research (29 papers), Complexity and Algorithms in Graphs (12 papers) and Interconnection Networks and Systems (11 papers). O‐joung Kwon is often cited by papers focused on Advanced Graph Theory Research (29 papers), Complexity and Algorithms in Graphs (12 papers) and Interconnection Networks and Systems (11 papers). O‐joung Kwon collaborates with scholars based in South Korea, France and Norway. O‐joung Kwon's co-authors include Jan Arne Telle, Sang‐il Oum, Eun Jung Kim, Paul Wollan, Matt DeVos, Mamadou Moustapha Kanté, Jim Geelen, Isolde Adler, Dimitrios M. Thilikos and Stephan Kreutzer and has published in prestigious journals such as Theoretical Computer Science, Mathematische Annalen and Discrete Applied Mathematics.

In The Last Decade

O‐joung Kwon

25 papers receiving 122 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
O‐joung Kwon South Korea	7	120	35	33	30	7	30	126
Mamadou Moustapha Kanté France	7	115 1.0×	23 0.7×	20 0.6×	29 1.0×	10 1.4×	19	121
Alexey Pokrovskiy United Kingdom	7	100 0.8×	47 1.3×	90 2.7×	15 0.5×	5 0.7×	23	130
Konrad K. Dabrowski United Kingdom	7	159 1.3×	34 1.0×	88 2.7×	30 1.0×	10 1.4×	29	168
Deepak Rajendraprasad India	6	166 1.4×	34 1.0×	78 2.4×	39 1.3×	7 1.0×	24	172
Abel Cabrera Martínez Spain	9	223 1.9×	34 1.0×	46 1.4×	50 1.7×	3 0.4×	62	255
Mostafa Blidia Algeria	9	202 1.7×	33 0.9×	48 1.5×	51 1.7×	4 0.6×	35	211
Marthe Bonamy France	9	175 1.5×	33 0.9×	86 2.6×	29 1.0×	6 0.9×	34	188
Hoàng-Oanh Le Germany	10	199 1.7×	52 1.5×	57 1.7×	58 1.9×	7 1.0×	17	204
Paweł Rzążewski Poland	6	91 0.8×	16 0.5×	41 1.2×	16 0.5×	12 1.7×	49	103
Emmanuel Godard France	5	81 0.7×	13 0.4×	25 0.8×	49 1.6×	9 1.3×	12	113

Countries citing papers authored by O‐joung Kwon

Since Specialization

Citations

This map shows the geographic impact of O‐joung Kwon'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 O‐joung Kwon with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites O‐joung Kwon more than expected).

Fields of papers citing papers by O‐joung Kwon

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by O‐joung Kwon. 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 O‐joung Kwon. The network helps show where O‐joung Kwon may publish in the future.

Co-authorship network of co-authors of O‐joung Kwon

This figure shows the co-authorship network connecting the top 25 collaborators of O‐joung Kwon. A scholar is included among the top collaborators of O‐joung Kwon 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 O‐joung Kwon. O‐joung Kwon 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

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.

Kwon, O‐joung, et al.. (2023). Classes of intersection digraphs with good algorithmic properties. Journal of Graph Theory. 106(1). 110–148.

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

Kwon, O‐joung, et al.. (2021). Packing and Covering Induced Subdivisions. HAL (Le Centre pour la Communication Scientifique Directe).

Kim, Eun Jung & O‐joung Kwon. (2021). A Polynomial Kernel for Distance-Hereditary Vertex Deletion. Algorithmica. 83(7). 2096–2141. 3 indexed citations

Kim, Jinha, Minki Kim, & O‐joung Kwon. (2021). Rainbow independent sets on dense graph classes. Discrete Applied Mathematics. 312. 45–51. 2 indexed citations

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

Kwon, O‐joung, et al.. (2020). Graphs without two vertex-disjoint S-cycles. Discrete Mathematics. 343(10). 111997–111997.

DeVos, Matt, O‐joung Kwon, & Sang‐il Oum. (2020). Branch-depth: Generalizing tree-depth of graphs. European Journal of Combinatorics. 90. 103186–103186. 9 indexed citations

10.

Kwon, O‐joung, et al.. (2019). Lean Tree-Cut Decompositions: Obstructions and Algorithms. arXiv (Cornell University). 4 indexed citations

11.

Kwon, O‐joung, et al.. (2019). Mim-Width I. Induced path problems. Discrete Applied Mathematics. 278. 153–168. 14 indexed citations

12.

Kanté, Mamadou Moustapha, et al.. (2019). An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. Algorithmica. 82(6). 1654–1674. 1 indexed citations

13.

Bonnet, Édouard, et al.. (2018). Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms. Middlesex University Research Repository (Middlesex University Of London).

14.

Kwon, O‐joung, et al.. (2018). A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 96. 14. 4 indexed citations

15.

Kwon, O‐joung, et al.. (2017). Packing and covering immersion-expansions of planar sub-cubic graphs. European Journal of Combinatorics. 65. 154–167. 3 indexed citations

16.

Kreutzer, Stephan, et al.. (2017). Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14. 7 indexed citations

17.

Hliněný, Petr, O‐joung Kwon, Jan Óbdržálek, & Sebastian Ordyniak. (2016). Tree-depth and vertex-minors. European Journal of Combinatorics. 56. 46–56. 5 indexed citations

18.

Bodlaender, Hans L., et al.. (2015). Characterizing width two for variants of treewidth. Discrete Applied Mathematics. 216. 29–46. 5 indexed citations

19.

Adler, Isolde, Mamadou Moustapha Kanté, & O‐joung Kwon. (2014). Linear rank-width of distance-hereditary graphs I. A polynomial-time\n algorithm. arXiv (Cornell University). 5 indexed citations

20.

Kwon, O‐joung & Sang‐il Oum. (2014). Unavoidable vertex-minors in large prime graphs. European Journal of Combinatorics. 41. 100–127. 5 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