20 citations · 180 across the 43 of their papers we have counts for
7 papers · 1 filter
Neighborhood complexity and kernelization for nowhere dense classes of graphs
Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer +4
We prove that whenever is a graph from a nowhere dense graph class , and is a subset of vertices of , then the number of subsets of that are realized as…
A Polynomial Kernel for Distance-Hereditary Vertex Deletion
Eun Jung Kim, O-joung Kwon
A graph is distance-hereditary if for any pair of vertices, their distance in every connected induced subgraph containing both vertices is the same as their distance in the origina…
A width parameter useful for chordal and co-comparability graphs
Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme +1
We investigate new graph classes of bounded mim-width, strictly extending interval graphs and permutation graphs. The graphs and are graphs…
A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion
Eduard Eiben, Robert Ganian, O-joung Kwon
Vertex deletion problems ask whether it is possible to delete at most vertices from a graph so that the resulting graph belongs to a specified graph class. Over the past years,…
Parameterized vertex deletion problems for hereditary graph classes with a block property
Édouard Bonnet, Nick Brettell, O-joung Kwon +1
For a class of graphs , the Bounded -Block Vertex Deletion problem asks, given a graph on vertices and positive integers and , whether ther…
Packing and Covering Immersion Models of Planar subcubic Graphs
Archontia Giannopoulou, O-joung Kwon, Jean-Florent Raymond +1
A graph is an immersion of a graph if can be obtained by some sugraph after lifting incident edges. We prove that there is a polynomial function $f:\Bbb{N}\times\Bb…
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem
Andre Droschinsky, Nils M. Kriege, Petra Mutzel
The maximum common subtree isomorphism problem asks for the largest possible isomorphism between subtrees of two given input trees. This problem is a natural restriction of the max…