4 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.DS2013★ 2 cited
Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
Magnus Wahlström
We give an algebraic, determinant-based algorithm for the K-Cycle problem, i.e., the problem of finding a cycle through a set of specified elements. Our approach gives a simple FPT…
cs.CG2011★ 4 cited
Hardness of discrepancy computation and epsilon-net verification in high dimension
Panos Giannopoulos, Christian Knauer, Magnus Wahlström +1
Discrepancy measures how uniformly distributed a point set is with respect to a given set of ranges. There are two notions of discrepancy, namely continuous discrepancy and combina…
cs.CC2009★ 1 cited
Preprocessing of Min Ones Problems: A Dichotomy
Stefan Kratsch, Magnus Wahlstrom
A parameterized problem consists of a classical problem and an additional component, the so-called parameter. This point of view allows a formal definition of preprocessing: Given…