Andreas Darmann

650 total citations
33 papers, 234 citations indexed

About

Andreas Darmann is a scholar working on Economics and Econometrics, Management Science and Operations Research and Computational Theory and Mathematics. According to data from OpenAlex, Andreas Darmann has authored 33 papers receiving a total of 234 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Economics and Econometrics, 15 papers in Management Science and Operations Research and 14 papers in Computational Theory and Mathematics. Recurrent topics in Andreas Darmann's work include Game Theory and Voting Systems (19 papers), Game Theory and Applications (10 papers) and Complexity and Algorithms in Graphs (8 papers). Andreas Darmann is often cited by papers focused on Game Theory and Voting Systems (19 papers), Game Theory and Applications (10 papers) and Complexity and Algorithms in Graphs (8 papers). Andreas Darmann collaborates with scholars based in Austria, Germany and France. Andreas Darmann's co-authors include Joachim Schauer, Ulrich Pferschy, Christian Klamler, Gerhard J. Woeginger, Gaia Nicosia, Jérôme Lang, Edith Elkind, Sascha Kurz, Britta Dorn and Martin Milanič and has published in prestigious journals such as European Journal of Operational Research, Theoretical Computer Science and Public Choice.

In The Last Decade

Andreas Darmann

28 papers receiving 225 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Andreas Darmann Austria 8 103 97 81 55 42 33 234
Mourad Baı̈ou France 8 129 1.3× 127 1.3× 80 1.0× 47 0.9× 53 1.3× 38 259
Sylvain Bouveret France 9 215 2.1× 71 0.7× 212 2.6× 63 1.1× 12 0.3× 20 319
Jeroen Kuipers Netherlands 15 314 3.0× 93 1.0× 260 3.2× 36 0.7× 26 0.6× 37 412
Trung Thanh Nguyen Vietnam 8 112 1.1× 48 0.5× 110 1.4× 35 0.6× 13 0.3× 34 230
Vittorio Bilò Italy 12 270 2.6× 31 0.3× 302 3.7× 76 1.4× 26 0.6× 57 378
Luca Moscardelli Italy 11 190 1.8× 31 0.3× 227 2.8× 117 2.1× 54 1.3× 48 392
Gianpiero Monaco Italy 11 154 1.5× 31 0.3× 168 2.1× 89 1.6× 42 1.0× 35 300
Xujin Chen China 8 33 0.3× 74 0.8× 79 1.0× 58 1.1× 45 1.1× 49 233
Spyros Kontogiannis Greece 8 126 1.2× 17 0.2× 176 2.2× 54 1.0× 11 0.3× 26 259
Shi Li China 7 34 0.3× 32 0.3× 12 0.1× 24 0.4× 38 0.9× 23 175

Countries citing papers authored by Andreas Darmann

Since Specialization
Citations

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

Fields of papers citing papers by Andreas Darmann

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Andreas Darmann

This figure shows the co-authorship network connecting the top 25 collaborators of Andreas Darmann. A scholar is included among the top collaborators of Andreas Darmann 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 Andreas Darmann. Andreas Darmann 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.
2.
Darmann, Andreas, et al.. (2023). Allocation of indivisible items with individual preference graphs. Discrete Applied Mathematics. 334. 45–62.
3.
Darmann, Andreas, et al.. (2021). On simplified NP-complete variants of Monotone 3 -Sat. Discrete Applied Mathematics. 292. 45–58. 6 indexed citations
4.
Darmann, Andreas, et al.. (2020). On a simple hard variant of Not-All-Equal 3-Sat. Theoretical Computer Science. 815. 147–152. 6 indexed citations
5.
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
6.
7.
Darmann, Andreas. (2016). It is difficult to tell if there is a Condorcet spanning tree. Mathematical Methods of Operations Research. 84(1). 93–104. 2 indexed citations
8.
Darmann, Andreas & Christian Klamler. (2016). Proportional Borda allocations. Social Choice and Welfare. 47(3). 543–558. 6 indexed citations
9.
Darmann, Andreas, Ulrich Pferschy, & Joachim Schauer. (2015). On the Shortest Path Game. Discrete Applied Mathematics. 217. 3–18. 2 indexed citations
10.
Darmann, Andreas, Christian Klamler, & Ulrich Pferschy. (2015). Sharing the Cost of a Path. RePEc: Research Papers in Economics. 3(1). 1–12. 1 indexed citations
11.
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
12.
Darmann, Andreas. (2014). It is hard to agree on a spanning tree. Economics bulletin. 34(1). 34–40. 1 indexed citations
13.
Darmann, Andreas & Christian Klamler. (2014). Knapsack cost sharing. Review of Economic Design. 18(3). 219–241. 3 indexed citations
14.
Darmann, Andreas & Joachim Schauer. (2014). Maximizing Nash Product Social Welfare in Allocating Indivisible Goods. SSRN Electronic Journal. 14 indexed citations
15.
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
16.
Darmann, Andreas. (2013). How hard is it to tell which is a Condorcet committee?. Mathematical Social Sciences. 66(3). 282–292. 11 indexed citations
17.
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
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.
Darmann, Andreas, Christian Klamler, & Ulrich Pferschy. (2008). Finding Socially Best Spanning Trees. SSRN Electronic Journal.

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 Mourad Baı̈ou Breakdown of academic impact, for papers by Sylvain Bouveret Breakdown of academic impact, for papers by Jeroen Kuipers Breakdown of academic impact, for papers by Trung Thanh Nguyen Breakdown of academic impact, for papers by Vittorio Bilò Breakdown of academic impact, for papers by Luca Moscardelli Breakdown of academic impact, for papers by Gianpiero Monaco Breakdown of academic impact, for papers by Xujin Chen Breakdown of academic impact, for papers by Spyros Kontogiannis Breakdown of academic impact, for papers by Shi Li
Rankless by CCL
2026