Joachim Spoerhase
Cited by
Cited by
Multiple voting location and single voting location on trees
H Noltemeier, J Spoerhase, HC Wirth
European journal of operational research 181 (2), 654-667, 2007
Specialized heuristics for the controller placement problem in large scale SDN networks
S Lange, S Gebert, J Spoerhase, P Rygielski, T Zinner, S Kounev, ...
2015 27th International Teletraffic Congress, 210-218, 2015
Algorithms for labeling focus regions
M Fink, JH Haunert, A Schulz, J Spoerhase, A Wolff
IEEE Transactions on Visualization and Computer Graphics 18 (12), 2583-2592, 2012
Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems
J Byrka, K Fleszar, B Rybicki, J Spoerhase
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
Selecting the aspect ratio of a scatter plot based on its delaunay triangulation
M Fink, JH Haunert, J Spoerhase, A Wolff
IEEE transactions on visualization and computer graphics 19 (12), 2326-2335, 2013
(r, p)-centroid problems on paths and trees
J Spoerhase, HC Wirth
Theoretical computer science 410 (47-49), 5128-5137, 2009
Better approximation algorithms for the maximum internal spanning tree problem
M Knauer, J Spoerhase
Algorithmica 71 (4), 797-811, 2015
On monotone drawings of trees
P Kindermann, A Schulz, J Spoerhase, A Wolff
International Symposium on Graph Drawing, 488-500, 2014
Maximum betweenness centrality: approximability and tractable cases
M Fink, J Spoerhase
International Workshop on Algorithms and Computation, 9-20, 2011
Approximating the generalized minimum Manhattan network problem
A Das, K Fleszar, S Kobourov, J Spoerhase, S Veeramoni, A Wolff
International Symposium on Algorithms and Computation, 722-732, 2013
An improved approximation algorithm for knapsack median using sparsification
J Byrka, T Pensyl, B Rybicki, J Spoerhase, A Srinivasan, K Trinh
Algorithmica 80 (4), 1093-1114, 2018
Constant-factor approximation for ordered k-median
J Byrka, K Sornat, J Spoerhase
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
Colored non-crossing Euclidean Steiner forest
S Bereg, K Fleszar, P Kindermann, S Pupyrev, J Spoerhase, A Wolff
International Symposium on Algorithms and Computation, 429-441, 2015
Approximating minimum Manhattan networks in higher dimensions
A Das, ER Gansner, M Kaufmann, S Kobourov, J Spoerhase, A Wolff
Algorithmica 71 (1), 36-52, 2015
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
K Fleszar, M Mnich, J Spoerhase
Mathematical Programming 171 (1-2), 433--461, 2018
Improved approximation algorithms for box contact representations
MA Bekos, TC Van Dijk, M Fink, P Kindermann, S Kobourov, S Pupyrev, ...
Algorithmica 77 (3), 902-920, 2017
Approximation schemes for geometric coverage problems
S Chaplick, M De, A Ravsky, J Spoerhase
arXiv preprint arXiv:1607.06665, 2016
Approximating spanning trees with few branches
M Chimani, J Spoerhase
Theory of Computing Systems 56 (1), 181-196, 2015
Drawing graphs with vertices at specified positions and crossings at large angles
M Fink, JH Haunert, T Mchedlidze, J Spoerhase, A Wolff
International Workshop on Algorithms and Computation, 186-197, 2012
Approximation algorithms for the maximum leaf spanning tree problem on acyclic digraphs
N Schwartges, J Spoerhase, A Wolff
International Workshop on Approximation and Online Algorithms, 77-88, 2011
The system can't perform the operation now. Try again later.
Articles 1–20