58 citations · 151 across the 35 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DS2013★ 6 cited
Half-integrality, LP-branching and FPT Algorithms
Yoichi Iwata, Magnus Wahlström, Yuichi Yoshida
A recent trend in parameterized algorithms is the application of polytope tools (specifically, LP-branching) to FPT algorithms (e.g., Cygan et al., 2011; Narayanaswamy et al., 2012…
cs.DS2013
Parameterized Rural Postman Problem
Gregory Gutin, Magnus Wahlstrom, Anders Yeo
The Directed Rural Postman Problem (DRPP) can be formulated as follows: given a strongly connected directed multigraph with nonnegative integral weights on the arcs, a su…
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…