3 citations · 7 across the 4 of their papers we have counts for
4 papers
A -Approximation for Multiple TSP with a Variable Number of Depots
Max Deppert, Matthias Kaul, Matthias Mnich
One of the most studied extensions of the famous Traveling Salesperson Problem (TSP) is the {\sc Multiple TSP}: a set of salespersons collectively traverses a set of …
Resolving Infeasibility of Linear Systems: A Parameterized Approach
Kristóf Bérczi, Alexander Göke, Lydia Mirabel Mendoza-Cadena +1
Deciding feasibility of large systems of linear equations and inequalities is one of the most fundamental algorithmic tasks. However, due to data inaccuracies or modeling errors, i…
Parameterized Complexity Dichotomy for Steiner Multicut
Karl Bringmann, Danny Hermelin, Matthias Mnich +1
The Steiner Multicut problem asks, given an undirected graph G, terminals sets T1,...,Tt V(G) of size at most p, and an integer k, whether there is a set S of at most k…
All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Kernels with Quadratic Numbers of Variables
Gregory Gutin, Leo van Iersel, Matthias Mnich +1
A ternary Permutation-CSP is specified by a subset of the symmetric group . An instance of such a problem consists of a set of variables and a multiset of con…