Andreas Darmann

According to our database1, Andreas Darmann authored at least 29 papers between 2009 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On a simple hard variant of Not-All-Equal 3-Sat.
Theor. Comput. Sci., 2020

2019
Using the Borda rule for ranking sets of objects.
Soc. Choice Welf., 2019

Manipulability in a group activity selection problem.
Soc. Choice Welf., 2019

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

2018
A social choice approach to ordinal group activity selection.
Math. Soc. Sci., 2018

Group activity selection problem with approval preferences.
Int. J. Game Theory, 2018

Stable and Pareto optimal group activity selection from ordinal preferences.
Int. J. Game Theory, 2018

The Monotone Satisfiability Problem with Bounded Variable Appearances.
Int. J. Found. Comput. Sci., 2018

2017
The shortest connection game.
Discret. Appl. Math., 2017

On the Shortest Path Game.
Discret. Appl. Math., 2017

On Simplified Group Activity Selection.
Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

2016
Proportional Borda allocations.
Soc. Choice Welf., 2016

It is difficult to tell if there is a Condorcet spanning tree.
Math. Methods Oper. Res., 2016

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

Monotone 3-Sat-4 is NP-complete.
CoRR, 2016

2015
Maximizing Nash product social welfare in allocating indivisible goods.
Eur. J. Oper. Res., 2015

On the shortest path game: extended version.
CoRR, 2015

Group Activity Selection from Ordinal Preferences.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

2014
The Subset Sum game.
Eur. J. Oper. Res., 2014

The Shortest Path Game: Complexity and Algorithms.
Proceedings of the Theoretical Computer Science, 2014

2013
How hard is it to tell which is a Condorcet committee?
Math. Soc. Sci., 2013

Popular Spanning Trees.
Int. J. Found. Comput. Sci., 2013

2012
Group Activity Selection Problem.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

2011
Paths, trees and matchings under disjunctive constraints.
Discret. Appl. Math., 2011

2010
Resource allocation with time intervals.
Theor. Comput. Sci., 2010

A note on maximizing the minimum voter satisfaction on spanning trees.
Math. Soc. Sci., 2010

2009
Maximizing the minimum voter satisfaction on spanning trees.
Math. Soc. Sci., 2009

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

Determining a Minimum Spanning Tree with Disjunctive Constraints.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009


  Loading...