Joachim Spoerhase

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 44

Top Venues

Julius Maximilian University of Würzburg (PHD)

Education History

Julius Maximilian University of Würzburg

PHD

Publications

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

Joachim Spoerhase.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Joachim Spoerhase