Dimitrios M. Thilikos

most citedFaster parameterized algorithms for modification problems to minor-closed classes

2 citations · 3 across the 7 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2022★ 2 cited

Faster parameterized algorithms for modification problems to minor-closed classes

Laure Morelle, Ignasi Sau, Giannos Stamoulis +1

Let $G$ be a minor-closed graph class and let $G$ be an $n$ -vertex graph. We say that $G$ is a $k$ -apex of $G$ if $G$ contains a set $S$ of at most $k$ vertices such…

cs.DS2022

Kernelization for Graph Packing Problems via Rainbow Matching

Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos +1

We introduce a new kernelization tool, called rainbow matching technique}, that is appropriate for the design of polynomial kernels for packing problems and their hitting counterpa…

cs.DS2016★ 1 cited

Explicit linear kernels for packing problems

Valentin Garnero, Christophe Paul, Ignasi Sau +1

During the last years, several algorithmic meta-theorems have appeared (Bodlaender et al. [FOCS 2009], Fomin et al. [SODA 2010], Kim et al. [ICALP 2013]) guaranteeing the existence…