Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete. - Stefan Hoffmann 002; Egon Wanke (ALGOSENSORS, 2012)

Hierarchical Bipartition Routing for delivery guarantee in sparse wireless ad hoc sensor networks with obstacles. - Daniel Gaußmann; Stefan Hoffmann 002; Egon Wanke (CoRR, 2013)

Generic Route Repair: Augmenting Wireless Ad Hoc Sensor Networks for Local Connectivity. - Stefan Hoffmann 002; Egon Wanke (IPSN, 2016)

Minimum Power Range Assignment for Symmetric Connectivity in Sensor Networks with two Power Levels. - Stefan Hoffmann 002; Egon Wanke (CoRR, 2016)

A linear time algorithm for metric dimension of cactus block graphs. - Stefan Hoffmann 002; Alina Elterman; Egon Wanke (Theor. Comput. Sci., 2016)

Computing the metric dimension by decomposing graphs into extended biconnected components. - Duygu Vietz; Stefan Hoffmann 002; Egon Wanke (CoRR, 2018)

Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements. - Stefan Hoffmann 002; Thomas Kampermann; Egon Wanke (Inf. Process. Lett., 2018)

Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes. - Frank Gurski; Stefan Hoffmann 002; Dominique Komander; Carolin Rehs; Jochen Rethmann; Egon Wanke (OR, 2019)

Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components - (Extended Abstract). - Duygu Vietz; Stefan Hoffmann 002; Egon Wanke (WALCOM, 2019)

Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract). - Frank Gurski; Stefan Hoffmann 002; Dominique Komander; Carolin Rehs; Jochen Rethmann; Egon Wanke (SOFSEM, 2020)