activity
20172021
most citedRobust Multicovers with Budgeted Uncertainty

12 citations · 14 across the 2 of their papers we have counts for

collaborators

7 papers

math.CO2021

Uniformly connected graphs

Frank Göring, Tobias Hofmann, Manuel Streicher

In this article we investigate the structure of uniformly -connected and uniformly -edge-connected graphs. Whereas both types have previously been studied independent of each…

math.OC2020

Robust strategic planning for mobile medical units with steerable and unsteerable demands

Christina Büsing, Martin Comis, Eva Schmidt +1

Mobile medical units (MMUs) are customized vehicles fitted with medical equipment that are used to provide primary care in rural environments. As MMUs can be easily relocated, they…

math.CO2020

2.5-Connectivity: Unique Components, Critical Graphs, and Applications

Irene Heinrich, Till Heller, Eva Schmidt +1

If a biconnected graph stays connected after the removal of an arbitrary vertex and an arbitrary edge, then it is called 2.5-connected. We prove that every biconnected graph has a…

math.CO2019

On the Mixed Connectivity Conjecture of Beineke and Harary

Sebastian S. Johann, Sven O. Krumke, Manuel Streicher

The conjecture of Beineke and Harary states that for any two vertices which can be separated by vertices and edges for but neither by vertices and edges…

math.OC201812 cited

Robust Multicovers with Budgeted Uncertainty

Sven O. Krumke, Eva Schmidt, Manuel Streicher

The Min--Multiset Multicover problem presented in this paper is a special version of the Multiset Multicover problem. For a fixed positive integer , we are given a finite gro…

math.CO2018

Simultaneously Dominating all Spanning Trees of a Graph

Sebastian S. Johann, Sven O. Krumke, Manuel Streicher

We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning tr…