Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Fair Vertex Problems Parameterized by Cluster Vertex Deletion
Tomáš Masařík, Jędrzej Olkowski, Anna Zych-Pawlewicz
In this paper we study fair variants of MSO definable problems parameterized by cluster vertex deletion number, i.e., the smallest number of vertices required to be removed fro…
cs.DS2022
Dynamic data structures for parameterized string problems
Jędrzej Olkowski, Michał Pilipczuk, Mateusz Rychlicki +2
We revisit classic string problems considered in the area of parameterized complexity, and study them through the lens of dynamic data structures. That is, instead of asking for a…