Preprints
Twin-width of random graphs
-with Debsoumya Chakraborti, Kevin Hendrey, Donggyu Kim, and Sang-il Oum,
–arXiv: 2212.07880.
The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs
-with Seonghyuk Im and Sang-il Oum,
–arXiv: 2208.08330.
Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
-with Jinha Kim and O-joung Kwon,
–arXiv: 2207.06660.
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, Kevin Hendrey, Donggyu Kim, and Sang-il Oum, Bounds for the twin-width of graphs. SIAM J. Discrete Math. (2022).
–arXiv:2110.03957.
–DOI: 10.1137/21M1452834.
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).
Research Talks
Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
-presented at Discrete Math Seminar in Discrete Mathematics Group (DIMAG), Institute for Basic Science (IBS). (YouTube Link)
The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs
-presented at 2022 Global KMS International Conference (October 18-21, 2022, Seoul, South Korea).
The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs
-presented at 2022 Combinatorics Workshop (September 30-October 1, 2022, Gwangju, South Korea).
Bounds for the twin-width of graphs
-presented at the 10th Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2022, September 19-22, 2022, Koper, Slovenia).
Bounds for the twin-width of graphs
-presented at 2022 KMS Spring Meeting (April 28-29, 2022, South Korea).
Bounds for the twin-width of graphs
-presented at 2021 Combinatorics Workshop (December 20-22, 2021, Yangpyeong, South Korea).
Towards constant-factor approximation for chordal / distance-hereditary vertex deletion
-presented at 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 2021 KMS Spring Meeting (April 29-30, 2021, South Korea).
Well-partitioned chordal graphs with the obstruction set and applications
-presented at Discrete Math Seminar in Discrete Mathematics Group (DIMAG), Institute for Basic Science (IBS). (YouTube Link)
A polynomial kernel for 3-leaf power deletion
-presented at 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 24-26, 2020, Leeds, United Kingdom).
Peer Review Activities
Journal Papers
-ACM Transactions on Algorithms, 2023
-Korean Journal of Mathematics, 2021.
-International Transactions in Operational Research, 2021.
Conference Papers
-The 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023).
-The 33rd International Symposium on Algorithms and Computation (ISAAC 2022).
-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).