Stefan Hoffmann

Affiliations:
  • Heinrich-Heine-Universität Düsseldorf, Germany


According to our database1, Stefan Hoffmann authored at least 10 papers between 2012 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract).
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019
Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components - (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes.
Proceedings of the Operations Research Proceedings 2019, 2019

2018
Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements.
Inf. Process. Lett., 2018

Computing the metric dimension by decomposing graphs into extended biconnected components.
CoRR, 2018

2016
A linear time algorithm for metric dimension of cactus block graphs.
Theor. Comput. Sci., 2016

Minimum Power Range Assignment for Symmetric Connectivity in Sensor Networks with two Power Levels.
CoRR, 2016

Generic Route Repair: Augmenting Wireless Ad Hoc Sensor Networks for Local Connectivity.
Proceedings of the 15th ACM/IEEE International Conference on Information Processing in Sensor Networks, 2016

2013
Hierarchical Bipartition Routing for delivery guarantee in sparse wireless ad hoc sensor networks with obstacles.
CoRR, 2013

2012
Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete.
Proceedings of the Algorithms for Sensor Systems, 2012


  Loading...