activity
20092013
most citedHardness of discrepancy computation and epsilon-net verification in high dimension

4 citations · 7 across the 3 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

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…