Andreas Darmann

发表

On planar variants of the monotone satisfiability problem with bounded variable appearances pdf

Janosch Döcker, Andreas Darmann, Britta Dorn, 2016, Int. J. Found. Comput. Sci..

Group activity selection problem with approval preferences

Gerhard J. Woeginger, Edith Elkind, Jérôme Lang, 2018, Int. J. Game Theory.

Maximizing Nash Product Social Welfare in Allocating Indivisible Goods

Joachim Schauer, Andreas Darmann, Andreas Darmann, 2014, Eur. J. Oper. Res..

Manipulability in a group activity selection problem

Andreas Darmann, 2019, Soc. Choice Welf..

Maximizing the minimum voter satisfaction on spanning trees

Ulrich Pferschy, Christian Klamler, Andreas Darmann, 2009, Math. Soc. Sci..

On Simplified Group Activity Selection

Janosch Döcker, Jérôme Lang, Andreas Darmann, 2017, ADT.

On simplified NP-complete variants of Not-All-Equal 3-Sat and 3-Sat pdf

Janosch Döcker, Andreas Darmann, 2019, ArXiv.

On a simple hard variant of Not-All-Equal 3-Sat

Janosch Döcker, Andreas Darmann, Andreas Darmann, 2020, Theor. Comput. Sci..

A note on maximizing the minimum voter satisfaction on spanning trees

Ulrich Pferschy, Christian Klamler, Andreas Darmann, 2010, Math. Soc. Sci..

How hard is it to tell which is a Condorcet committee?☆

Andreas Darmann, 2013, Math. Soc. Sci..

Proportional Borda allocations

Christian Klamler, Andreas Darmann, 2016, Soc. Choice Welf..

Combinatorial optimization problems with conflict graphs

Gerhard J. Woeginger, Ulrich Pferschy, Joachim Schauer, 2009 .

Stable Group Activity Selection from Ordinal Preferences

Andreas Darmann, 2016 .

Group Activity Selection from Ordinal Preferences

Andreas Darmann, 2015, ADT.

On the Shortest Path Game

Ulrich Pferschy, Joachim Schauer, Andreas Darmann, 2017, Discret. Appl. Math..

A Social Choice Approach to Ordinal Group Activity Selection

Andreas Darmann, Andreas Darmann, 2016, Math. Soc. Sci..

Using the Borda rule for ranking sets of objects

Christian Klamler, Andreas Darmann, Christian Klamler, 2019, Soc. Choice Welf..

Approval, Borda, and the Condorcet Criterion in Ordinal Group Activity Selection

Andreas Darmann, 2016 .

The shortest connection game pdf

Ulrich Pferschy, Joachim Schauer, Andreas Darmann, 2017, Discret. Appl. Math..

It is difficult to tell if there is a Condorcet spanning tree

Andreas Darmann, 2016, Math. Methods Oper. Res..

Popular Spanning Trees

Andreas Darmann, Andreas Darmann, 2013, Int. J. Found. Comput. Sci..

Group Activity Selection Problem

Gerhard J. Woeginger, Edith Elkind, Jérôme Lang, 2012, WINE.

Determining a Minimum Spanning Tree with Disjunctive Constraints

Ulrich Pferschy, Joachim Schauer, Andreas Darmann, 2009, ADT.

On the shortest path game: extended version pdf

Ulrich Pferschy, Joachim Schauer, Andreas Darmann, 2015, ArXiv.

Monotone 3-Sat-4 is NP-complete pdf

Janosch Döcker, Andreas Darmann, 2016, ArXiv.

Stable and Pareto optimal group activity selection from ordinal preferences

Andreas Darmann, Andreas Darmann, 2018, Int. J. Game Theory.

Resource allocation with time intervals

Ulrich Pferschy, Joachim Schauer, Andreas Darmann, 2010, Theor. Comput. Sci..

Paths, trees and matchings under disjunctive constraints

Gerhard J. Woeginger, Ulrich Pferschy, Joachim Schauer, 2011, Discret. Appl. Math..

The Subset Sum game☆

Ulrich Pferschy, Gaia Nicosia, Joachim Schauer, 2014, Eur. J. Oper. Res..

The Shortest Path Game: Complexity and Algorithms

Ulrich Pferschy, Joachim Schauer, Andreas Darmann, 2014, IFIP TCS.

Hedonic Diversity Games Revisited

Andreas Darmann, 2021, ADT.

On simplified NP-complete variants of Monotone3-Sat

Janosch Döcker, Andreas Darmann, 2021, Discret. Appl. Math..

Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs

Martin Milanič, Ulrich Pferschy, Stefan Lendl, 2021, ADT.

Simplified group activity selection with group size constraints

Janosch Döcker, Andreas Darmann, Britta Dorn, 2021, Int. J. Game Theory.

Minimal Spanning Trees with Conflict Graphs

Ulrich Pferschy, Andreas Darmann, Joachim Schauer, 2008 .

Finding socially best spanning trees

Ulrich Pferschy, Christian Klamler, Andreas Darmann, 2008 .

A Note on Maximizing the Minimum Voter Satisfaction on Spanning Trees

Ulrich Pferschy, Christian Klamler, Andreas Darmann, 2010 .

Maximizing Nash Product Social Welfare in Allocating Indivisible Goods

Andreas Darmann, Joachim Schauer, 2014 .

Sharing the Cost of a Path

Ulrich Pferschy, Christian Klamler, Andreas Darmann, 2013 .