4 papers
Exact Matching and the Top-k Perfect Matching Problem
Nicolas El Maalouly, Lasse Wulf
The aim of this note is to provide a reduction of the Exact Matching problem to the Top- Perfect Matching Problem. Together with earlier work by El Maalouly, this shows that the…
Assistance and Interdiction Problems on Interval Graphs
Hung P. Hoang, Stefan Lendl, Lasse Wulf
We introduce a novel framework of graph modifications specific to interval graphs. We study interdiction problems with respect to these graph modifications. Given a list of origina…
Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty
Marc Goerigk, Stefan Lendl, Lasse Wulf
Recoverable robust optimization is a multi-stage approach, where it is possible to adjust a first-stage solution after the uncertain cost scenario is revealed. We analyze this appr…
A Greedy Heuristic for Crossing-Angle Maximization
Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze +2
The crossing angle of a straight-line drawing of a graph is the smallest angle between two crossing edges in . Deciding whether a graph has a straight-line dr…