31 citations · 155 across the 25 of their papers we have counts for
4 papers · 1 filter
Recent Advances in Practical Data Reduction
Faisal Abu-Khzam, Sebastian Lamm, Matthias Mnich +3
Over the last two decades, significant advances have been made in the design and analysis of fixed-parameter algorithms for a wide variety of graph-theoretic problems. This has res…
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations
Alexander Gellner, Sebastian Lamm, Christian Schulz +2
Given a vertex-weighted graph, the maximum weight independent set problem asks for a pair-wise non-adjacent set of vertices such that the sum of their weights is maximum. The branc…
Engineering Data Reduction for Nested Dissection
Lara Ost, Christian Schulz, Darren Strash
Many applications rely on time-intensive matrix operations, such as factorization, which can be sped up significantly for large sparse matrices by interpreting the matrix as a spar…
Finding All Global Minimum Cuts In Practice
Monika Henzinger, Alexander Noe, Christian Schulz +1
We present a practically efficient algorithm that finds all global minimum cuts in huge undirected graphs. Our algorithm uses a multitude of kernelization rules to reduce the graph…