팔로우
Joachim Spoerhase
Joachim Spoerhase
Department of Computer Science, University of Sheffield, UK
sheffield.ac.uk의 이메일 확인됨 - 홈페이지
제목
인용
인용
연도
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
702015
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
602012
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
592014
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
562007
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
372013
Better approximation algorithms for the maximum internal spanning tree problem
M Knauer, J Spoerhase
Algorithmica 71 (4), 797-811, 2015
33*2015
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
312018
Maximum betweenness centrality: approximability and tractable cases
M Fink, J Spoerhase
International Workshop on Algorithms and Computation, 9-20, 2011
312011
(r, p)-centroid problems on paths and trees
J Spoerhase, HC Wirth
Theoretical computer science 410 (47-49), 5128-5137, 2009
252009
On monotone drawings of trees
P Kindermann, A Schulz, J Spoerhase, A Wolff
Graph Drawing: 22nd International Symposium, GD 2014, Würzburg, Germany …, 2014
242014
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
K Fleszar, M Mnich, J Spoerhase
Mathematical Programming 171 (1-2), 433--461, 2018
222018
Approximating the generalized minimum Manhattan network problem
A Das, K Fleszar, S Kobourov, J Spoerhase, S Veeramoni, A Wolff
Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong …, 2013
20*2013
An improved approximation algorithm for knapsack median using sparsification
J Byrka, T Pensyl, B Rybicki, J Spoerhase, A Srinivasan, K Trinh
Algorithmica 80, 1093-1114, 2018
182018
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
132015
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
122015
Stabbing rectangles by line segments-how decomposition reduces the shallow-cell complexity
TM Chan, TC Van Dijk, K Fleszar, J Spoerhase, A Wolff
arXiv preprint arXiv:1806.02851, 2018
102018
Improved approximation algorithms for box contact representations
MA Bekos, TC van Dijk, M Fink, P Kindermann, S Kobourov, S Pupyrev, ...
Algorithmica 77, 902-920, 2017
102017
Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees
M Chimani, J Spoerhase
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
102015
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
102011
Approximation schemes for geometric coverage problems
S Chaplick, M De, A Ravsky, J Spoerhase
26th Annual European Symposium on Algorithms (ESA 2018), 2018
92018
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20