J. Spoerhase

发表

Computing the Flip Distance of Triangulations

Fabian Lipp, J. Spoerhase, 2012 .

D S ] 2 8 Fe b 20 18 Constant-Factor Approximation for Ordered k-Median

J. Spoerhase, Krzysztof Sornat, 2018 .

Coloring Mixed and Directional Interval Graphs

A. Wolff, Johannes Zink, Ignaz Rutter, 2022, ArXiv.

Multiple voting location and single voting location on trees

Hans-Christoph Wirth, Hartmut Noltemeier, Joachim Spoerhase, 2007, Eur. J. Oper. Res..

Approximating Minimum Manhattan Networks in Higher Dimensions

Alexander Wolff, Michael Kaufmann, Stephen G. Kobourov, 2013, Algorithmica.

Competitive and voting location

Joachim Spoerhase, J. Spoerhase, 2010 .

(r, P)-centroid Problems on Paths and Trees

Hans-Christoph Wirth, Joachim Spoerhase, J. Spoerhase, 2009, Theor. Comput. Sci..

A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs pdf

Markus Chimani, Joachim Spoerhase, Stephan Beyer, 2018, COCOON.

On Minimum Generalized Manhattan Connections pdf

Antonios Antoniadis, Parinya Chalermsook, Joachim Spoerhase, 2020, WADS.

Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter pdf

Matthias Mnich, Parinya Chalermsook, Joachim Spoerhase, 2021, ArXiv.

Improved Approximation Algorithms for Box Contact Representations

Alexander Wolff, Michael A. Bekos, Stephen G. Kobourov, 2014, Algorithmica.

Improved Approximation Algorithms 1 for Semantic Word Clouds

Alexander Wolff, Michael A. Bekos, Martin Fink, 2013 .

Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks

Stanislav Lange, Phuoc Tran-Gia, Piotr Rygielski, 2015, 2015 27th International Teletraffic Congress.

Parameterized Approximation Schemes for Clustering with General Norm Objectives

D. Marx, J. Byrka, J. Spoerhase, 2023, ArXiv.

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces

D. Marx, J. Byrka, J. Spoerhase, 2023, arXiv.org.

Constant-factor approximation for ordered k-median

Jaroslaw Byrka, Joachim Spoerhase, Krzysztof Sornat, 2017, STOC.

New algorithms for maximum disjoint paths based on tree-likeness

Matthias Mnich, Joachim Spoerhase, Krzysztof Fleszar, 2016, Mathematical Programming.

Colored Non-crossing Euclidean Steiner Forest

Alexander Wolff, Sergey Bereg, Philipp Kindermann, 2015, ISAAC.

Hypergraph Representation via Axis-Aligned Point-Subspace Cover

J. Spoerhase, Oksana Firman, 2021, Workshop on Algorithms and Computation.

An Improved Approximation Algorithm for Knapsack Median Using Sparsification

Aravind Srinivasan, Jaroslaw Byrka, Joachim Spoerhase, 2018, Algorithmica.

Approximation and Online Algorithms

Markus Chimani, Joachim Spoerhase, Markus Chimani, 2012, Lecture Notes in Computer Science.

Consistent Simplification of Polyline Tree Bundles

Sabine Storandt, Johannes Zink, Joachim Spoerhase, 2021, COCOON.

Simplification of Polyline Bundles

Sabine Storandt, Johannes Zink, Joachim Spoerhase, 2019, SWAT.

Independent set in k-Claw-Free Graphs: Conditional χ-boundedness and the Power of LP/SDP Relaxations

J. Spoerhase, Parinya Chalermsook, K. Khodamoradi, 2023, ArXiv.

Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation

Alexander Wolff, Jan-Henrik Haunert, Martin Fink, 2013, IEEE Transactions on Visualization and Computer Graphics.

A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints pdf

Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal, 2018, ICALP.

Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems

Jaroslaw Byrka, Joachim Spoerhase, Bartosz Rybicki, 2013, SODA.

Approximating Spanning Trees with Few Branches

Markus Chimani, J. Spoerhase, 2012, Theory of Computing Systems.

Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem

J. Spoerhase, Martin Knauer, 2009, Algorithmica.