default search action
Stefan Hoffmann 0002
Person information
- affiliation: Heinrich-Heine-Universität Düsseldorf, Germany
Other persons with the same name
- Stefan Hoffmann — disambiguation page
- Stefan Hoffmann 0001
— University of Trier, Germany
- Stefan Hoffmann 0003 — Cologne University of Applied Sciences, Germany
- Stefan Hoffmann 0004 (aka: Stefan G. Hoffmann) — Hochschule Ruhr West, Institute of Computer Science, Bottrop, Germany
- Stefan Hoffmann 0005 — Oregon Health Science University, Portland, OR, USA
- Stefan Hoffmann 0006
- Stefan Hoffmann 0007 — Friedrich Schiller University Jena, Germany
- Stefan Hoffmann 0008 (aka: Stefan H. Hoffmann) — mediri GmbH, Heidelberg, Germany (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c5]Frank Gurski
Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract). SOFSEM 2020: 556-565
2010 – 2019
- 2019
- [c4]Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke:
Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes. OR 2019: 331-338 - [c3]Duygu Vietz
Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components - (Extended Abstract). WALCOM 2019: 175-187 - 2018
- [j2]Stefan Hoffmann, Thomas Kampermann
Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements. Inf. Process. Lett. 136: 25-29 (2018) - [i4]Duygu Vietz, Stefan Hoffmann, Egon Wanke:
Computing the metric dimension by decomposing graphs into extended biconnected components. CoRR abs/1806.10389 (2018) - 2016
- [j1]Stefan Hoffmann, Alina Elterman, Egon Wanke:
A linear time algorithm for metric dimension of cactus block graphs. Theor. Comput. Sci. 630: 43-62 (2016) - [c2]Stefan Hoffmann, Egon Wanke:
Generic Route Repair: Augmenting Wireless Ad Hoc Sensor Networks for Local Connectivity. IPSN 2016: 12:1-12:10 - [i3]Stefan Hoffmann, Egon Wanke:
Minimum Power Range Assignment for Symmetric Connectivity in Sensor Networks with two Power Levels. CoRR abs/1605.01752 (2016) - 2013
- [i2]Stefan Hoffmann, Egon Wanke:
Metric Dimension for Gabriel Unit Disk Graphs is NP-Complete. CoRR abs/1306.2187 (2013) - [i1]Daniel Gaußmann, Stefan Hoffmann, Egon Wanke:
Hierarchical Bipartition Routing for delivery guarantee in sparse wireless ad hoc sensor networks with obstacles. CoRR abs/1307.1994 (2013) - 2012
- [c1]Stefan Hoffmann, Egon Wanke:
Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete. ALGOSENSORS 2012: 90-92
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-04 23:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: