On the Minimum Label Spanning Tree Problem. - Sven Oliver Krumke; Hans-Christoph Wirth (Inf. Process. Lett., 1998)

Euler is Standing in Line. - Dietrich Hauptmeier; Sven Oliver Krumke; Jörg Rambau; Hans-Christoph Wirth (WG, 1999)

On Minimum Diameter Spanning Trees under Reload Costs. - Hans-Christoph Wirth; Jan Steffan (WG, 1999)

Network Design and Improvement. - Hartmut Noltemeier; Hans-Christoph Wirth; Sven Oliver Krumke (ACM Comput. Surv., 1999)

Improving Minimum Cost Spanning Trees by Upgrading Nodes. - Sven Oliver Krumke; Madhav V. Marathe; Hartmut Noltemeier; R. Ravi 001; S. S. Ravi; Ravi Sundaram; Hans-Christoph Wirth (J. Algorithms, 1999)

Improving Spanning Trees by Upgrading Nodes. - Sven Oliver Krumke; Hartmut Noltemeier; Madhav V. Marathe; R. Ravi 001; S. S. Ravi; Ravi Sundaram; Hans-Christoph Wirth (Theor. Comput. Sci., 1999)

Optimizing Cost Flows by Modifying Arc Costs and Capacities. - Ingo Demgensky; Hartmut Noltemeier; Hans-Christoph Wirth (WG, 2000)

Multiple Hotlink Assignment. - Sven Fuhrmann; Sven Oliver Krumke; Hans-Christoph Wirth (WG, 2001)

Euler is standing in line dial-a-ride problems with precedence-constraints. - Dietrich Hauptmeier; Sven Oliver Krumke; Jörg Rambau; Hans-Christoph Wirth (Discret. Appl. Math., 2001)

Upgrading bottleneck constrained forests. - Sven Oliver Krumke; Madhav V. Marathe; Hartmut Noltemeier; S. S. Ravi; Hans-Christoph Wirth (Discret. Appl. Math., 2001)

Reload cost problems: minimum diameter spanning tree. - Hans-Christoph Wirth; Jan Steffan (Discret. Appl. Math., 2001)

Multicriteria Approximation of Network Design and Network Upgrade Problems (Mehrkriterien-Approximation von Netzwerk-Design- und Netzwerk-Ausbau-Problemen) - Hans-Christoph Wirth (2001)

Budgeted Maximum Graph Coverage. - Sven Oliver Krumke; Madhav V. Marathe; Diana Poensgen; S. S. Ravi; Hans-Christoph Wirth (WG, 2002)

On the flow cost lowering problem. - Ingo Demgensky; Hartmut Noltemeier; Hans-Christoph Wirth (Eur. J. Oper. Res., 2002)

Optimizing cost flows by edge cost and capacity upgrade. - Ingo Demgensky; Hartmut Noltemeier; Hans-Christoph Wirth (J. Discrete Algorithms, 2004)

Relaxed voting and competitive location on trees under monotonous gain functions. - Joachim Spoerhase; Hans-Christoph Wirth (CTW, 2007)

Multiple voting location and single voting location on trees. - Hartmut Noltemeier; Joachim Spoerhase; Hans-Christoph Wirth (Eur. J. Oper. Res., 2007)

Approximating (r, p)-Centroid on a Path. - Joachim Spoerhase; Hans-Christoph Wirth (CTW, 2008)

An O(n(logn)2/loglogn) algorithm for the single maximum coverage location or the (1, Xp)-medianoid problem on trees. - Joachim Spoerhase; Hans-Christoph Wirth (Inf. Process. Lett., 2009)

Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree. - Joachim Spoerhase; Hans-Christoph Wirth (J. Discrete Algorithms, 2009)

(r, p)-centroid problems on paths and trees. - Joachim Spoerhase; Hans-Christoph Wirth (Theor. Comput. Sci., 2009)

Relaxed voting and competitive location under monotonous gain functions on trees. - Joachim Spoerhase; Hans-Christoph Wirth (Discret. Appl. Math., 2010)