Dr Joachim Spoerhase

Department of Computer Science

Lecturer in Algorithms

Joachim Spoerhase  profile pic
Profile picture of Joachim Spoerhase  profile pic
J.Spoerhase@sheffield.ac.uk

Full contact details

Dr Joachim Spoerhase
Department of Computer Science
Regent Court (DCS)
211 Portobello
Sheffield
S1 4DP
Profile

Dr Joachim Spoerhase received his PhD from the University of Würzburg, Germany in 2010, where he also served as a research associate for eight years and obtained his habilitation in 2017. In addition, he has held research positions at several other institutions, including one year as a postdoctoral researcher at the University of Wroclaw in Poland, two years as a research fellow at Aalto University in Finland, and one year as a postdoctoral researcher at the Max Planck Institute for Informatics (MPI-INF) in Germany.

Research interests

Dr Joachim Spoerhase research interests lie in the intersection of algorithms, complexity, and combinatorial optimisation. In particular he is developing approximation algorithms for clustering, network design, and geometric optimisation. He is also investigating the hardness of designing such algorithms.

Publications

Show: Featured publications All publications

Journal articles

Conference proceedings papers

All publications

Journal articles

Chapters

Conference proceedings papers

Preprints

  • Abbasi F, Banerjee S, Byrka J, Chalermsook P, Gadekar A, Khodamoradi K, Marx D, Sharma R & Spoerhase J (2023) Parameterized Approximation Schemes for Clustering with General Norm Objectives. RIS download Bibtex download
  • Byrka J, Sornat K & Spoerhase J (2017) Constant-Factor Approximation for Ordered k-Median. RIS download Bibtex download
  • Chaplick S, De M, Ravsky A & Spoerhase J (2016) Approximation Schemes for Geometric Coverage Problems. RIS download Bibtex download
  • Fleszar K, Mnich M & Spoerhase J (2016) New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. RIS download Bibtex download
  • Chimani M & Spoerhase J (2014) Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees. RIS download Bibtex download
  • Fink M, Haunert J-H, Mchedlidze T, Spoerhase J & Wolff A (2011) Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. RIS download Bibtex download
  • Das A, Gansner ER, Kaufmann M, Kobourov S, Spoerhase J & Wolff A (2011) Approximating Minimum Manhattan Networks in Higher Dimensions. RIS download Bibtex download
  • Spoerhase J (2010) An Optimal Algorithm for the Indirect Covering Subtree Problem. RIS download Bibtex download
Research group

Foundations of Computation research group

Grants

Approximation Algorithms for Combinatorial Optimization Problems with Packing ConstraintsGerman Research Foundation (DFG),  08/2020 - 10/2024, €296,342, as PI

Professional activities and memberships

EuroCG'24 (Program Committee)

Dagstuhl Seminar on "Parameterized Approximation: Algorithms and Hardness" in July, 2023 (Organiser) 

ADFOCS'23 (Organising Committee) 

CALDAM'22 (Program Committee) 

EuroCG'20 (Program Committee) 

CALDAM'20 (Program Committee) 

CALDAM'19 (Program Committee) 

ALGO'18 (Organising Committee) 

GD'14 (Organising Committee) 

Supervision activities
  • Martin Herold (PhD student since 2022 at MPI-INF, Germany)
  • Kamyar Khodamoradi (Postdoc 2020-21, now Assistant Professor at University of Regina, Canada)
  • Krzysztof Fleszar (Phd student 2012-16, now Assistant Professor at University of Warsaw, Poland)