Research

Submitted / Preprint

Bounds for the twin-width of graphs
-with Kevin Hendrey, Donggyu Kim, and Sang-il Oum,
arXiv:2110.03957.

A polynomial kernel for 3-leaf power deletion
-with Eduard Eiben, O-joung Kwon, and Sang-il Oum,
arXiv: 1911.04249.

Accepted Journal Papers

Jungho Ahn, Lars Jaffke, O-joung Kwon, and Paloma T. Lima. Well-partitioned Chordal Graphs. Discrete Mathematics (2022).
DOI: 10.1016/j.disc.2022.112985.

Jungho Ahn, Eun Jung Kim, and Euiwoong Lee. Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion. Algorithmica (2022).
arXiv: 2009.00809,
DOI: 10.1007/s00453-022-00963-7.

Refereed Conference Papers

Three problems on well-partitioned chordal graphs
-with Lars Jaffke, O-joung Kwon, and Paloma T. Lima,
-accepted in the Proceedings of the 12th International Conference on Algorithms and Complexity (CIAC 2021, May 10-12, 2021, Larnaca, Cyprus).

Towards constant-factor approximation for chordal / distance-hereditary vertex deletion
-with Eun Jung Kim and Euiwoong Lee,
arXiv: 2009.00809,
DOI: 10.4230/LIPIcs.ISAAC.2020.62,
-accepted in the Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC 2020, December 14-18, 2020, Hong Kong).

A polynomial kernel for 3-leaf power deletion
-with Eduard Eiben, O-joung Kwon, and Sang-il Oum,
arXiv: 1911.04249,
DOI: 10.4230/LIPIcs.MFCS.2020.5,
-accepted in the Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020, August 24-28, 2020, Prague, Czech Republic).

Well-partitioned chordal graphs: obstruction set and disjoint paths
-with Lars Jaffke, O-joung Kwon, and Paloma T. Lima,
arXiv: 2002.10859,
DOI: 10.1007/978-3-030-60440-0_12,
-accepted in the Proceedings of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2020, June 24-26, 2020, Leeds, United Kingdom).

Conference Talks

Bounds for the twin-width of graphs
-presented at the 2022 KMS Spring Meeting (April 28-29, 2022, South Korea).

Bounds for the twin-width of graphs
-presented at the 2021 Combinatorics Workshop (December 20-22, 2021, South Korea).

Towards constant-factor approximation for chordal / distance-hereditary vertex deletion
-presented at the 2021 KMS Annual Meeting (October 20-22, 2021, South Korea).

Three problems on well-partitioned chordal graphs
-presented at the 12th International Conference on Algorithms and Complexity (CIAC 2021, May 10-12, 2021, Larnaca, Cyprus).

Well-partitioned chordal graphs: obstruction set and applications
-presented at the 2021 KMS Spring Meeting (April 29-30, 2021, South Korea).

A polynomial kernel for 3-leaf power deletion
-presented at the 2020 KMS Annual Meeting (October 23-24, 2020, South Korea).

A polynomial kernel for 3-leaf power deletion
-presented at the Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020, August 25-26, 2020, Prague, Czech Republic).

Well-partitioned chordal graphs: obstruction set and disjoint paths
-presented at the Proceedings of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2020, June 25, 2020, Leeds, United Kingdom).

Seminar Talks

Well-partitioned chordal graphs with the obstruction set and applications
-presented in Discrete Math Seminar at Discrete Mathematics Group (DIMAG) in Institute for Basic Science (IBS). (YouTube Link)

Thesis

A polynomial kernel for 3-leaf power deletion
-Master’s thesis, Department of Mathematical Sciences, KAIST, South Korea, 2020. (Thesis Link)

Peer Review Activities

Journal Papers
-Korean Journal of Mathematics, 2021.
-International Transactions in Operational Research, 2021.

Conference Papers
-The 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
-The 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2021).
-The 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021).
-The 15th International Symposium on Parameterized and Exact Computation (IPEC 2020).
-The 31st International Symposium on Algorithms and Computation (ISAAC 2020).