Jungho Ahn

activity

20192026

most citedBounds for the Twin-width of Graphs

15 citations · 28 across the 8 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2022

Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes

Jungho Ahn, Jinha Kim, O-joung Kwon

Let $F$ be a family of graphs, and let $p, r$ be nonnegative integers. The \textsc{ $(p, r, F)$ -Covering} problem asks whether for a graph $G$ and an integer $k$ , t…

cs.DS2020

Towards constant-factor approximation for chordal / distance-hereditary vertex deletion

Jungho Ahn, Eun Jung Kim, Euiwoong Lee

For a family of graphs $F$ , Weighted $F$ -Deletion is the problem for which the input is a vertex weighted graph $G = (V, E)$ and the goal is to delete $S\subseteq…

cs.DS2019★ 4 cited

A polynomial kernel for $3$ -leaf power deletion

Jungho Ahn, Eduard Eiben, O-joung Kwon +1

For a non-negative integer $ℓ$ , the $ℓ$ -leaf power of a tree $T$ is a simple graph $G$ on the leaves of $T$ such that two vertices are adjacent in $G$ if and only if their di…

Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes

Towards constant-factor approximation for chordal / distance-hereditary vertex deletion

A polynomial kernel for 3-leaf power deletion

A polynomial kernel for $3$ -leaf power deletion