Andreas Darmann

44 papers C 1Journal 36Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Computational Social Choice: Research & Development. CoRR Dorothea Baumeister, Ratip Emin Berker, Niclas Boehmer, Sylvain Bouveret, Andreas Darmann, Piotr Faliszewski, Martin Lackner, Jérôme Lang, Nicholas Mattei, Arianna Novaro
2025	J	`jnl`	Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph. Discret. Optim. Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
2024	J	`jnl`	Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. CoRR Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
2024	J	`jnl`	An even simpler hard variant of Not-All-Equal 3-SAT. CoRR Andreas Darmann, Janosch Döcker, Britta Dorn
2023	J	`jnl`	Allocation of indivisible items with individual preference graphs. Discret. Appl. Math. Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
2023	J	`jnl`	Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. CoRR Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
2023	J	`jnl`	Stability and Welfare in (Dichotomous) Hedonic Diversity Games. Theory Comput. Syst. Andreas Darmann
2022	J	`jnl`	Algorithms for Participatory Democracy (Dagstuhl Seminar 22271). Dagstuhl Reports Markus Brill, Jiehua Chen, Andreas Darmann, David M. Pennock, Matthias Greger
2022	J	`jnl`	Allocation of Indivisible Items with Individual Preference Graphs. CoRR Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
2022	J	`jnl`	Simplified group activity selection with group size constraints. Int. J. Game Theory Andreas Darmann, Janosch Döcker, Britta Dorn, Sebastian Schneckenburger
2021	—	`conf`	Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. ADT Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Nevena Pivac, Ulrich Pferschy
2021	—	`conf`	Hedonic Diversity Games Revisited. ADT Andreas Darmann
2021	J	`jnl`	On simplified NP-complete variants of Monotone3-Sat. Discret. Appl. Math. Andreas Darmann, Janosch Döcker
2020	J	`jnl`	On a simple hard variant of Not-All-Equal 3-Sat. Theor. Comput. Sci. Andreas Darmann, Janosch Döcker
2019	J	`jnl`	Manipulability in a group activity selection problem. Soc. Choice Welf. Andreas Darmann
2019	J	`jnl`	On simplified NP-complete variants of Not-All-Equal 3-Sat and 3-Sat. CoRR Andreas Darmann, Janosch Döcker
2019	J	`jnl`	Using the Borda rule for ranking sets of objects. Soc. Choice Welf. Andreas Darmann, Christian Klamler
2018	J	`jnl`	A social choice approach to ordinal group activity selection. Math. Soc. Sci. Andreas Darmann
2018	J	`jnl`	Group activity selection problem with approval preferences. Int. J. Game Theory Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger
2018	J	`jnl`	Stable and Pareto optimal group activity selection from ordinal preferences. Int. J. Game Theory Andreas Darmann
2018	J	`jnl`	The Monotone Satisfiability Problem with Bounded Variable Appearances. Int. J. Found. Comput. Sci. Andreas Darmann, Janosch Döcker, Britta Dorn
2017	—	`conf`	On Simplified Group Activity Selection. ADT Andreas Darmann, Janosch Döcker, Britta Dorn, Jérôme Lang, Sebastian Schneckenburger
2017	J	`jnl`	On the Shortest Path Game. Discret. Appl. Math. Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2017	J	`jnl`	The shortest connection game. Discret. Appl. Math. Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2016	J	`jnl`	It is difficult to tell if there is a Condorcet spanning tree. Math. Methods Oper. Res. Andreas Darmann
2016	J	`jnl`	Monotone 3-Sat-4 is NP-complete. CoRR Andreas Darmann, Janosch Döcker
2016	J	`jnl`	On planar variants of the monotone satisfiability problem with bounded variable appearances. CoRR Andreas Darmann, Janosch Döcker, Britta Dorn
2016	J	`jnl`	Proportional Borda allocations. Soc. Choice Welf. Andreas Darmann, Christian Klamler
2015	—	`conf`	Group Activity Selection from Ordinal Preferences. ADT Andreas Darmann
2015	J	`jnl`	Maximizing Nash product social welfare in allocating indivisible goods. Eur. J. Oper. Res. Andreas Darmann, Joachim Schauer
2015	J	`jnl`	On the shortest path game: extended version. CoRR Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2015	J	`jnl`	The Shortest Connection Game. CoRR Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2014	J	`jnl`	Group Activity Selection Problem. CoRR Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger
2014	—	`conf`	The Shortest Path Game: Complexity and Algorithms. IFIP TCS Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2014	J	`jnl`	The Subset Sum game. Eur. J. Oper. Res. Andreas Darmann, Gaia Nicosia, Ulrich Pferschy, Joachim Schauer
2013	J	`jnl`	How hard is it to tell which is a Condorcet committee? Math. Soc. Sci. Andreas Darmann
2013	J	`jnl`	Popular Spanning Trees. Int. J. Found. Comput. Sci. Andreas Darmann
2012	—	`conf`	Group Activity Selection Problem. WINE Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger
2011	J	`jnl`	Paths, trees and matchings under disjunctive constraints. Discret. Appl. Math. Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger
2010	J	`jnl`	A note on maximizing the minimum voter satisfaction on spanning trees. Math. Soc. Sci. Andreas Darmann, Christian Klamler, Ulrich Pferschy
2010	J	`jnl`	Resource allocation with time intervals. Theor. Comput. Sci. Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2009	C	`conf`	Combinatorial Optimization Problems with Conflict Graphs. CTW Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger
2009	—	`conf`	Determining a Minimum Spanning Tree with Disjunctive Constraints. ADT Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2009	J	`jnl`	Maximizing the minimum voter satisfaction on spanning trees. Math. Soc. Sci. Andreas Darmann, Christian Klamler, Ulrich Pferschy