Hans-Christoph Wirth

24 papers A* 1B 6C 2Journal 14
YearRankTypeTitle / Venue / Authors
2010 J jnl
Relaxed voting and competitive location under monotonous gain functions on trees.
Discret. Appl. Math.
Joachim Spoerhase, Hans-Christoph Wirth
2009 J jnl
(r, p)-centroid problems on paths and trees.
Theor. Comput. Sci.
Joachim Spoerhase, Hans-Christoph Wirth
2009 J jnl
An O(n(logn)
Inf. Process. Lett.
Joachim Spoerhase, Hans-Christoph Wirth
2009 J jnl
Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree.
J. Discrete Algorithms
Joachim Spoerhase, Hans-Christoph Wirth
2008 C conf
Approximating (
CTW
Joachim Spoerhase, Hans-Christoph Wirth
2007 J jnl
Multiple voting location and single voting location on trees.
Eur. J. Oper. Res.
Hartmut Noltemeier, Joachim Spoerhase, Hans-Christoph Wirth
2007 C conf
Relaxed voting and competitive location on trees under monotonous gain functions.
CTW
Joachim Spoerhase, Hans-Christoph Wirth
2004 J jnl
Optimizing cost flows by edge cost and capacity upgrade.
J. Discrete Algorithms
Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
2002 B conf
Budgeted Maximum Graph Coverage.
WG
Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth
2002 J jnl
On the flow cost lowering problem.
Eur. J. Oper. Res.
Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
2001 J jnl
Euler is standing in line dial-a-ride problems with precedence-constraints.
Discret. Appl. Math.
Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth
2001 — —
Multicriteria Approximation of Network Design and Network Upgrade Problems (Mehrkriterien-Approximation von Netzwerk-Design- und Netzwerk-Ausbau-Problemen)
Hans-Christoph Wirth
2001 B conf
Multiple Hotlink Assignment.
WG
Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth
2001 J jnl
Reload cost problems: minimum diameter spanning tree.
Discret. Appl. Math.
Hans-Christoph Wirth, Jan Steffan
2001 J jnl
Upgrading bottleneck constrained forests.
Discret. Appl. Math.
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
2000 B conf
Optimizing Cost Flows by Modifying Arc Costs and Capacities.
WG
Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
1999 B conf
Euler is Standing in Line.
WG
Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth
1999 J jnl
Improving Minimum Cost Spanning Trees by Upgrading Nodes.
J. Algorithms
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
1999 J jnl
Improving Spanning Trees by Upgrading Nodes.
Theor. Comput. Sci.
Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
1999 J jnl
Network Design and Improvement.
ACM Comput. Surv.
Hartmut Noltemeier, Hans-Christoph Wirth, Sven Oliver Krumke
1999 B conf
On Minimum Diameter Spanning Trees under Reload Costs.
WG
Hans-Christoph Wirth, Jan Steffan
1998 J jnl
On the Minimum Label Spanning Tree Problem.
Inf. Process. Lett.
Sven Oliver Krumke, Hans-Christoph Wirth
1998 B conf
Upgrading Bottleneck Constrained Forests.
WG
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
1997 A* conf
Improving Spanning Trees by Upgrading Nodes.
ICALP
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth