Joachim Spoerhase

469 total citations
20 papers, 176 citations indexed

About

Joachim Spoerhase is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Organizational Behavior and Human Resource Management. According to data from OpenAlex, Joachim Spoerhase has authored 20 papers receiving a total of 176 indexed citations (citations by other indexed papers that have themselves been cited), including 7 papers in Computer Networks and Communications, 7 papers in Computational Theory and Mathematics and 7 papers in Organizational Behavior and Human Resource Management. Recurrent topics in Joachim Spoerhase's work include Complexity and Algorithms in Graphs (7 papers), Facility Location and Emergency Management (7 papers) and Optimization and Search Problems (4 papers). Joachim Spoerhase is often cited by papers focused on Complexity and Algorithms in Graphs (7 papers), Facility Location and Emergency Management (7 papers) and Optimization and Search Problems (4 papers). Joachim Spoerhase collaborates with scholars based in Germany, United States and Poland. Joachim Spoerhase's co-authors include H.-C. Wirth, Alexander Wolff, Martin Fink, Jan‐Henrik Haunert, Hartmut Noltemeier, André Schulz, Phuoc Tran‐Gia, Thomas Zinner, Steffen Gebert and Samuel Kounev and has published in prestigious journals such as European Journal of Operational Research, IEEE Transactions on Visualization and Computer Graphics and Theoretical Computer Science.

In The Last Decade

Joachim Spoerhase

20 papers receiving 168 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Joachim Spoerhase Germany 7 65 51 50 36 32 20 176
Claude Tadonki France 6 72 1.1× 23 0.5× 35 0.7× 34 0.9× 9 0.3× 28 158
Daniel Cosmin Porumbel France 7 34 0.5× 13 0.3× 14 0.3× 129 3.6× 48 1.5× 17 186
Ashish Tiwari India 12 164 2.5× 28 0.5× 9 0.2× 12 0.3× 11 0.3× 33 282
Franco Robledo Uruguay 8 68 1.0× 4 0.1× 5 0.1× 14 0.4× 25 0.8× 51 199
Rolf Wendolsky Germany 2 199 3.1× 46 0.9× 26 0.5× 29 0.8× 2 0.1× 3 327
Aniello De Santo United States 6 47 0.7× 21 0.4× 2 0.0× 11 0.3× 3 0.1× 21 204
Devesh Kumar Srivastava India 8 94 1.4× 44 0.9× 3 0.1× 4 0.1× 3 0.1× 35 276
Rohitash Kumar Banyal India 10 111 1.7× 37 0.7× 2 0.0× 18 0.5× 2 0.1× 22 284
Pablo Rabanal Spain 8 44 0.7× 10 0.2× 14 0.4× 36 1.1× 21 149
Lúcia Martins Portugal 9 133 2.0× 3 0.1× 6 0.1× 21 0.6× 21 0.7× 38 233

Countries citing papers authored by Joachim Spoerhase

Since Specialization
Citations

This map shows the geographic impact of Joachim Spoerhase's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Joachim Spoerhase with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joachim Spoerhase more than expected).

Fields of papers citing papers by Joachim Spoerhase

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Joachim Spoerhase. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Joachim Spoerhase. The network helps show where Joachim Spoerhase may publish in the future.

Co-authorship network of co-authors of Joachim Spoerhase

