9 citations · 18 across the 6 of their papers we have counts for
14 papers
Computing Oriented Spanners and their Dilation
Kevin Buchin, Antonia Kalb, Anil Maheshwari +4
Given a point set in a metric space and a real number , an \emph{oriented -spanner} is an oriented graph , where for eve…
Geometric spanners of bounded tree-width
Kevin Buchin, Carolin Rehs, Torben Scheele
Given a point set in the Euclidean space, a geometric -spanner is a graph on such that for every pair of points, the shortest path in between those points is at…
Orienteering (with Time Windows) on Restricted Graph Classes
Kevin Buchin, Mart Hagedoorn, Guangping Li +1
Given a graph with edge costs and vertex profits and given a budget B, the Orienteering Problem asks for a walk of cost at most B of maximum profit. Additionally, each profit may b…
Oriented Spanners
Kevin Buchin, Joachim Gudmundsson, Antonia Kalb +4
Given a point set in the Euclidean plane and a parameter , we define an \emph{oriented -spanner} as an oriented subgraph of the complete bi-directed graph such that f…
Twin-Distance-Hereditary Digraphs
Dominique Komander, Carolin Rehs
We investigate structural and algorithmic advantages of a directed version of the well-researched class of distance-hereditary graphs. Since the previously defined distance-heredit…
Computing Directed Steiner Path Covers
Frank Gurski, Dominique Komander, Carolin Rehs +2
In this article we consider the Directed Steiner Path Cover problem on directed co-graphs. Given a directed graph G=(V,E) and a subset T of V of so-called terminal vertices, the pr…