default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHans-Christoph Wirth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j14]Joachim Spoerhase
, Hans-Christoph Wirth:
Relaxed voting and competitive location under monotonous gain functions on trees. Discret. Appl. Math. 158(4): 361-373 (2010)
2000 – 2009
- 2009
- [j13]Joachim Spoerhase, Hans-Christoph Wirth:
An O(n(logn)2/loglogn) algorithm for the single maximum coverage location or the (1, Xp)-medianoid problem on trees. Inf. Process. Lett. 109(8): 391-394 (2009) - [j12]Joachim Spoerhase, Hans-Christoph Wirth:
Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree. J. Discrete Algorithms 7(2): 256-266 (2009) - [j11]Joachim Spoerhase, Hans-Christoph Wirth:
(r, p)-centroid problems on paths and trees. Theor. Comput. Sci. 410(47-49): 5128-5137 (2009) - 2008
- [c9]Joachim Spoerhase, Hans-Christoph Wirth:
Approximating (r, p)-Centroid on a Path. CTW 2008: 193-195 - 2007
- [j10]Hartmut Noltemeier, Joachim Spoerhase, Hans-Christoph Wirth:
Multiple voting location and single voting location on trees. Eur. J. Oper. Res. 181(2): 654-667 (2007) - [c8]Joachim Spoerhase, Hans-Christoph Wirth:
Relaxed voting and competitive location on trees under monotonous gain functions. CTW 2007: 137-140 - 2004
- [j9]Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth:
Optimizing cost flows by edge cost and capacity upgrade. J. Discrete Algorithms 2(4): 407-423 (2004) - 2002
- [j8]Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth:
On the flow cost lowering problem. Eur. J. Oper. Res. 137(2): 265-271 (2002) - [c7]Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth:
Budgeted Maximum Graph Coverage. WG 2002: 321-332 - 2001
- [b1]Hans-Christoph Wirth:
Multicriteria Approximation of Network Design and Network Upgrade Problems (Mehrkriterien-Approximation von Netzwerk-Design- und Netzwerk-Ausbau-Problemen). Würzburg University, Germany, 2001 - [j7]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth:
Upgrading bottleneck constrained forests. Discret. Appl. Math. 108(1-2): 129-142 (2001) - [j6]Hans-Christoph Wirth, Jan Steffan:
Reload cost problems: minimum diameter spanning tree. Discret. Appl. Math. 113(1): 73-85 (2001) - [j5]Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth:
Euler is standing in line dial-a-ride problems with precedence-constraints. Discret. Appl. Math. 113(1): 87-107 (2001) - [c6]Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth:
Multiple Hotlink Assignment. WG 2001: 189-200 - 2000
- [c5]Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth:
Optimizing Cost Flows by Modifying Arc Costs and Capacities. WG 2000: 116-126
1990 – 1999
- 1999
- [j4]Hartmut Noltemeier, Hans-Christoph Wirth, Sven Oliver Krumke:
Network Design and Improvement. ACM Comput. Surv. 31(3es): 2 (1999) - [j3]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth:
Improving Minimum Cost Spanning Trees by Upgrading Nodes. J. Algorithms 33(1): 92-111 (1999) - [j2]Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth:
Improving Spanning Trees by Upgrading Nodes. Theor. Comput. Sci. 221(1-2): 139-155 (1999) - [c4]Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth:
Euler is Standing in Line. WG 1999: 42-54 - [c3]Hans-Christoph Wirth, Jan Steffan:
On Minimum Diameter Spanning Trees under Reload Costs. WG 1999: 78-88 - 1998
- [j1]Sven Oliver Krumke, Hans-Christoph Wirth:
On the Minimum Label Spanning Tree Problem. Inf. Process. Lett. 66(2): 81-85 (1998) - [c2]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth:
Upgrading Bottleneck Constrained Forests. WG 1998: 215-226 - 1997
- [c1]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth:
Improving Spanning Trees by Upgrading Nodes. ICALP 1997: 281-291
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 2024-04-24 23:04 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:
