Joachim Spoerhase

According to our database, Joachim Spoerhase authored at least 53 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter.

Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz

ACM Trans. Algorithms, January, 2024

Clustering to Minimize Cluster-Aware Norm Objectives.

Martin G. Herold, Evangelos Kipouridis, Joachim Spoerhase

CoRR, 2024

Approximating TSP Variants Using a Bridge Lemma.

Martin Böhm, Zachary Friggstad, Tobias Mömke, Joachim Spoerhase

CoRR, 2024

SkelEx and BoundEx - Geometrical Framework for Interpretable ReLU Neural Networks.

Pawel Pukowski, Joachim Spoerhase, Haiping Lu

Proceedings of the International Joint Conference on Neural Networks, 2024

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

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291).

Karthik C. S., Parinya Chalermsook, Joachim Spoerhase, Meirav Zehavi, Martin G. Herold

Dagstuhl Reports, 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

Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 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

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Mind the Gap: Edge Facility Location Problems in Theory and Practice.

Moritz Beck, Joachim Spoerhase, Sabine Storandt

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

A Constant-Factor Approximation Algorithm for Reconciliation k-Median.

Joachim Spoerhase, Kamyar Khodamoradi, Benedikt Riegel, Bruno Ordozgoiti, Aristides Gionis

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

Hypergraph Representation via Axis-Aligned Point-Subspace Cover.

Oksana Firman, Joachim Spoerhase

Proceedings of the WALCOM: Algorithms and Computation, 2022

Coloring Mixed and Directional Interval Graphs.

Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021

On Minimum Generalized Manhattan Connections.

Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Consistent Simplification of Polyline Tree Bundles.

Yannick Bosch, Peter Schäfer, Joachim Spoerhase, Sabine Storandt, Johannes Zink

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

Approximating Node-Weighted k-MST on Planar Graphs.

Jaroslaw Byrka, Mateusz Lewandowski, Joachim Spoerhase

Theory Comput. Syst., 2020

Simplification of Polyline Bundles.

Joachim Spoerhase, Sabine Storandt, Johannes Zink

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

PTAS for Steiner Tree on Map Graphs.

Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

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

Stephan Beyer, Markus Chimani, Joachim Spoerhase

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

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

Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

New algorithms for maximum disjoint paths based on tree-likeness.

Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase

Math. Program., 2018

Approximating the Generalized Minimum Manhattan Network Problem.

Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff

Algorithmica, 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

Constant-factor approximation for ordered k-median.

Jaroslaw Byrka, Krzysztof Sornat, Joachim Spoerhase

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity.

Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Brief Announcement: Approximation Schemes for Geometric Coverage Problems.

Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Approximation Schemes for Geometric Coverage Problems.

Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Improved Approximation Algorithms for Box Contact Representations.

Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff

Algorithmica, 2017

2015

Approximating Spanning Trees with Few Branches.

Markus Chimani, Joachim Spoerhase

Theory Comput. Syst., 2015

Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem.

Martin Knauer, Joachim Spoerhase

Algorithmica, 2015

Approximating Minimum Manhattan Networks in Higher Dimensions.

Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff

Algorithmica, 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

Proceedings of the 27th International Teletraffic Congress, 2015

Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees.

Markus Chimani, Joachim Spoerhase

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Bi-Factor Approximation Algorithms for Hard Capacitated <i>k</i>-Median Problems.

Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Colored Non-crossing Euclidean Steiner Forest.

Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

On Monotone Drawings of Trees.

Philipp Kindermann, André Schulz, Joachim Spoerhase, Alexander Wolff

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

2013

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

Martin Fink, Jan-Henrik Haunert, Joachim Spoerhase, Alexander Wolff

IEEE Trans. Vis. Comput. Graph., 2013

A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median.

Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase

CoRR, 2013

Road segment selection with strokes and stability.

Thomas C. van Dijk, Krzysztof Fleszar, Jan-Henrik Haunert, Joachim Spoerhase

Proceedings of the MapInteract 2013, 2013

2012

Algorithms for Labeling Focus Regions.

Martin Fink, Jan-Henrik Haunert, André Schulz, Joachim Spoerhase, Alexander Wolff

IEEE Trans. Vis. Comput. Graph., 2012

Polylogarithmic Approximation for Generalized Minimum Manhattan Networks

Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff

CoRR, 2012

2011

Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs.

Nadine Schwartges, Joachim Spoerhase, Alexander Wolff

Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

Maximum Betweenness Centrality: Approximability and Tractable Cases.

Martin Fink, Joachim Spoerhase

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles.

Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff

Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010

Competitive and voting location.

Joachim Spoerhase

PhD thesis, 2010

Relaxed voting and competitive location under monotonous gain functions on trees.

Joachim Spoerhase, Hans-Christoph Wirth

Discret. Appl. Math., 2010

An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems.

Joachim Spoerhase

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

An Optimal Algorithm for the Indirect Covering Subtree Problem.

Joachim Spoerhase

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009

(r, p)-centroid problems on paths and trees.

Joachim Spoerhase, Hans-Christoph Wirth

Theor. Comput. Sci., 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

An O(n(logn)²/loglogn) algorithm for the single maximum coverage location or the (1, X_p)-medianoid problem on trees.

Joachim Spoerhase, Hans-Christoph Wirth

Inf. Process. Lett., 2009

2008

Approximating (<i>r, p</i>)-Centroid on a Path.

Joachim Spoerhase, Hans-Christoph Wirth

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007

Multiple voting location and single voting location on trees.

Hartmut Noltemeier, Joachim Spoerhase, Hans-Christoph Wirth

Eur. J. Oper. Res., 2007

Relaxed voting and competitive location on trees under monotonous gain functions.

Joachim Spoerhase, Hans-Christoph Wirth

Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007