121 citations · 416 across the 16 of their papers we have counts for
Showing 2018 · cs.DSShow all
3 papers · 2 filters
cs.DS2018★ 53 cited
Kernelization of Packing Problems
Holger Dell, Dániel Marx
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching fo…
cs.DS2018
Extensor-Coding
Cornelius Brand, Holger Dell, Thore Husfeldt
We devise an algorithm that approximately computes the number of paths of length in a given directed graph with vertices up to a multiplicative error of …
cs.DS2018
Lovász Meets Weisfeiler and Leman
Holger Dell, Martin Grohe, Gaurav Rattan
In this paper, we relate a beautiful theory by Lovász with a popular heuristic algorithm for the graph isomorphism problem, namely the color refinement algorithm and its k-dimensio…