58 citations · 239 across the 47 of their papers we have counts for
3 papers · 2 filters
Parameterized Algorithms for Modular-Width
Jakub Gajarský, Michael Lampis, Sebastian Ordyniak
It is known that a number of natural graph problems which are FPT parameterized by treewidth become W-hard when parameterized by clique-width. It is therefore desirable to find a d…
Upper and Lower Bounds for Weak Backdoor Set Detection
Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman +1
We obtain upper and lower bounds for running times of exponential time algorithms for the detection of weak backdoor sets of 3CNF formulas, considering various base classes. These…
Kernelization Using Structural Parameters on Sparse Graph Classes
Jakub Gajarský, Petr Hliněný, Jan Obdržálek +5
Meta-theorems for polynomial (linear) kernels have been the subject of intensive research in parameterized complexity. Heretofore, meta-theorems for linear kernels exist on graphs…