Joachim Schauer

773 total citations
23 papers, 353 citations indexed

About

Joachim Schauer is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Computational Theory and Mathematics. According to data from OpenAlex, Joachim Schauer has authored 23 papers receiving a total of 353 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Computer Networks and Communications, 11 papers in Industrial and Manufacturing Engineering and 10 papers in Computational Theory and Mathematics. Recurrent topics in Joachim Schauer's work include Optimization and Search Problems (11 papers), Complexity and Algorithms in Graphs (9 papers) and Advanced Graph Theory Research (7 papers). Joachim Schauer is often cited by papers focused on Optimization and Search Problems (11 papers), Complexity and Algorithms in Graphs (9 papers) and Advanced Graph Theory Research (7 papers). Joachim Schauer collaborates with scholars based in Austria, Germany and Italy. Joachim Schauer's co-authors include Ulrich Pferschy, Andreas Darmann, Gerhard J. Woeginger, Gaia Nicosia, Andrea Pacifici, Jérôme Lang, Edith Elkind, Sascha Kurz, Clemens Thielen and Kay Römer and has published in prestigious journals such as Applied Energy, European Journal of Operational Research and Theoretical Computer Science.

In The Last Decade

Joachim Schauer

19 papers receiving 340 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 Schauer Austria 11 185 136 119 65 48 23 353
Nir Halman Israel 9 129 0.7× 98 0.7× 53 0.4× 80 1.2× 29 0.6× 35 290
Rob van Stee Germany 15 396 2.1× 408 3.0× 88 0.7× 93 1.4× 30 0.6× 67 654
David Bergman United States 11 132 0.7× 105 0.8× 92 0.8× 48 0.7× 15 0.3× 34 303
Matthias Englert United Kingdom 10 89 0.5× 195 1.4× 70 0.6× 38 0.6× 8 0.2× 30 283
Elisenda Molina Spain 9 131 0.7× 29 0.2× 45 0.4× 115 1.8× 76 1.6× 20 345
Winfried Hochstättler Germany 11 114 0.6× 54 0.4× 155 1.3× 25 0.4× 22 0.5× 52 323
Charles Fleurent Canada 6 245 1.3× 90 0.7× 72 0.6× 203 3.1× 27 0.6× 6 369
Arindam Khan India 7 129 0.7× 86 0.6× 22 0.2× 29 0.4× 16 0.3× 30 280
Will Ma United States 9 55 0.3× 121 0.9× 29 0.2× 114 1.8× 9 0.2× 51 336
Bruno De Backer United States 7 108 0.6× 64 0.5× 26 0.2× 26 0.4× 39 0.8× 14 213

Countries citing papers authored by Joachim Schauer

Since Specialization
Citations

This map shows the geographic impact of Joachim Schauer'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 Schauer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joachim Schauer more than expected).

Fields of papers citing papers by Joachim Schauer

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Joachim Schauer. 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 Schauer. The network helps show where Joachim Schauer may publish in the future.

Co-authorship network of co-authors of Joachim Schauer

This figure shows the co-authorship network connecting the top 25 collaborators of Joachim Schauer. A scholar is included among the top collaborators of Joachim Schauer 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 Schauer. Joachim Schauer 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
2.
Schauer, Joachim, et al.. (2024). APOTSA: Anchor placement optimisation using discrete Tabu search algorithm for area‐based localisation. IET Wireless Sensor Systems. 14(6). 427–440.
3.
Schaudt, Oliver, et al.. (2022). Stackelberg packing games. Theoretical Computer Science. 943. 16–35.
4.
Milanič, Martin, et al.. (2022). Fair Allocation of Indivisible Items with Conflict Graphs. Algorithmica. 85(5). 1459–1489. 2 indexed citations
5.
Pferschy, Ulrich, Joachim Schauer, & Clemens Thielen. (2021). Approximating the product knapsack problem. Optimization Letters. 15(8). 2529–2540. 4 indexed citations
6.
Pferschy, Ulrich, Gaia Nicosia, Andrea Pacifici, & Joachim Schauer. (2020). On the Stackelberg knapsack game. European Journal of Operational Research. 291(1). 18–31. 12 indexed citations
7.
Pferschy, Ulrich & Joachim Schauer. (2018). Order Batching and Routing in a Non-Standard Warehouse. Electronic Notes in Discrete Mathematics. 69. 125–132. 14 indexed citations
8.
Darmann, Andreas, Edith Elkind, Sascha Kurz, et al.. (2017). Group activity selection problem with approval preferences. International Journal of Game Theory. 47(3). 767–796. 14 indexed citations
9.
Pferschy, Ulrich & Joachim Schauer. (2016). Approximation of knapsack problems with conflict and forcing graphs. Journal of Combinatorial Optimization. 33(4). 1300–1323. 28 indexed citations
10.
Pferschy, Ulrich & Joachim Schauer. (2016). Approximation of the Quadratic Knapsack Problem. INFORMS journal on computing. 28(2). 308–318. 9 indexed citations
11.
Darmann, Andreas, Ulrich Pferschy, & Joachim Schauer. (2015). On the Shortest Path Game. Discrete Applied Mathematics. 217. 3–18. 2 indexed citations
12.
Darmann, Andreas & Joachim Schauer. (2015). Maximizing Nash product social welfare in allocating indivisible goods. European Journal of Operational Research. 247(2). 548–559. 24 indexed citations
13.
Darmann, Andreas & Joachim Schauer. (2014). Maximizing Nash Product Social Welfare in Allocating Indivisible Goods. SSRN Electronic Journal. 14 indexed citations
14.
Darmann, Andreas, Gaia Nicosia, Ulrich Pferschy, & Joachim Schauer. (2013). The Subset Sum game. European Journal of Operational Research. 233(3). 539–549. 19 indexed citations
15.
Darmann, Andreas, Ulrich Pferschy, Joachim Schauer, & Gerhard J. Woeginger. (2011). Paths, trees and matchings under disjunctive constraints. Discrete Applied Mathematics. 159(16). 1726–1735. 48 indexed citations
16.
Schauer, Joachim, et al.. (2011). A generalized job-shop problem with more than one resource demand per task. EPub Bayreuth (University of Bayreuth). 1 indexed citations
17.
Pferschy, Ulrich & Joachim Schauer. (2011). The maximum flow problem with disjunctive constraints. Journal of Combinatorial Optimization. 26(1). 109–119. 44 indexed citations
18.
Darmann, Andreas, Ulrich Pferschy, & Joachim Schauer. (2010). Resource allocation with time intervals. Theoretical Computer Science. 411(49). 4217–4234. 24 indexed citations
19.
Darmann, Andreas, Ulrich Pferschy, Joachim Schauer, & Gerhard J. Woeginger. (2009). Combinatorial optimization problems with conflict graphs. TU/e Research Portal. 52(6). 293–296. 3 indexed citations
20.
Pferschy, Ulrich & Joachim Schauer. (2009). The Knapsack Problem with Conflict Graphs. Journal of Graph Algorithms and Applications. 13(2). 233–249. 81 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

Rankless by CCL
2026