114 citations · 306 across the 50 of their papers we have counts for
3 papers · 2 filters
Multi-budgeted directed cuts
Stefan Kratsch, Shaohua Li, Dániel Marx +2
We study multi-budgeted variants of the classic minimum cut problem and graph separation problems that turned out to be important in parameterized complexity: Skew Multicut and Dir…
Efficient and adaptive parameterized algorithms on modular decompositions
Stefan Kratsch, Florian Nelles
We study the influence of a graph parameter called modular-width on the time complexity for optimally solving well-known polynomial problems such as Maximum Matching, Triangle Coun…
The parameterized complexity of finding a 2-sphere in a simplicial complex
Benjamin Burton, Sergio Cabello, Stefan Kratsch +1
We consider the problem of finding a subcomplex K' of a simplicial complex K such that K' is homeomorphic to the 2-dimensional sphere, S^2. We study two variants of this problem. T…