Andreas Darmann

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 25

Top Topics

Satisfiability Problem

Stochastic Local Search Algorithms

Top Venues

Discret. Appl. Math.

Int. J. Game Theory

Publications

Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. CoRR (2024)
Andreas Darmann
Stability and Welfare in (Dichotomous) Hedonic Diversity Games. Theory Comput. Syst. 67 (6) (2023)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. CoRR (2023)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
Allocation of indivisible items with individual preference graphs. Discret. Appl. Math. 334 (2023)
Markus Brill, Jiehua Chen, Andreas Darmann, David M. Pennock, Matthias Greger
Algorithms for Participatory Democracy (Dagstuhl Seminar 22271). Dagstuhl Reports 12 (7) (2022)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
Allocation of Indivisible Items with Individual Preference Graphs. CoRR (2022)
Andreas Darmann, Janosch Döcker, Britta Dorn, Sebastian Schneckenburger
Simplified group activity selection with group size constraints. Int. J. Game Theory 51 (1) (2022)
Andreas Darmann
Hedonic Diversity Games Revisited. ADT (2021)
Andreas Darmann, Janosch Döcker
On simplified NP-complete variants of Monotone3-Sat. Discret. Appl. Math. 292 (2021)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Nevena Pivac, Ulrich Pferschy
Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. ADT (2021)
Andreas Darmann, Janosch Döcker
On a simple hard variant of Not-All-Equal 3-Sat. Theor. Comput. Sci. 815 (2020)
Andreas Darmann
Manipulability in a group activity selection problem. Soc. Choice Welf. 52 (3) (2019)
Andreas Darmann, Christian Klamler
Using the Borda rule for ranking sets of objects. Soc. Choice Welf. 53 (3) (2019)
Andreas Darmann, Janosch Döcker
On simplified NP-complete variants of Not-All-Equal 3-Sat and 3-Sat. CoRR (2019)
Andreas Darmann
Stable and Pareto optimal group activity selection from ordinal preferences. Int. J. Game Theory 47 (4) (2018)
Andreas Darmann
A social choice approach to ordinal group activity selection. Math. Soc. Sci. 93 (2018)
Andreas Darmann, Janosch Döcker, Britta Dorn
The Monotone Satisfiability Problem with Bounded Variable Appearances. Int. J. Found. Comput. Sci. 29 (6) (2018)
Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger
Group activity selection problem with approval preferences. Int. J. Game Theory 47 (3) (2018)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
The shortest connection game. Discret. Appl. Math. 231 (2017)
Andreas Darmann, Janosch Döcker, Britta Dorn, Jérôme Lang, Sebastian Schneckenburger
On Simplified Group Activity Selection. ADT (2017)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
On the Shortest Path Game. Discret. Appl. Math. 217 (2017)
Andreas Darmann
It is difficult to tell if there is a Condorcet spanning tree. Math. Methods Oper. Res. 84 (1) (2016)
Andreas Darmann, Christian Klamler
Proportional Borda allocations. Soc. Choice Welf. 47 (3) (2016)
Andreas Darmann, Janosch Döcker
Monotone 3-Sat-4 is NP-complete. CoRR (2016)
Andreas Darmann, Janosch Döcker, Britta Dorn
On planar variants of the monotone satisfiability problem with bounded variable appearances. CoRR (2016)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
The Shortest Connection Game. CoRR (2015)
Andreas Darmann
Group Activity Selection from Ordinal Preferences. ADT (2015)
Andreas Darmann, Joachim Schauer
Maximizing Nash product social welfare in allocating indivisible goods. Eur. J. Oper. Res. 247 (2) (2015)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
On the shortest path game: extended version. CoRR (2015)
Andreas Darmann, Gaia Nicosia, Ulrich Pferschy, Joachim Schauer
The Subset Sum game. Eur. J. Oper. Res. 233 (3) (2014)
Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger
Group Activity Selection Problem. CoRR (2014)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
The Shortest Path Game: Complexity and Algorithms. IFIP TCS (2014)
Andreas Darmann
How hard is it to tell which is a Condorcet committee? Math. Soc. Sci. 66 (3) (2013)
Andreas Darmann
Popular Spanning Trees. Int. J. Found. Comput. Sci. 24 (5) (2013)
Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger
Group Activity Selection Problem. WINE (2012)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger
Paths, trees and matchings under disjunctive constraints. Discret. Appl. Math. 159 (16) (2011)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
Resource allocation with time intervals. Theor. Comput. Sci. 411 (49) (2010)
Andreas Darmann, Christian Klamler, Ulrich Pferschy
A note on maximizing the minimum voter satisfaction on spanning trees. Math. Soc. Sci. 60 (1) (2010)
Andreas Darmann, Christian Klamler, Ulrich Pferschy
Maximizing the minimum voter satisfaction on spanning trees. Math. Soc. Sci. 58 (2) (2009)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
Determining a Minimum Spanning Tree with Disjunctive Constraints. ADT (2009)
Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger
Combinatorial Optimization Problems with Conflict Graphs. CTW (2009)