 | 2011 |
|---|
| 8 |       | Sebastian Aland,
Dominic Dumrauf,
Martin Gairing,
Burkhard Monien,
Florian Schoppmann:
Exact Price of Anarchy for Polynomial Congestion Games.
SIAM J. Comput. 40(5): 1211-1233 (2011) |
| 2010 |
|---|
| 7 | | Dominic Dumrauf,
Tim Süß:
On the Complexity of Local Search for Weighted Standard Set Problems.
CiE 2010: 132-140 |
| 6 | | Burkhard Monien,
Dominic Dumrauf,
Tobias Tscheuschner:
Local Search: Simple, Successful, But Sometimes Sluggish.
ICALP (1) 2010: 1-17 |
| 5 | | Dominic Dumrauf,
Tim Süß:
On the Complexity of Local Search for Weighted Standard Set Problems
CoRR abs/1004.0871: (2010) |
| 2009 |
|---|
| 4 | | Dominic Dumrauf,
Burkhard Monien,
Karsten Tiemann:
MultiProcessor Scheduling is PLS-Complete.
HICSS 2009: 1-10 |
| 2008 |
|---|
| 3 | | Dominic Dumrauf,
Burkhard Monien:
On the Road to -Completeness: 8 Agents in a Singleton Congestion Game.
WINE 2008: 94-108 |
| 2006 |
|---|
| 2 | | Sebastian Aland,
Dominic Dumrauf,
Martin Gairing,
Burkhard Monien,
Florian Schoppmann:
Exact Price of Anarchy for Polynomial Congestion Games.
STACS 2006: 218-229 |
| 1 | | Dominic Dumrauf,
Martin Gairing:
Price of Anarchy for Polynomial Wardrop Games.
WINE 2006: 319-330 |
Data released under the ODC-BY 1.0 license — See also our legal information page