Stefan Hoffmann

11 papers B 2C 1Journal 6Unranked 2
YearRankTypeTitle / Venue / Authors
2020 B conf
Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract).
SOFSEM
Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
2019 B conf
Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components - (Extended Abstract).
WALCOM
Duygu Vietz, Stefan Hoffmann, Egon Wanke
2019 — conf
Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes.
OR
Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
2018 J jnl
Computing the metric dimension by decomposing graphs into extended biconnected components.
CoRR
Duygu Vietz, Stefan Hoffmann, Egon Wanke
2018 J jnl
Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements.
Inf. Process. Lett.
Stefan Hoffmann, Thomas Kampermann, Egon Wanke
2016 J jnl
A linear time algorithm for metric dimension of cactus block graphs.
Theor. Comput. Sci.
Stefan Hoffmann, Alina Elterman, Egon Wanke
2016 — conf
Generic Route Repair: Augmenting Wireless Ad Hoc Sensor Networks for Local Connectivity.
IPSN
Stefan Hoffmann, Egon Wanke
2016 J jnl
Minimum Power Range Assignment for Symmetric Connectivity in Sensor Networks with two Power Levels.
CoRR
Stefan Hoffmann, Egon Wanke
2013 J jnl
Hierarchical Bipartition Routing for delivery guarantee in sparse wireless ad hoc sensor networks with obstacles.
CoRR
Daniel Gaußmann, Stefan Hoffmann, Egon Wanke
2013 J jnl
Metric Dimension for Gabriel Unit Disk Graphs is NP-Complete.
CoRR
Stefan Hoffmann, Egon Wanke
2012 C conf
Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete.
ALGOSENSORS
Stefan Hoffmann, Egon Wanke