4 citations · 4 across the 3 of their papers we have counts for
3 papers
math.CO2026
A dual view of Roman Domination: The 2-limited packing problem
Oliver Bachtler, Sven O. Krumke, Helena Weiß
We consider the 2-limited packing problem: for a graph one seeks to find a maximum cardinality subset , such that, for all , the closed neighbourhoo…
quant-ph2024★ 4 cited
QCEDA: Using Quantum Computers for EDA
Matthias Jung, Sven O. Krumke, Christof Schroth +2
The field of Electronic Design Automation (EDA) is crucial for microelectronics, but the increasing complexity of Integrated Circuits (ICs) poses challenges for conventional EDA: C…
cs.DS2021
Algorithms and Complexity for the Almost Equal Maximum Flow Problem
Rebekka Haese, Till Heller, Sven O. Krumke
In the Equal Maximum Flow Problem (EMFP), we aim for a maximum flow where we require the same flow value on all edges in some given subsets of the edge set. In this paper, we study…