Joachim Spoerhase

96 papers A* 10A 11B 14C 3Misc 2Journal 50Unranked 5
YearRankTypeTitle / Venue / Authors
2026 A* conf
A Broader View on Clustering under Cluster-Aware Norm Objectives.
SODA
Martin G. Herold, Evangelos Kipouridis, Joachim Spoerhase
2026 — conf
Tree Violation Distance under Constraints.
SOSA
Debarati Das, Evangelos Kipouridis, Joachim Spoerhase
2025 J jnl
A Broader View on Clustering under Cluster-Aware Norm Objectives.
CoRR
Martin G. Herold, Evangelos Kipouridis, Joachim Spoerhase
2025 A* conf
Approximating Traveling Salesman Problems Using a Bridge Lemma.
SODA
Martin Böhm, Zachary Friggstad, Tobias Mömke, Joachim Spoerhase
2025 A* conf
Clustering to Minimize Cluster-Aware Norm Objectives.
SODA
Martin G. Herold, Evangelos Kipouridis, Joachim Spoerhase
2025 J jnl
Hypergraph Representation via Axis-Aligned Point-Subspace Cover.
Discret. Math. Theor. Comput. Sci.
Oksana Firman, Joachim Spoerhase
2025 J jnl
Simplification of polyline bundles of graphs and trees.
J. Comput. Geom.
Yannick Bosch, Peter Schäfer, Joachim Spoerhase, Sabine Storandt, Johannes Zink
2025 A* conf
Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions.
SoCG
Martin G. Herold, Danupon Nanongkai, Joachim Spoerhase, Nithin Varma, Zihang Wu
2025 J jnl
Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions.
CoRR
Martin G. Herold, Danupon Nanongkai, Joachim Spoerhase, Nithin Varma, Zihang Wu
2024 J jnl
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter.
ACM Trans. Algorithms
Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz
2024 J jnl
Approximating TSP Variants Using a Bridge Lemma.
CoRR
Martin Böhm, Zachary Friggstad, Tobias Mömke, Joachim Spoerhase
2024 J jnl
Clustering to Minimize Cluster-Aware Norm Objectives.
CoRR
Martin G. Herold, Evangelos Kipouridis, Joachim Spoerhase
2024 A* conf
Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces.
ICALP
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
2024 B conf
SkelEx and BoundEx - Geometrical Framework for Interpretable ReLU Neural Networks.
IJCNN
Pawel Pukowski, Joachim Spoerhase, Haiping Lu
2023 A conf
A Constant-Factor Approximation Algorithm for Reconciliation k-Median.
AISTATS
Joachim Spoerhase, Kamyar Khodamoradi, Benedikt Riegel, Bruno Ordozgoiti, Aristides Gionis
2023 B conf
Independent Set in k-Claw-Free Graphs: Conditional χ-Boundedness and the Power of LP/SDP Relaxations.
WAOA
Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase
2023 J jnl
Independent set in k-Claw-Free Graphs: Conditional χ-boundedness and the Power of LP/SDP Relaxations.
CoRR
Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase
2023 — conf
Mind the Gap: Edge Facility Location Problems in Theory and Practice.
CALDAM
Moritz Beck, Joachim Spoerhase, Sabine Storandt
2023 A* conf
Parameterized Approximation Schemes for Clustering with General Norm Objectives.
FOCS
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
2023 J jnl
Parameterized Approximation Schemes for Clustering with General Norm Objectives.
CoRR
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
2023 J jnl
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces.
CoRR
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
2023 J jnl
Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291).
Dagstuhl Reports
Karthik C. S., Parinya Chalermsook, Joachim Spoerhase, Meirav Zehavi, Martin G. Herold
2022 A conf
Coloring Mixed and Directional Interval Graphs.
GD
Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink
2022 J jnl
Coloring Mixed and Directional Interval Graphs.
CoRR
Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink
2022 B conf
Hypergraph Representation via Axis-Aligned Point-Subspace Cover.
WALCOM
Oksana Firman, Joachim Spoerhase
2021 J jnl
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter.
CoRR
Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz
2021 Misc conf
Consistent Simplification of Polyline Tree Bundles.
COCOON
Yannick Bosch, Peter Schäfer, Joachim Spoerhase, Sabine Storandt, Johannes Zink
2021 J jnl
Consistent Simplification of Polyline Tree Bundles.
CoRR
Yannick Bosch, Peter Schäfer, Joachim Spoerhase, Sabine Storandt, Johannes Zink
2021 J jnl
Hypergraph Representation via Axis-Aligned Point-Subspace Cover.
CoRR
Oksana Firman, Joachim Spoerhase
2021 B conf
On Minimum Generalized Manhattan Connections.
WADS
Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase
2020 Misc conf
A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs.
COCOON
Stephan Beyer, Markus Chimani, Joachim Spoerhase
2020 J jnl
Approximating Node-Weighted k-MST on Planar Graphs.
Theory Comput. Syst.
Jaroslaw Byrka, Mateusz Lewandowski, Joachim Spoerhase
2020 J jnl
On Minimum Generalized Manhattan Connections.
CoRR
Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase
2020 B conf
PTAS for Steiner Tree on Map Graphs.
LATIN
Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal
2020 — conf
Simplification of Polyline Bundles.
SWAT
Joachim Spoerhase, Sabine Storandt, Johannes Zink
2019 A* conf
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints.
ICALP
Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal
2019 J jnl
PTAS for Steiner Tree on Map Graphs.
CoRR
Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal
2019 J jnl
Simplification of Polyline Bundles.
CoRR
Joachim Spoerhase, Sabine Storandt, Johannes Zink
2018 J jnl
A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs.
CoRR
Stephan Beyer, Markus Chimani, Joachim Spoerhase
2018 J jnl
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints.
CoRR
Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal
2018 J jnl
An Improved Approximation Algorithm for Knapsack Median Using Sparsification.
Algorithmica
Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh
2018 B conf
Approximating Node-Weighted k-MST on Planar Graphs.
WAOA
Jaroslaw Byrka, Mateusz Lewandowski, Joachim Spoerhase
2018 J jnl
Approximating Node-Weighted k-MST on Planar Graphs.
CoRR
Jaroslaw Byrka, Mateusz Lewandowski, Joachim Spoerhase
2018 J jnl
Approximating the Generalized Minimum Manhattan Network Problem.
Algorithmica
Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff
2018 A conf
Approximation Schemes for Geometric Coverage Problems.
ESA
Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase
2018 A* conf
Brief Announcement: Approximation Schemes for Geometric Coverage Problems.
ICALP
Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase
2018 A* conf
Constant-factor approximation for ordered k-median.
STOC
Jaroslaw Byrka, Krzysztof Sornat, Joachim Spoerhase
2018 J jnl
New algorithms for maximum disjoint paths based on tree-likeness.
Math. Program.
Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
2018 B conf
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity.
ISAAC
Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff
2018 J jnl
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity.
CoRR
Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff
2017 J jnl
Constant-Factor Approximation for Ordered k-Median.
CoRR
Jaroslaw Byrka, Krzysztof Sornat, Joachim Spoerhase
2017 J jnl
Improved Approximation Algorithms for Box Contact Representations.
Algorithmica
Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff
2016 J jnl
Approximation Schemes for Geometric Coverage Problems.
CoRR
Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase
2016 A conf
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness.
ESA
Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
2016 J jnl
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness.
CoRR
Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
2015 A conf
An Improved Approximation Algorithm for Knapsack Median Using Sparsification.
ESA
Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh
2015 J jnl
Approximating Minimum Manhattan Networks in Higher Dimensions.
Algorithmica
Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff
2015 J jnl
Approximating Spanning Trees with Few Branches.
Theory Comput. Syst.
Markus Chimani, Joachim Spoerhase
2015 J jnl
Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem.
Algorithmica
Martin Knauer, Joachim Spoerhase
2015 A* conf
Bi-Factor Approximation Algorithms for Hard Capacitated
SODA
Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase
2015 J jnl
Colored Non-Crossing Euclidean Steiner Forest.
CoRR
Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff
2015 B conf
Colored Non-crossing Euclidean Steiner Forest.
ISAAC
Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff
2015 A conf
Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees.
STACS
Markus Chimani, Joachim Spoerhase
2015 J jnl
On Monotone Drawings of Trees.
CoRR
Philipp Kindermann, André Schulz, Joachim Spoerhase, Alexander Wolff
2015 A conf
Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks.
ITC
Stanislav Lange, Steffen Gebert, Joachim Spoerhase, Piotr Rygielski, Thomas Zinner, Samuel Kounev, Phuoc Tran-Gia
2014 A conf
Improved Approximation Algorithms for Box Contact Representations.
ESA
Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff
2014 J jnl
Improved Approximation Algorithms for Box Contact Representations.
CoRR
Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff
2014 J jnl
Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees.
CoRR
Markus Chimani, Joachim Spoerhase
2014 A conf
On Monotone Drawings of Trees.
GD
Philipp Kindermann, André Schulz, Joachim Spoerhase, Alexander Wolff
2013 J jnl
A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median.
CoRR
Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase
2013 B conf
Approximating the Generalized Minimum Manhattan Network Problem.
ISAAC
Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff
2013 — conf
Road segment selection with strokes and stability.
MapInteract
Thomas C. van Dijk, Krzysztof Fleszar, Jan-Henrik Haunert, Joachim Spoerhase
2013 J jnl
Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation.
IEEE Trans. Vis. Comput. Graph.
Martin Fink, Jan-Henrik Haunert, Joachim Spoerhase, Alexander Wolff
2012 J jnl
Algorithms for Labeling Focus Regions.
IEEE Trans. Vis. Comput. Graph.
Martin Fink, Jan-Henrik Haunert, André Schulz, Joachim Spoerhase, Alexander Wolff
2012 B conf
Approximating Spanning Trees with Few Branches.
WAOA
Markus Chimani, Joachim Spoerhase
2012 B conf
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles.
WALCOM
Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff
2012 J jnl
Polylogarithmic Approximation for Generalized Minimum Manhattan Networks
CoRR
Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff
2011 J jnl
Approximating Minimum Manhattan Networks in Higher Dimensions
CoRR
Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff
2011 A conf
Approximating Minimum Manhattan Networks in Higher Dimensions.
ESA
Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff
2011 B conf
Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs.
WAOA
Nadine Schwartges, Joachim Spoerhase, Alexander Wolff
2011 J jnl
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
CoRR
Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff
2011 A conf
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles.
GD
Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff
2011 B conf
Maximum Betweenness Centrality: Approximability and Tractable Cases.
WALCOM
Martin Fink, Joachim Spoerhase
2010 — conf
An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems.
ISAAC (1)
Joachim Spoerhase
2010 J jnl
An Optimal Algorithm for the Indirect Covering Subtree Problem
CoRR
Joachim Spoerhase
2010 C conf
An Optimal Algorithm for the Indirect Covering Subtree Problem.
CTW
Joachim Spoerhase
2010 — —
Competitive and voting location.
Joachim Spoerhase
2010 J jnl
Maximum Betweenness Centrality: Approximability and Tractable Cases
CoRR
Martin Fink, Joachim Spoerhase
2010 J jnl
Relaxed voting and competitive location under monotonous gain functions on trees.
Discret. Appl. Math.
Joachim Spoerhase, Hans-Christoph Wirth
2009 J jnl
(r, p)-centroid problems on paths and trees.
Theor. Comput. Sci.
Joachim Spoerhase, Hans-Christoph Wirth
2009 J jnl
An O(n(logn)
Inf. Process. Lett.
Joachim Spoerhase, Hans-Christoph Wirth
2009 B conf
Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem.
WADS
Martin Knauer, Joachim Spoerhase
2009 J jnl
Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree.
J. Discrete Algorithms
Joachim Spoerhase, Hans-Christoph Wirth
2008 C conf
Approximating (
CTW
Joachim Spoerhase, Hans-Christoph Wirth
2007 J jnl
Multiple voting location and single voting location on trees.
Eur. J. Oper. Res.
Hartmut Noltemeier, Joachim Spoerhase, Hans-Christoph Wirth
2007 C conf
Relaxed voting and competitive location on trees under monotonous gain functions.
CTW
Joachim Spoerhase, Hans-Christoph Wirth