9 citations · 17 across the 4 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022★ 1 cited
Efficient parameterized algorithms on graphs with heterogeneous structure: Combining tree-depth and modular-width
Stefan Kratsch, Florian Nelles
Many computational problems admit fast algorithms on special inputs, however, the required properties might be quite restrictive. E.g., many graph problems can be solved much faste…
cs.DS2022★ 4 cited
On Triangle Counting Parameterized by Twin-Width
Stefan Kratsch, Florian Nelles, Alexandre Simon
In this report we present an algorithm solving Triangle Counting in time , where n and m, respectively, denote the number of vertices and edges of a graph G and d denote…