default search action
Andreas Darmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i10]Nina Chiarelli, Clément Dallard
, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy:
Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. CoRR abs/2402.00921 (2024) - 2023
- [j23]Nina Chiarelli, Clément Dallard
Allocation of indivisible items with individual preference graphs. Discret. Appl. Math. 334: 45-62 (2023) - [j22]Andreas Darmann:
Stability and Welfare in (Dichotomous) Hedonic Diversity Games. Theory Comput. Syst. 67(6): 1133-1155 (2023) - [i9]Nina Chiarelli, Clément Dallard
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. CoRR abs/2312.01804 (2023) - 2022
- [j21]Andreas Darmann, Janosch Döcker, Britta Dorn, Sebastian Schneckenburger:
Simplified group activity selection with group size constraints. Int. J. Game Theory 51(1): 169-212 (2022) - [i8]Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac:
Allocation of Indivisible Items with Individual Preference Graphs. CoRR abs/2202.04465 (2022) - [i7]Markus Brill, Jiehua Chen, Andreas Darmann, David M. Pennock, Matthias Greger:
Algorithms for Participatory Democracy (Dagstuhl Seminar 22271). Dagstuhl Reports 12(7): 1-18 (2022) - 2021
- [j20]Andreas Darmann, Janosch Döcker:
On simplified NP-complete variants of Monotone3-Sat. Discret. Appl. Math. 292: 45-58 (2021) - [c8]Nina Chiarelli, Clément Dallard
Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. ADT 2021: 243-257 - [c7]Andreas Darmann:
Hedonic Diversity Games Revisited. ADT 2021: 357-372 - 2020
- [j19]Andreas Darmann, Janosch Döcker:
On a simple hard variant of Not-All-Equal 3-Sat. Theor. Comput. Sci. 815: 147-152 (2020)
2010 – 2019
- 2019
- [j18]Andreas Darmann
Manipulability in a group activity selection problem. Soc. Choice Welf. 52(3): 527-557 (2019) - [j17]Andreas Darmann, Christian Klamler
Using the Borda rule for ranking sets of objects. Soc. Choice Welf. 53(3): 399-414 (2019) - [i6]Andreas Darmann, Janosch Döcker:
On simplified NP-complete variants of Not-All-Equal 3-Sat and 3-Sat. CoRR abs/1908.04198 (2019) - 2018
- [j16]Andreas Darmann, Janosch Döcker, Britta Dorn:
The Monotone Satisfiability Problem with Bounded Variable Appearances. Int. J. Found. Comput. Sci. 29(6): 979-993 (2018) - [j15]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer
Group activity selection problem with approval preferences. Int. J. Game Theory 47(3): 767-796 (2018) - [j14]Andreas Darmann:
Stable and Pareto optimal group activity selection from ordinal preferences. Int. J. Game Theory 47(4): 1183-1209 (2018) - [j13]Andreas Darmann:
A social choice approach to ordinal group activity selection. Math. Soc. Sci. 93: 57-66 (2018) - 2017
- [j12]Andreas Darmann, Ulrich Pferschy
On the Shortest Path Game. Discret. Appl. Math. 217: 3-18 (2017) - [j11]Andreas Darmann, Ulrich Pferschy
The shortest connection game. Discret. Appl. Math. 231: 139-154 (2017) - [c6]Andreas Darmann, Janosch Döcker, Britta Dorn, Jérôme Lang, Sebastian Schneckenburger:
On Simplified Group Activity Selection. ADT 2017: 255-269 - 2016
- [j10]Andreas Darmann:
It is difficult to tell if there is a Condorcet spanning tree. Math. Methods Oper. Res. 84(1): 93-104 (2016) - [j9]Andreas Darmann, Christian Klamler
Proportional Borda allocations. Soc. Choice Welf. 47(3): 543-558 (2016) - [i5]Andreas Darmann, Janosch Döcker:
Monotone 3-Sat-4 is NP-complete. CoRR abs/1603.07881 (2016) - [i4]Andreas Darmann, Janosch Döcker, Britta Dorn:
On planar variants of the monotone satisfiability problem with bounded variable appearances. CoRR abs/1604.05588 (2016) - 2015
- [j8]Andreas Darmann, Joachim Schauer
Maximizing Nash product social welfare in allocating indivisible goods. Eur. J. Oper. Res. 247(2): 548-559 (2015) - [c5]Andreas Darmann:
Group Activity Selection from Ordinal Preferences. ADT 2015: 35-51 - [i3]Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
On the shortest path game: extended version. CoRR abs/1506.00462 (2015) - [i2]Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
The Shortest Connection Game. CoRR abs/1511.07847 (2015) - 2014
- [j7]Andreas Darmann, Gaia Nicosia
The Subset Sum game. Eur. J. Oper. Res. 233(3): 539-549 (2014) - [c4]Andreas Darmann, Ulrich Pferschy, Joachim Schauer
The Shortest Path Game: Complexity and Algorithms. IFIP TCS 2014: 39-53 - [i1]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger:
Group Activity Selection Problem. CoRR abs/1401.8151 (2014) - 2013
- [j6]Andreas Darmann:
Popular Spanning Trees. Int. J. Found. Comput. Sci. 24(5): 655-678 (2013) - [j5]Andreas Darmann:
How hard is it to tell which is a Condorcet committee? Math. Soc. Sci. 66(3): 282-292 (2013) - 2012
- [c3]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer
Group Activity Selection Problem. WINE 2012: 156-169 - 2011
- [j4]Andreas Darmann, Ulrich Pferschy
Paths, trees and matchings under disjunctive constraints. Discret. Appl. Math. 159(16): 1726-1735 (2011) - 2010
- [j3]Andreas Darmann, Christian Klamler
A note on maximizing the minimum voter satisfaction on spanning trees. Math. Soc. Sci. 60(1): 82-85 (2010) - [j2]Andreas Darmann, Ulrich Pferschy
Resource allocation with time intervals. Theor. Comput. Sci. 411(49): 4217-4234 (2010)
2000 – 2009
- 2009
- [j1]Andreas Darmann, Christian Klamler
Maximizing the minimum voter satisfaction on spanning trees. Math. Soc. Sci. 58(2): 238-250 (2009) - [c2]Andreas Darmann, Ulrich Pferschy
Determining a Minimum Spanning Tree with Disjunctive Constraints. ADT 2009: 414-423 - [c1]Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger:
Combinatorial Optimization Problems with Conflict Graphs. CTW 2009: 293-296
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: