4 citations · 4 across the 1 of their papers we have counts for
3 papers
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…
cs.DS2020
Efficient parameterized algorithms for computing all-pairs shortest paths
Stefan Kratsch, Florian Nelles
Computing all-pairs shortest paths is a fundamental and much-studied problem with many applications. Unfortunately, despite intense study, there are still no significantly faster a…
cs.DS2018
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…