Andreas Darmann

Theory Comput. Syst., December, 2023

Allocation of indivisible items with individual preference graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., July, 2023

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Algorithms for Participatory Democracy (Dagstuhl Seminar 22271).

[BibT_eX]

[DOI]

Dagstuhl Reports, July, 2022

Simplified group activity selection with group size constraints.

[BibT_eX]

[DOI]

Sebastian Schneckenburger

Britta Dorn

Int. J. Game Theory, 2022

2021

On simplified NP-complete variants of Monotone3-Sat.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Hedonic Diversity Games Revisited.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

2020

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

2019

Using the Borda rule for ranking sets of objects.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2019

Manipulability in a group activity selection problem.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

2018

A social choice approach to ordinal group activity selection.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2018

Group activity selection problem with approval preferences.

[BibT_eX]

[DOI]

Int. J. Game Theory, 2018

Stable and Pareto optimal group activity selection from ordinal preferences.

[BibT_eX]

[DOI]

Int. J. Game Theory, 2018

The Monotone Satisfiability Problem with Bounded Variable Appearances.

[BibT_eX]

[DOI]

Britta Dorn

Int. J. Found. Comput. Sci., 2018

2017

The shortest connection game.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

On the Shortest Path Game.

[BibT_eX]

[DOI]

Sebastian Schneckenburger

Discret. Appl. Math., 2017

On Simplified Group Activity Selection.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

2016

Proportional Borda allocations.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2016

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

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2016

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

[BibT_eX]

[DOI]

Britta Dorn

CoRR, 2016

Monotone 3-Sat-4 is NP-complete.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Maximizing Nash product social welfare in allocating indivisible goods.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

On the shortest path game: extended version.

[BibT_eX]

[DOI]

CoRR, 2015

Group Activity Selection from Ordinal Preferences.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

2014

The Subset Sum game.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

The Shortest Path Game: Complexity and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2014

2013

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

[BibT_eX]

[DOI]

Math. Soc. Sci., 2013

Popular Spanning Trees.

[BibT_eX]

[DOI]

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

2012

Group Activity Selection Problem.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

2011

Paths, trees and matchings under disjunctive constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2010

Resource allocation with time intervals.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

A note on maximizing the minimum voter satisfaction on spanning trees.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2010

2009

Maximizing the minimum voter satisfaction on spanning trees.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2009

Combinatorial Optimization Problems with Conflict Graphs.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Determining a Minimum Spanning Tree with Disjunctive Constraints.

[BibT_eX]

[DOI]