3 citations · 11 across the 10 of their papers we have counts for
13 papers
Geodetic sets for directed acyclic planar geodetic graphs
Benedikt G. Hein, Egon Wanke
A set of vertices of a directed graph is geodetic if every vertex of lies on a shortest path from a vertex of to a vertex of . A directed graph is geodetic if th…
The directed metric dimension of directed co-graphs
Yannick Schmitz, Egon Wanke
A vertex resolves two vertices and in a directed graph if the distance from to is different to the distance from to . A set of vertices is a reso…
On the strong metric dimension of composed graphs
Marcel Wagner, Yannick Schmitz, Egon Wanke
Two vertices and of an undirected graph are strongly resolved by a vertex if there is a shortest path between and containing or a shortest path between…
On the Strong Metric Dimension of directed co-graphs
Yannick Schmitz, Egon Wanke
Let be a strongly connected directed graph and be three vertices. Then strongly resolves to if there is a shortest --path containing or a…
A note on the complexity of k-Metric Dimension
Yannick Schmitz, Duygu Vietz, Egon Wanke
Two vertices of an undirected connected graph are resolved by a vertex if the distance between and and the distance between and are diffe…
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…
The Fault-Tolerant Metric Dimension of Cographs
Duygu Vietz, Egon Wanke
A vertex set of an undirected graph is a \textit{resolving set} for if for every two distinct vertices there is a vertex such th…
Computing the metric dimension by decomposing graphs into extended biconnected components
Duygu Vietz, Stefan Hoffmann, Egon Wanke
A vertex set of an undirected graph is a for , if for every two distinct vertices there is a vertex such…
Minimum Power Range Assignment for Symmetric Connectivity in Sensor Networks with two Power Levels
Stefan Hoffmann, Egon Wanke
This paper examines the problem of assigning a transmission power to every node of a wireless sensor network. The goal is to minimize the total power consumption while ensuring tha…
Integer Programming Models and Parameterized Algorithms for Controlling Palletizers
Frank Gurski, Jochen Rethmann, Egon Wanke
We study the combinatorial FIFO Stack-Up problem, where bins have to be stacked-up from conveyor belts onto pallets. Given k sequences of labeled bins and a positive integer p, the…
Hierarchical Bipartition Routing for delivery guarantee in sparse wireless ad hoc sensor networks with obstacles
Daniel Gaußmann, Stefan Hoffmann, Egon Wanke
We introduce and evaluate a very simple landmark-based network partition technique called Hierarchical Bipartition Routing (HBR) to support routing with delivery guarantee in wirel…
Complexity of the FIFO Stack-Up Problem
Frank Gurski, Jochen Rethmann, Egon Wanke
We study the combinatorial FIFO stack-up problem. In delivery industry, bins have to be stacked-up from conveyor belts onto pallets with respect to customer orders. Given k sequenc…
Metric Dimension for Gabriel Unit Disk Graphs is NP-Complete
Stefan Hoffmann, Egon Wanke
We show that finding a minimal number of landmark nodes for a unique virtual addressing by hop-distances in wireless ad-hoc sensor networks is NP-complete even if the networks are…