Joachim Spoerhase

Martin Fink, Jan-Henrik Haunert, André Schulz, Joachim Spoerhase, Alexander Wolff: Algorithms for Labeling Focus Regions. IEEE Trans. Vis. Comput. Graph. 18(12): 2583-2592 (2012)

Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff: Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. WALCOM 2012: 186-197

Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff: Polylogarithmic Approximation for Generalized Minimum Manhattan Networks. CoRR abs/1203.6481 (2012)

Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff: Approximating Minimum Manhattan Networks in Higher Dimensions. ESA 2011: 49-60

Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff: Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. Graph Drawing 2011: 441-442

Martin Fink, Joachim Spoerhase: Maximum Betweenness Centrality: Approximability and Tractable Cases. WALCOM 2011: 9-20

Nadine Schwartges, Joachim Spoerhase, Alexander Wolff: Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. WAOA 2011: 77-88

Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff: Approximating Minimum Manhattan Networks in Higher Dimensions. CoRR abs/1107.0901 (2011)

Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff: Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. CoRR abs/1107.4970 (2011)

Joachim Spoerhase: Competitive and voting location. Julius Maximilian University of Würzburg 2010

Joachim Spoerhase, Hans-Christoph Wirth: Relaxed voting and competitive location under monotonous gain functions on trees. Discrete Applied Mathematics 158(4): 361-373 (2010)

Joachim Spoerhase: An Optimal Algorithm for the Indirect Covering Subtree Problem. CTW 2010: 157-161

Joachim Spoerhase: An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems. ISAAC (1) 2010: 440-450

Joachim Spoerhase: An Optimal Algorithm for the Indirect Covering Subtree Problem. CoRR abs/1002.0580 (2010)

Martin Fink, Joachim Spoerhase: Maximum Betweenness Centrality: Approximability and Tractable Cases. CoRR abs/1008.3503 (2010)

Joachim Spoerhase, Hans-Christoph Wirth: An O(n(logn)²/loglogn) algorithm for the single maximum coverage location or the (1, X_p)-medianoid problem on trees. Inf. Process. Lett. 109(8): 391-394 (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): 256-266 (2009)

Joachim Spoerhase, Hans-Christoph Wirth: (r, p)-centroid problems on paths and trees. Theor. Comput. Sci. 410(47-49): 5128-5137 (2009)

Martin Knauer, Joachim Spoerhase: Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem. WADS 2009: 459-470

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

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)

Joachim Spoerhase, Hans-Christoph Wirth: Relaxed voting and competitive location on trees under monotonous gain functions. CTW 2007: 137-140