30 citations · 157 across the 83 of their papers we have counts for
Showing 2022 · cs.DSShow all
2 papers · 2 filters
cs.DS2022★ 2 cited
Faster parameterized algorithms for modification problems to minor-closed classes
Laure Morelle, Ignasi Sau, Giannos Stamoulis +1
Let be a minor-closed graph class and let be an -vertex graph. We say that is a -apex of if contains a set of at most 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…