• 1
Journal Article
...Decomposing an Eulerian graph into a minimum respectively maximum number of edge disjoint cycles is an NP-complete problem. We prove that an Eulerian graph...

• 2
Journal Article
...Background Vaccines are an important tool to limit the health and economic damage of the Covid-19 pandemic. Several vaccine candidates already provided...

• 3
Journal Article
...•Introduction of novel problem called q-Multiset Multicover.•Solution approaches for a robust version using budgeted constrained uncertainty.•Computational...

• 4
Journal Article
...•Strategic planning for mobile medical units as a capacitated set covering problem.•Consideration of two inherently different kinds of patient...

• 5
Book Chapter
...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...
• 6
Journal Article
...In this article we investigate the structure of uniformly \$k\$-connected and uniformly \$k\$-edge-connected graphs. Whereas both types have previously been...

• 7
Journal Article
...Decomposing an Eulerian graph into a minimum respectively maximum number of edge disjoint cycles is an NP-complete problem. We prove that an Eulerian graph...

• 8
Journal Article
...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...

• 9
Journal Article
...The conjecture of Beineke and Harary states that for any two vertices which can be separated by \$k\$ vertices and \$l\$ edges for \$l\geq 1\$ but neither by \$k\$...

• 10
Journal Article
...Haj\'os' conjecture states that an Eulerian graph of order n can be decomposed into at most (n-1)/2 edge-disjoint cycles. We describe preprocessing steps,...

• 11
Journal Article
...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...

• 12
Publication
...If a 2-connected 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...
• 13
Book Chapter
...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...
• 14
Publication
...A pair of non-negative integers \$(k,l)\$ is called a connectivity pair for distinct vertices \$s\$ and \$t\$ of a graph \$G\$ if they can be separated by removing \$k\$...
• 15
Publication
...Haj\'os' conjecture states that an Eulerian graph of order n can be decomposed into at most (n-1)/2 edge-disjoint cycles. We describe preprocessing steps,...
• 16
Publication
...A subset of the vertices of a graph is a simultaneous dominating set for spanning trees if it is a dominating set in every spanning tree of the graph. We...