| 2009 | ||
|---|---|---|
| 6 | Martin Knauer, Joachim Spoerhase: Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem. WADS 2009: 459-470 | |
| 5 | 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) | |
| 4 | 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 | ||
| 3 | Joachim Spoerhase, Hans-Christoph Wirth: Approximating (r, p)-Centroid on a Path. CTW 2008: 193-195 | |
| 2007 | ||
| 2 | Joachim Spoerhase, Hans-Christoph Wirth: Relaxed voting and competitive location on trees under monotonous gain functions. CTW 2007: 137-140 | |
| 1 | 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) | |
| 1 | Martin Knauer | [6] |
| 2 | Hartmut Noltemeier | [1] |
| 3 | Hans-Christoph Wirth | [1] [2] [3] [4] [5] |