Relaxed voting and competitive location on trees under monotonous gain functions. - Joachim Spoerhase; Hans-Christoph Wirth (CTW, 2007)

Multiple voting location and single voting location on trees. - Hartmut Noltemeier; Joachim Spoerhase; Hans-Christoph Wirth (Eur. J. Oper. Res., 2007)

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

An O(n(logn)2/loglogn) algorithm for the single maximum coverage location or the (1, Xp)-medianoid problem on trees. - Joachim Spoerhase; Hans-Christoph Wirth (Inf. Process. Lett., 2009)

Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree. - Joachim Spoerhase; Hans-Christoph Wirth (J. Discrete Algorithms, 2009)

(r, p)-centroid problems on paths and trees. - Joachim Spoerhase; Hans-Christoph Wirth (Theor. Comput. Sci., 2009)

An Optimal Algorithm for the Indirect Covering Subtree Problem. - Joachim Spoerhase (CTW, 2010)

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

Relaxed voting and competitive location under monotonous gain functions on trees. - Joachim Spoerhase; Hans-Christoph Wirth (Discret. Appl. Math., 2010)

Competitive and voting location. - Joachim Spoerhase (2010)

Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. - Martin Fink 001; Jan-Henrik Haunert; Tamara Mchedlidze; Joachim Spoerhase; Alexander Wolff 001 (GD, 2011)

Maximum Betweenness Centrality: Approximability and Tractable Cases. - Martin Fink 001; Joachim Spoerhase (WALCOM, 2011)

Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. - Nadine Schwartges; Joachim Spoerhase; Alexander Wolff 001 (WAOA, 2011)

Polylogarithmic Approximation for Generalized Minimum Manhattan Networks - Aparna Das; Krzysztof Fleszar 001; Stephen G. Kobourov; Joachim Spoerhase; Sankar Veeramoni; Alexander Wolff 001 (CoRR, 2012)

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

Road segment selection with strokes and stability. - Thomas C. van Dijk; Krzysztof Fleszar 001; Jan-Henrik Haunert; Joachim Spoerhase (MapInteract, 2013)

A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median. - Jaroslaw Byrka; Krzysztof Fleszar 001; Bartosz Rybicki; Joachim Spoerhase (CoRR, 2013)

Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation. - Martin Fink 001; Jan-Henrik Haunert; Joachim Spoerhase; Alexander Wolff 001 (IEEE Trans. Vis. Comput. Graph., 2013)

On Monotone Drawings of Trees. - Philipp Kindermann; André Schulz 001; Joachim Spoerhase; Alexander Wolff 001 (GD, 2014)

Colored Non-crossing Euclidean Steiner Forest. - Sergey Bereg; Krzysztof Fleszar 001; Philipp Kindermann; Sergey Pupyrev; Joachim Spoerhase; Alexander Wolff 001 (ISAAC, 2015)

Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems. - Jaroslaw Byrka; Krzysztof Fleszar 001; Bartosz Rybicki; Joachim Spoerhase (SODA, 2015)

Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees. - Markus Chimani; Joachim Spoerhase (STACS, 2015)

Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks. - Stanislav Lange; Steffen Gebert; Joachim Spoerhase; Piotr Rygielski; Thomas Zinner; Samuel Kounev; Phuoc Tran-Gia (ITC, 2015)

Approximating Minimum Manhattan Networks in Higher Dimensions. - Aparna Das; Emden R. Gansner; Michael Kaufmann 001; Stephen G. Kobourov; Joachim Spoerhase; Alexander Wolff 001 (Algorithmica, 2015)

Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem. - Martin Knauer; Joachim Spoerhase (Algorithmica, 2015)

Approximating Spanning Trees with Few Branches. - Markus Chimani; Joachim Spoerhase (Theory Comput. Syst., 2015)

Improved Approximation Algorithms for Box Contact Representations. - Michael A. Bekos; Thomas C. van Dijk; Martin Fink 001; Philipp Kindermann; Stephen G. Kobourov; Sergey Pupyrev; Joachim Spoerhase; Alexander Wolff 001 (Algorithmica, 2017)

Approximation Schemes for Geometric Coverage Problems. - Steven Chaplick; Minati De; Alexander Ravsky; Joachim Spoerhase (ESA, 2018)

Brief Announcement: Approximation Schemes for Geometric Coverage Problems. - Steven Chaplick; Minati De; Alexander Ravsky; Joachim Spoerhase (ICALP, 2018)

Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. - Timothy M. Chan; Thomas C. van Dijk; Krzysztof Fleszar 001; Joachim Spoerhase; Alexander Wolff 001 (ISAAC, 2018)

Constant-factor approximation for ordered k-median. - Jaroslaw Byrka; Krzysztof Sornat; Joachim Spoerhase (STOC, 2018)