This figure shows the co-authorship network connecting the top 25 collaborators of Joachim Spoerhase. A scholar is included among the top collaborators of Joachim Spoerhase based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Joachim Spoerhase. Joachim Spoerhase is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Byrka, Jarosław, et al.. (2023). Parameterized Approximation Schemes for Clustering with General Norm Objectives. 1377–1399. 3 indexed citations
2.
Chan, Timothy M., et al.. (2018). Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 13. 1 indexed citations
3.
Byrka, Jarosław, et al.. (2018). Constant-factor approximation for ordered k-median. 620–631. 7 indexed citations
4.
Byrka, Jarosław, et al.. (2018). An Improved Approximation Algorithm for Knapsack Median Using Sparsification. Algorithmica. 80(4). 1093–1114. 2 indexed citations
5.
Das, Aparna, et al.. (2017). Approximating the Generalized Minimum Manhattan Network Problem. Algorithmica. 80(4). 1170–1190. 1 indexed citations
6.
Lange, Stanislav, Steffen Gebert, Joachim Spoerhase, et al.. (2015). Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks. 1203. 210–218. 31 indexed citations
7.
Chimani, Markus & Joachim Spoerhase. (2014). Approximating Spanning Trees with Few Branches. Theory of Computing Systems. 56(1). 181–196. 3 indexed citations
8.
Gebert, Steffen, David Hock, Matthias Hartmann, et al.. (2014). Including energy efficiency aspects in multi-layer optical network design. 212–217. 2 indexed citations
9.
Spoerhase, Joachim, et al.. (2013). Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem. Algorithmica. 71(4). 797–811. 9 indexed citations
10.
Fink, Martin, Jan‐Henrik Haunert, Joachim Spoerhase, & Alexander Wolff. (2013). Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation. IEEE Transactions on Visualization and Computer Graphics. 19(12). 2326–2335. 27 indexed citations
11.
Das, Aparna, Emden R. Gansner, Michael Kaufmann, et al.. (2013). Approximating Minimum Manhattan Networks in Higher Dimensions. Algorithmica. 71(1). 36–52. 2 indexed citations
12.
Haunert, Jan‐Henrik, et al.. (2013). Road segment selection with strokes and stability. 72–77. 2 indexed citations
13.
Das, Aparna, et al.. (2012). Polylogarithmic Approximation for Generalized Minimum Manhattan Networks. MPG.PuRe (Max Planck Society). 81–84. 1 indexed citations
14.
Fink, Martin, Jan‐Henrik Haunert, André Schulz, Joachim Spoerhase, & Alexander Wolff. (2012). Algorithms for Labeling Focus Regions. IEEE Transactions on Visualization and Computer Graphics. 18(12). 2583–2592. 34 indexed citations
15.
Spoerhase, Joachim & H.-C. Wirth. (2009). (r,p)-centroid problems on paths and trees. Theoretical Computer Science. 410(47-49). 5128–5137. 16 indexed citations
16.
Spoerhase, Joachim & H.-C. Wirth. (2009). Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree. Journal of Discrete Algorithms. 7(2). 256–266. 2 indexed citations
17.
Spoerhase, Joachim & H.-C. Wirth. (2009). Relaxed voting and competitive location under monotonous gain functions on trees. Discrete Applied Mathematics. 158(4). 361–373. 2 indexed citations
18.
Spoerhase, Joachim & H.-C. Wirth. (2008). Approximating ( r, p )-Centroid on a Path.. 193–195. 3 indexed citations
19.
Spoerhase, Joachim & H.-C. Wirth. (2008). An algorithm for the single maximum coverage location or the -medianoid problem on trees. Information Processing Letters. 109(8). 391–394. 3 indexed citations
20.
Noltemeier, Hartmut, Joachim Spoerhase, & H.-C. Wirth. (2007). Multiple voting location and single voting location on trees. European Journal of Operational Research. 181(2). 654–667. 25 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Claude Tadonki Breakdown of academic impact, for papers by Daniel Cosmin Porumbel Breakdown of academic impact, for papers by Ashish Tiwari Breakdown of academic impact, for papers by Franco Robledo Breakdown of academic impact, for papers by Rolf Wendolsky Breakdown of academic impact, for papers by Aniello De Santo Breakdown of academic impact, for papers by Devesh Kumar Srivastava Breakdown of academic impact, for papers by Rohitash Kumar Banyal Breakdown of academic impact, for papers by Pablo Rabanal Breakdown of academic impact, for papers by Lúcia Martins
Rankless by CCL
2026