default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoachim Spoerhase
Person information
- affiliation: University of Sheffield, UK
- affiliation (former): University of Würzburg, Institute of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j17]Oksana Firman, Joachim Spoerhase:
Hypergraph Representation via Axis-Aligned Point-Subspace Cover. Discret. Math. Theor. Comput. Sci. 27(2) (2025)- [c42]Martin G. Herold
, Evangelos Kipouridis, Joachim Spoerhase:
Clustering to Minimize Cluster-Aware Norm Objectives. SODA 2025: 255-287 - [c41]Martin Böhm, Zachary Friggstad, Tobias Mömke, Joachim Spoerhase:
Approximating Traveling Salesman Problems Using a Bridge Lemma. SODA 2025: 1166-1177 - [i31]Martin G. Herold, Danupon Nanongkai, Joachim Spoerhase, Nithin Varma, Zihang Wu:
Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions. CoRR abs/2503.03079 (2025) - 2024
- [j16]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): 6:1-6:20 (2024) - [c40]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: 6:1-6:19 - [c39]Pawel Pukowski, Joachim Spoerhase, Haiping Lu:
SkelEx and BoundEx - Geometrical Framework for Interpretable ReLU Neural Networks. IJCNN 2024: 1-8 - [i30]Martin Böhm, Zachary Friggstad, Tobias Mömke, Joachim Spoerhase:
Approximating TSP Variants Using a Bridge Lemma. CoRR abs/2405.12876 (2024) - [i29]Martin G. Herold, Evangelos Kipouridis, Joachim Spoerhase:
Clustering to Minimize Cluster-Aware Norm Objectives. CoRR abs/2410.24104 (2024) - 2023
- [c38]Joachim Spoerhase, Kamyar Khodamoradi, Benedikt Riegel, Bruno Ordozgoiti, Aristides Gionis:
A Constant-Factor Approximation Algorithm for Reconciliation k-Median. AISTATS 2023: 1719-1746 - [c37]Moritz Beck, Joachim Spoerhase, Sabine Storandt:
Mind the Gap: Edge Facility Location Problems in Theory and Practice. CALDAM 2023: 321-334 - [c36]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: 1377-1399 - [c35]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: 205-218 - [i28]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 abs/2304.03146 (2023) - [i27]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 abs/2305.07316 (2023) - [i26]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 abs/2308.16033 (2023) - [i25]Karthik C. S., Parinya Chalermsook, Joachim Spoerhase, Meirav Zehavi, Martin G. Herold:
Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291). Dagstuhl Reports 13(7): 96-107 (2023) - 2022
- [c34]Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink:
Coloring Mixed and Directional Interval Graphs. GD 2022: 418-431 - [c33]Oksana Firman, Joachim Spoerhase:
Hypergraph Representation via Axis-Aligned Point-Subspace Cover. WALCOM 2022: 328-339 - [i24]Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink:
Coloring Mixed and Directional Interval Graphs. CoRR abs/2208.14250 (2022) - 2021
- [c32]Yannick Bosch, Peter Schäfer, Joachim Spoerhase, Sabine Storandt, Johannes Zink:
Consistent Simplification of Polyline Tree Bundles. COCOON 2021: 231-243 - [c31]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: 85-100 - [i23]Yannick Bosch, Peter Schäfer, Joachim Spoerhase, Sabine Storandt, Johannes Zink:
Consistent Simplification of Polyline Tree Bundles. CoRR abs/2108.10790 (2021) - [i22]Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz:
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter. CoRR abs/2111.06299 (2021) - [i21]Oksana Firman, Joachim Spoerhase:
Hypergraph Representation via Axis-Aligned Point-Subspace Cover. CoRR abs/2111.13555 (2021) - 2020
- [j15]Jaroslaw Byrka, Mateusz Lewandowski, Joachim Spoerhase:
Approximating Node-Weighted k-MST on Planar Graphs. Theory Comput. Syst. 64(4): 626-644 (2020) - [c30]Stephan Beyer, Markus Chimani, Joachim Spoerhase:
A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs. COCOON 2020: 347-359 - [c29]Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal:
PTAS for Steiner Tree on Map Graphs. LATIN 2020: 3-14 - [c28]Joachim Spoerhase, Sabine Storandt, Johannes Zink:
Simplification of Polyline Bundles. SWAT 2020: 35:1-35:20 - [i20]Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase:
On Minimum Generalized Manhattan Connections. CoRR abs/2010.14338 (2020)
2010 – 2019
- 2019
- [c27]Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal:
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints. ICALP 2019: 85:1-85:15 - [i19]Joachim Spoerhase, Sabine Storandt, Johannes Zink:
Simplification of Polyline Bundles. CoRR abs/1907.05296 (2019) - [i18]Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal:
PTAS for Steiner Tree on Map Graphs. CoRR abs/1912.00717 (2019) - 2018
- [j14]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): 1093-1114 (2018) - [j13]Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff:
Approximating the Generalized Minimum Manhattan Network Problem. Algorithmica 80(4): 1170-1190 (2018) - [j12]Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase:
New algorithms for maximum disjoint paths based on tree-likeness. Math. Program. 171(1-2): 433-461 (2018) - [c26]Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase:
Approximation Schemes for Geometric Coverage Problems. ESA 2018: 17:1-17:15 - [c25]Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase:
Brief Announcement: Approximation Schemes for Geometric Coverage Problems. ICALP 2018: 107:1-107:4 - [c24]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: 61:1-61:13 - [c23]Jaroslaw Byrka, Krzysztof Sornat, Joachim Spoerhase:
Constant-factor approximation for ordered k-median. STOC 2018: 620-631 - [c22]Jaroslaw Byrka, Mateusz Lewandowski, Joachim Spoerhase:
Approximating Node-Weighted k-MST on Planar Graphs. WAOA 2018: 87-101 - [i17]Jaroslaw Byrka, Mateusz Lewandowski, Joachim Spoerhase:
Approximating Node-Weighted k-MST on Planar Graphs. CoRR abs/1801.00313 (2018) - [i16]Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal:
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints. CoRR abs/1804.10947 (2018) - [i15]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 abs/1806.02851 (2018) - [i14]Stephan Beyer, Markus Chimani, Joachim Spoerhase:
A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs. CoRR abs/1808.04651 (2018) - 2017
- [j11]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): 902-920 (2017) - [i13]Jaroslaw Byrka, Krzysztof Sornat, Joachim Spoerhase:
Constant-Factor Approximation for Ordered k-Median. CoRR abs/1711.01972 (2017) - 2016
- [c21]Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase:
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. ESA 2016: 42:1-42:17 - [i12]Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase:
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. CoRR abs/1603.01740 (2016) - [i11]Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase:
Approximation Schemes for Geometric Coverage Problems. CoRR abs/1607.06665 (2016) - 2015
- [j10]Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff:
Approximating Minimum Manhattan Networks in Higher Dimensions. Algorithmica 71(1): 36-52 (2015) - [j9]Martin Knauer, Joachim Spoerhase:
Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem. Algorithmica 71(4): 797-811 (2015) - [j8]Markus Chimani, Joachim Spoerhase:
Approximating Spanning Trees with Few Branches. Theory Comput. Syst. 56(1): 181-196 (2015) - [c20]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation Algorithm for Knapsack Median Using Sparsification. ESA 2015: 275-287 - [c19]Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Colored Non-crossing Euclidean Steiner Forest. ISAAC 2015: 429-441 - [c18]Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase:
Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems. SODA 2015: 722-736 - [c17]Markus Chimani, Joachim Spoerhase:
Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees. STACS 2015: 238-248 - [c16]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. ITC 2015: 210-218 - [i10]Philipp Kindermann, André Schulz, Joachim Spoerhase, Alexander Wolff:
On Monotone Drawings of Trees. CoRR abs/1505.01410 (2015) - [i9]Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Colored Non-Crossing Euclidean Steiner Forest. CoRR abs/1509.05681 (2015) - 2014
- [c15]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: 87-99 - [c14]Philipp Kindermann, André Schulz, Joachim Spoerhase, Alexander Wolff:
On Monotone Drawings of Trees. GD 2014: 488-500 - [i8]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 abs/1403.4861 (2014) - [i7]Markus Chimani, Joachim Spoerhase:
Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees. CoRR abs/1409.6551 (2014) - 2013
- [j7]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): 2326-2335 (2013) - [c13]Thomas C. van Dijk, Krzysztof Fleszar, Jan-Henrik Haunert, Joachim Spoerhase:
Road segment selection with strokes and stability. MapInteract 2013: 72-77 - [c12]Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff:
Approximating the Generalized Minimum Manhattan Network Problem. ISAAC 2013: 722-732 - [i6]Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase:
A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median. CoRR abs/1312.6550 (2013) - 2012
- [j6]Martin Fink, Jan-Henrik Haunert, André Schulz, Joachim Spoerhase, Alexander Wolff:
Algorithms for Labeling Focus Regions. IEEE Trans. Vis. Comput. Graph. 18(12): 2583-2592 (2012) - [c11]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: 186-197 - [c10]Markus Chimani, Joachim Spoerhase:
Approximating Spanning Trees with Few Branches. WAOA 2012: 30-41 - [i5]Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff:
Polylogarithmic Approximation for Generalized Minimum Manhattan Networks. CoRR abs/1203.6481 (2012) - 2011
- [c9]Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff:
Approximating Minimum Manhattan Networks in Higher Dimensions. ESA 2011: 49-60 - [c8]Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff:
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. GD 2011: 441-442 - [c7]Martin Fink, Joachim Spoerhase:
Maximum Betweenness Centrality: Approximability and Tractable Cases. WALCOM 2011: 9-20 - [c6]Nadine Schwartges, Joachim Spoerhase, Alexander Wolff:
Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. WAOA 2011: 77-88 - [i4]Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff:
Approximating Minimum Manhattan Networks in Higher Dimensions. CoRR abs/1107.0901 (2011) - [i3]Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff:
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. CoRR abs/1107.4970 (2011) - 2010
- [b1]Joachim Spoerhase:
Competitive and voting location. Julius Maximilian University of Würzburg, 2010 - [j5]Joachim Spoerhase, Hans-Christoph Wirth:
Relaxed voting and competitive location under monotonous gain functions on trees. Discret. Appl. Math. 158(4): 361-373 (2010) - [c5]Joachim Spoerhase:
An Optimal Algorithm for the Indirect Covering Subtree Problem. CTW 2010: 157-161 - [c4]Joachim Spoerhase:
An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems. ISAAC (1) 2010: 440-450 - [i2]Joachim Spoerhase:
An Optimal Algorithm for the Indirect Covering Subtree Problem. CoRR abs/1002.0580 (2010) - [i1]Martin Fink, Joachim Spoerhase:
Maximum Betweenness Centrality: Approximability and Tractable Cases. CoRR abs/1008.3503 (2010)
2000 – 2009
- 2009
- [j4]Joachim Spoerhase, Hans-Christoph Wirth:
An O(n(logn)2/loglogn) algorithm for the single maximum coverage location or the (1, Xp)-medianoid problem on trees. Inf. Process. Lett. 109(8): 391-394 (2009) - [j3]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): 256-266 (2009) - [j2]Joachim Spoerhase, Hans-Christoph Wirth:
(r, p)-centroid problems on paths and trees. Theor. Comput. Sci. 410(47-49): 5128-5137 (2009) - [c3]Martin Knauer, Joachim Spoerhase:
Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem. WADS 2009: 459-470 - 2008
- [c2]Joachim Spoerhase, Hans-Christoph Wirth:
Approximating (r, p)-Centroid on a Path. CTW 2008: 193-195 - 2007
- [j1]Hartmut Noltemeier, Joachim Spoerhase, Hans-Christoph Wirth:
Multiple voting location and single voting location on trees. Eur. J. Oper. Res. 181(2): 654-667 (2007) - [c1]Joachim Spoerhase, Hans-Christoph Wirth:
Relaxed voting and competitive location on trees under monotonous gain functions. CTW 2007: 137-140
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-20 23:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
