3 papers
cs.DS2022★ 3 cited
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…
cs.DS2021
Hitting Weighted Even Cycles in Planar Graphs
Alexander Göke, Jochen Koenemann, Matthias Mnich +1
A classical branch of graph algorithms is graph transversals, where one seeks a minimum-weight subset of nodes in a node-weighted graph which intersects all copies of subgraphs…
cs.DS2020
Hitting Long Directed Cycles is Fixed-Parameter Tractable
Alexander Göke, Dániel Marx, Matthias Mnich
In the Directed Long Cycle Hitting Set} problem we are given a directed graph , and the task is to find a set of at most vertices/arcs such that has no cycle of le…