5 citations · 10 across the 8 of their papers we have counts for
23 papers
A Unifying Framework for Characterizing and Computing Width Measures
Eduard Eiben, Robert Ganian, Thekla Hamm +2
Algorithms for computing or approximating optimal decompositions for decompositional parameters such as treewidth or clique-width have so far traditionally been tailored to specifi…
On the Erdős-Pósa property for long holes in -free graphs
Tony Huynh, O-joung Kwon
We prove that there exists a function such that for every -free graph and every , either contains vertex-disjoint…
Classes of intersection digraphs with good algorithmic properties
Lars Jaffke, O-joung Kwon, Jan Arne Telle
An intersection digraph is a digraph where every vertex is represented by an ordered pair of sets such that there is an edge from to if and only if a…
A system of disjoint representatives of line segments with given directions
Jinha Kim, Minki Kim, O-Joung Kwon
We prove that for all positive integers and , there exists an integer satisfying the following. If is a set of direction vectors in the plane and $\math…
The canonical directed tree decomposition and its applications to the directed disjoint paths problem
Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer +1
The canonical tree-decomposition theorem, given by Robertson and Seymour in their seminal graph minors series, turns out to be one of the most important tool in structural and algo…
Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth
Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell +1
The Cut & Count technique and the rank-based approach have lead to single-exponential FPT algorithms parameterized by treewidth, that is, running in time , for F…