Joachim Spoerhase
Orcid: 0000-0002-2601-6452Affiliations:
- University of Sheffield, UK
- University of Würzburg, Institute of Computer Science, Germany (former)
According to our database1,
Joachim Spoerhase
authored at least 51 papers
between 2007 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
ACM Trans. Algorithms, January, 2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
2023
Dagstuhl Reports, 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
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023
2022
Proceedings of the WALCOM: Algorithms and Computation, 2022
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022
2021
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021
2020
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020
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
Math. Program., 2018
Algorithmica, 2018
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
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
2017
Algorithmica, 2017
2015
Algorithmica, 2015
Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks.
Proceedings of the 27th International Teletraffic Congress, 2015
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015
2014
Proceedings of the Graph Drawing - 22nd International Symposium, 2014
2013
IEEE Trans. Vis. Comput. Graph., 2013
CoRR, 2013
Proceedings of the MapInteract 2013, 2013
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
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011
Proceedings of the Graph Drawing - 19th International Symposium, 2011
2010
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
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
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