 | 2009 |
|---|
| 20 |       | 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) |
| 19 | | 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) |
| 2008 |
|---|
| 18 |  | Joachim Spoerhase,
Hans-Christoph Wirth:
Approximating (r, p)-Centroid on a Path.
CTW 2008: 193-195 |
| 2007 |
|---|
| 17 | | Joachim Spoerhase,
Hans-Christoph Wirth:
Relaxed voting and competitive location on trees under monotonous gain functions.
CTW 2007: 137-140 |
| 16 | | Hartmut Noltemeier,
Joachim Spoerhase,
Hans-Christoph Wirth:
Multiple voting location and single voting location on trees.
European Journal of Operational Research 181(2): 654-667 (2007) |
| 2004 |
|---|
| 15 | | 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 |
|---|
| 14 | | Sven Oliver Krumke,
Madhav V. Marathe,
Diana Poensgen,
S. S. Ravi,
Hans-Christoph Wirth:
Budgeted Maximum Graph Coverage.
WG 2002: 321-332 |
| 2001 |
|---|
| 13 | | Sven Fuhrmann,
Sven Oliver Krumke,
Hans-Christoph Wirth:
Multiple Hotlink Assignment.
WG 2001: 189-200 |
| 12 | | Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
S. S. Ravi,
Hans-Christoph Wirth:
Upgrading bottleneck constrained forests.
Discrete Applied Mathematics 108(1-2): 129-142 (2001) |
| 11 | | Hans-Christoph Wirth,
Jan Steffan:
Reload cost problems: minimum diameter spanning tree.
Discrete Applied Mathematics 113(1): 73-85 (2001) |
| 10 | | Dietrich Hauptmeier,
Sven Oliver Krumke,
Jörg Rambau,
Hans-Christoph Wirth:
Euler is standing in line dial-a-ride problems with precedence-constraints.
Discrete Applied Mathematics 113(1): 87-107 (2001) |
| 2000 |
|---|
| 9 | | Ingo Demgensky,
Hartmut Noltemeier,
Hans-Christoph Wirth:
Optimizing Cost Flows by Modifying Arc Costs and Capacities.
WG 2000: 116-126 |
| 1999 |
|---|
| 8 | | Dietrich Hauptmeier,
Sven Oliver Krumke,
Jörg Rambau,
Hans-Christoph Wirth:
Euler is Standing in Line.
WG 1999: 42-54 |
| 7 | | Hans-Christoph Wirth,
Jan Steffan:
On Minimum Diameter Spanning Trees under Reload Costs.
WG 1999: 78-88 |
| 6 | | Hartmut Noltemeier,
Hans-Christoph Wirth,
Sven Oliver Krumke:
Network Design and Improvement.
ACM Comput. Surv. 31(3es): 2 (1999) |
| 5 | | 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) |
| 4 | | 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) |
| 1998 |
|---|
| 3 | | Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
S. S. Ravi,
Hans-Christoph Wirth:
Upgrading Bottleneck Constrained Forests.
WG 1998: 215-226 |
| 2 | | Sven Oliver Krumke,
Hans-Christoph Wirth:
On the Minimum Label Spanning Tree Problem.
Inf. Process. Lett. 66(2): 81-85 (1998) |
| 1997 |
|---|
| 1 | | 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 |
