Joachim Spoerhase

Affiliations:
  • University of Sheffield, UK
  • University of Würzburg, Institute of Computer Science, Germany (former)


According to our database1, Joachim Spoerhase authored at least 50 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter.
ACM Trans. Algorithms, January, 2024

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

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces.
CoRR, 2023

Independent Set in k-Claw-Free Graphs: Conditional χ-Boundedness and the Power of LP/SDP Relaxations.
Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

Parameterized Approximation Schemes for Clustering with General Norm Objectives.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Mind the Gap: Edge Facility Location Problems in Theory and Practice.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

A Constant-Factor Approximation Algorithm for Reconciliation k-Median.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Hypergraph Representation via Axis-Aligned Point-Subspace Cover.
Proceedings of the WALCOM: Algorithms and Computation, 2022

Coloring Mixed and Directional Interval Graphs.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021
On Minimum Generalized Manhattan Connections.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Consistent Simplification of Polyline Tree Bundles.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020
Approximating Node-Weighted k-MST on Planar Graphs.
Theory Comput. Syst., 2020

Simplification of Polyline Bundles.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

PTAS for Steiner Tree on Map Graphs.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
New algorithms for maximum disjoint paths based on tree-likeness.
Math. Program., 2018

Approximating the Generalized Minimum Manhattan Network Problem.
Algorithmica, 2018

An Improved Approximation Algorithm for Knapsack Median Using Sparsification.
Algorithmica, 2018

Constant-factor approximation for ordered k-median.
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.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Brief Announcement: Approximation Schemes for Geometric Coverage Problems.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Approximation Schemes for Geometric Coverage Problems.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Improved Approximation Algorithms for Box Contact Representations.
Algorithmica, 2017

2015
Approximating Spanning Trees with Few Branches.
Theory Comput. Syst., 2015

Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem.
Algorithmica, 2015

Approximating Minimum Manhattan Networks in Higher Dimensions.
Algorithmica, 2015

Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks.
Proceedings of the 27th International Teletraffic Congress, 2015

Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees.
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.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Colored Non-crossing Euclidean Steiner Forest.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014
On Monotone Drawings of Trees.
Proceedings of the Graph Drawing - 22nd International Symposium, 2014

2013
Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation.
IEEE Trans. Vis. Comput. Graph., 2013

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

Road segment selection with strokes and stability.
Proceedings of the MapInteract 2013, 2013

2012
Algorithms for Labeling Focus Regions.
IEEE Trans. Vis. Comput. Graph., 2012

Polylogarithmic Approximation for Generalized Minimum Manhattan Networks
CoRR, 2012

Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

2011
Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs.
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

Maximum Betweenness Centrality: Approximability and Tractable Cases.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

2010
Competitive and voting location.
PhD thesis, 2010

Relaxed voting and competitive location under monotonous gain functions on trees.
Discret. Appl. Math., 2010

An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

An Optimal Algorithm for the Indirect Covering Subtree Problem.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009
(r, p)-centroid problems on paths and trees.
Theor. Comput. Sci., 2009

Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree.
J. Discrete Algorithms, 2009

An O(n(logn)<sup>2</sup>/loglogn) algorithm for the single maximum coverage location or the (1, X<sub>p</sub>)-medianoid problem on trees.
Inf. Process. Lett., 2009

2008
Approximating (<i>r, p</i>)-Centroid on a Path.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007
Multiple voting location and single voting location on trees.
Eur. J. Oper. Res., 2007

Relaxed voting and competitive location on trees under monotonous gain functions.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007


  Loading...