An Improved Approximation Algorithm for Knapsack Median Using Sparsification. - Jaroslaw Byrka; Thomas W. Pensyl; Bartosz Rybicki; Joachim Spoerhase; Aravind Srinivasan; Khoa Trinh (Algorithmica, 2018)

Approximating the Generalized Minimum Manhattan Network Problem. - Aparna Das; Krzysztof Fleszar 001; Stephen G. Kobourov; Joachim Spoerhase; Sankar Veeramoni; Alexander Wolff 001 (Algorithmica, 2018)

New algorithms for maximum disjoint paths based on tree-likeness. - Krzysztof Fleszar 001; Matthias Mnich; Joachim Spoerhase (Math. Program., 2018)

A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints. - Eyal Mizrachi; Roy Schwartz 002; Joachim Spoerhase; Sumedha Uniyal (ICALP, 2019)

A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs. - Stephan Beyer; Markus Chimani; Joachim Spoerhase (COCOON, 2020)

PTAS for Steiner Tree on Map Graphs. - Jaroslaw Byrka; Mateusz Lewandowski; Syed Mohammad Meesum; Joachim Spoerhase; Sumedha Uniyal (LATIN, 2020)

Simplification of Polyline Bundles. - Joachim Spoerhase; Sabine Storandt; Johannes Zink 001 (SWAT, 2020)

Approximating Node-Weighted k-MST on Planar Graphs. - Jaroslaw Byrka; Mateusz Lewandowski; Joachim Spoerhase (Theory Comput. Syst., 2020)

Consistent Simplification of Polyline Tree Bundles. - Yannick Bosch; Peter Schäfer; Joachim Spoerhase; Sabine Storandt; Johannes Zink 001 (COCOON, 2021)

On Minimum Generalized Manhattan Connections. - Antonios Antoniadis 001; Margarita Capretto; Parinya Chalermsook; Christoph Damerius; Peter Kling; Lukas Nölke; Nidia Obscura Acosta; Joachim Spoerhase (WADS, 2021)

Coloring Mixed and Directional Interval Graphs. - Grzegorz Gutowski; Florian Mittelstädt; Ignaz Rutter; Joachim Spoerhase; Alexander Wolff 001; Johannes Zink 001 (GD, 2022)

A Constant-Factor Approximation Algorithm for Reconciliation k-Median. - Joachim Spoerhase; Kamyar Khodamoradi; Benedikt Riegel; Bruno Ordozgoiti; Aristides Gionis (AISTATS, 2023)

Mind the Gap: Edge Facility Location Problems in Theory and Practice. - Moritz Beck 001; Joachim Spoerhase; Sabine Storandt (CALDAM, 2023)

Parameterized Approximation Schemes for Clustering with General Norm Objectives. - Fateme Abbasi; Sandip Banerjee; Jaroslaw Byrka; Parinya Chalermsook; Ameet Gadekar; Kamyar Khodamoradi; Dániel Marx; Roohani Sharma; Joachim Spoerhase (FOCS, 2023)

Independent Set in k-Claw-Free Graphs: Conditional χ-Boundedness and the Power of LP/SDP Relaxations. - Parinya Chalermsook; Ameet Gadekar; Kamyar Khodamoradi; Joachim Spoerhase (WAOA, 2023)

Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291). - Karthik C. S. 001; Parinya Chalermsook; Joachim Spoerhase; Meirav Zehavi; Martin G. Herold (Dagstuhl Reports, 2023)

Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. - Fateme Abbasi; Sandip Banerjee; Jaroslaw Byrka; Parinya Chalermsook; Ameet Gadekar; Kamyar Khodamoradi; Dániel Marx; Roohani Sharma; Joachim Spoerhase (ICALP, 2024)

SkelEx and BoundEx - Geometrical Framework for Interpretable ReLU Neural Networks. - Pawel Pukowski; Joachim Spoerhase; Haiping Lu (IJCNN, 2024)

Approximating TSP Variants Using a Bridge Lemma. - Martin Böhm 001; Zachary Friggstad; Tobias Mömke; Joachim Spoerhase (CoRR, 2024)

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. - Parinya Chalermsook; Matthias Kaul; Matthias Mnich; Joachim Spoerhase; Sumedha Uniyal; Daniel Vaz 001 (ACM Trans. Algorithms, 2024)

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions. - Martin G. Herold; Danupon Nanongkai; Joachim Spoerhase; Nithin Varma 001; Zihang Wu (SoCG, 2025)

Approximating Traveling Salesman Problems Using a Bridge Lemma. - Martin Böhm 001; Zachary Friggstad; Tobias Mömke; Joachim Spoerhase (SODA, 2025)

Clustering to Minimize Cluster-Aware Norm Objectives. - Martin G. Herold; Evangelos Kipouridis; Joachim Spoerhase (SODA, 2025)

Hypergraph Representation via Axis-Aligned Point-Subspace Cover. - Oksana Firman; Joachim Spoerhase (Discret. Math. Theor. Comput. Sci., 2025)