58 citations · 151 across the 35 of their papers we have counts for
5 papers · 1 filter
Multi-budgeted directed cuts
Stefan Kratsch, Shaohua Li, Dániel Marx +2
We study multi-budgeted variants of the classic minimum cut problem and graph separation problems that turned out to be important in parameterized complexity: Skew Multicut and Dir…
On -Simple -Path and Related Problems Parameterized by
Gregory Gutin, Magnus Wahlström, Meirav Zehavi
Abasi et al. (2014) and Gabizon et al. (2015) studied the following problems. In the -Simple -Path problem, given a digraph on vertices and integers , decide whe…
Alternative parameterizations of Metric Dimension
Gregory Gutin, M. S. Ramanujan, Felix Reidl +1
A set of vertices in a graph is called resolving if for any two distinct , there is such that , where ${\rm di…
Parameterized Algorithms for Zero Extension and Metric Labelling Problems
Felix Reidl, Magnus Wahlström
We consider the problems ZERO EXTENSION and METRIC LABELLING under the paradigm of parameterized complexity. These are natural, well-studied problems with important applications, b…
Which NP-Hard SAT and CSP Problems Admit Exponentially Improved Algorithms?
Victor Lagerkvist, Magnus Wahlström
We study the complexity of SAT() problems for potentially infinite languages closed under variable negation (sign-symmetric languages). Via an algebraic connection, this red…