Determining a Minimum Spanning Tree with Disjunctive Constraints. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (ADT, 2009)

Combinatorial Optimization Problems with Conflict Graphs. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer; Gerhard J. Woeginger (CTW, 2009)

Maximizing the minimum voter satisfaction on spanning trees. - Andreas Darmann; Christian Klamler; Ulrich Pferschy (Math. Soc. Sci., 2009)

A note on maximizing the minimum voter satisfaction on spanning trees. - Andreas Darmann; Christian Klamler; Ulrich Pferschy (Math. Soc. Sci., 2010)

Resource allocation with time intervals. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (Theor. Comput. Sci., 2010)

Paths, trees and matchings under disjunctive constraints. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer; Gerhard J. Woeginger (Discret. Appl. Math., 2011)

Group Activity Selection Problem. - Andreas Darmann; Edith Elkind; Sascha Kurz; Jérôme Lang; Joachim Schauer; Gerhard J. Woeginger (WINE, 2012)

Popular Spanning Trees. - Andreas Darmann (Int. J. Found. Comput. Sci., 2013)

How hard is it to tell which is a Condorcet committee? - Andreas Darmann (Math. Soc. Sci., 2013)

The Shortest Path Game: Complexity and Algorithms. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (IFIP TCS, 2014)

The Subset Sum game. - Andreas Darmann; Gaia Nicosia; Ulrich Pferschy; Joachim Schauer (Eur. J. Oper. Res., 2014)

Group Activity Selection from Ordinal Preferences. - Andreas Darmann (ADT, 2015)

On the shortest path game: extended version. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (CoRR, 2015)

Maximizing Nash product social welfare in allocating indivisible goods. - Andreas Darmann; Joachim Schauer (Eur. J. Oper. Res., 2015)

Monotone 3-Sat-4 is NP-complete. - Andreas Darmann; Janosch Döcker (CoRR, 2016)

On planar variants of the monotone satisfiability problem with bounded variable appearances. - Andreas Darmann; Janosch Döcker; Britta Dorn (CoRR, 2016)

It is difficult to tell if there is a Condorcet spanning tree. - Andreas Darmann (Math. Methods Oper. Res., 2016)

Proportional Borda allocations. - Andreas Darmann; Christian Klamler (Soc. Choice Welf., 2016)

On Simplified Group Activity Selection. - Andreas Darmann; Janosch Döcker; Britta Dorn; Jérôme Lang; Sebastian Schneckenburger (ADT, 2017)

On the Shortest Path Game. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (Discret. Appl. Math., 2017)

The shortest connection game. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (Discret. Appl. Math., 2017)

The Monotone Satisfiability Problem with Bounded Variable Appearances. - Andreas Darmann; Janosch Döcker; Britta Dorn (Int. J. Found. Comput. Sci., 2018)

Stable and Pareto optimal group activity selection from ordinal preferences. - Andreas Darmann (Int. J. Game Theory, 2018)

Group activity selection problem with approval preferences. - Andreas Darmann; Edith Elkind; Sascha Kurz; Jérôme Lang; Joachim Schauer; Gerhard J. Woeginger (Int. J. Game Theory, 2018)

A social choice approach to ordinal group activity selection. - Andreas Darmann (Math. Soc. Sci., 2018)

On simplified NP-complete variants of Not-All-Equal 3-Sat and 3-Sat. - Andreas Darmann; Janosch Döcker (CoRR, 2019)

Manipulability in a group activity selection problem. - Andreas Darmann (Soc. Choice Welf., 2019)

Using the Borda rule for ranking sets of objects. - Andreas Darmann; Christian Klamler (Soc. Choice Welf., 2019)

On a simple hard variant of Not-All-Equal 3-Sat. - Andreas Darmann; Janosch Döcker (Theor. Comput. Sci., 2020)

Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Nevena Pivac; Ulrich Pferschy (ADT, 2021)

Hedonic Diversity Games Revisited. - Andreas Darmann (ADT, 2021)

On simplified NP-complete variants of Monotone3-Sat. - Andreas Darmann; Janosch Döcker (Discret. Appl. Math., 2021)

Simplified group activity selection with group size constraints. - Andreas Darmann; Janosch Döcker; Britta Dorn; Sebastian Schneckenburger (Int. J. Game Theory, 2022)

Algorithms for Participatory Democracy (Dagstuhl Seminar 22271). - Markus Brill; Jiehua Chen 001; Andreas Darmann; David M. Pennock; Matthias Greger (Dagstuhl Reports, 2022)

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy (CoRR, 2023)

Allocation of indivisible items with individual preference graphs. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy; Nevena Pivac (Discret. Appl. Math., 2023)

Stability and Welfare in (Dichotomous) Hedonic Diversity Games. - Andreas Darmann (Theory Comput. Syst., 2023)

Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy (CoRR, 2024)

An even simpler hard variant of Not-All-Equal 3-SAT. - Andreas Darmann; Janosch Döcker; Britta Dorn (CoRR, 2024)