Hans-Christoph Wirth

Publication Activity (10 Years)

Years Active: 1997-2010
Publications (10 Years): 0

Publications

Joachim Spoerhase, Hans-Christoph Wirth
Relaxed voting and competitive location under monotonous gain functions on trees. Discret. Appl. Math. 158 (4) (2010)
Joachim Spoerhase, Hans-Christoph Wirth
(r, p)-centroid problems on paths and trees. Theor. Comput. Sci. 410 (47-49) (2009)
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) (2009)
Joachim Spoerhase, Hans-Christoph Wirth
)-medianoid problem on trees. Inf. Process. Lett. 109 (8) (2009)
Joachim Spoerhase, Hans-Christoph Wirth
)-Centroid on a Path. CTW (2008)
Hartmut Noltemeier, Joachim Spoerhase, Hans-Christoph Wirth
Multiple voting location and single voting location on trees. Eur. J. Oper. Res. 181 (2) (2007)
Joachim Spoerhase, Hans-Christoph Wirth
Relaxed voting and competitive location on trees under monotonous gain functions. CTW (2007)
Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
Optimizing cost flows by edge cost and capacity upgrade. J. Discrete Algorithms 2 (4) (2004)
Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth
Budgeted Maximum Graph Coverage. WG (2002)
Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
On the flow cost lowering problem. Eur. J. Oper. Res. 137 (2) (2002)
Hans-Christoph Wirth, Jan Steffan
Reload cost problems: minimum diameter spanning tree. Discret. Appl. Math. 113 (1) (2001)
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
Upgrading bottleneck constrained forests. Discret. Appl. Math. 108 (1-2) (2001)
Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth
Multiple Hotlink Assignment. WG (2001)
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) (2001)
Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
Optimizing Cost Flows by Modifying Arc Costs and Capacities. WG (2000)
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) (1999)
Hans-Christoph Wirth, Jan Steffan
On Minimum Diameter Spanning Trees under Reload Costs. WG (1999)
Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth
Euler is Standing in Line. WG (1999)
Hartmut Noltemeier, Hans-Christoph Wirth, Sven Oliver Krumke
Network Design and Improvement. ACM Comput. Surv. 31 (3es) (1999)
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) (1999)
Sven Oliver Krumke, Hans-Christoph Wirth
On the Minimum Label Spanning Tree Problem. Inf. Process. Lett. 66 (2) (1998)
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
Upgrading Bottleneck Constrained Forests. WG (1998)
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)