| 2009 |
|---|
| 11 | EE | Dominic Dumrauf,
Burkhard Monien,
Karsten Tiemann:
MultiProcessor Scheduling is PLS-Complete.
HICSS 2009: 1-10 |
| 2008 |
|---|
| 10 | EE | Martin Gairing,
Burkhard Monien,
Karsten Tiemann:
Selfish Routing with Incomplete Information.
Theory Comput. Syst. 42(1): 91-130 (2008) |
| 2007 |
|---|
| 9 | EE | Burkhard Monien,
Karsten Tiemann:
Routing and Scheduling with Incomplete Information.
DISC 2007: 1-2 |
| 8 | EE | Marios Mavronicolas,
Igal Milchtaich,
Burkhard Monien,
Karsten Tiemann:
Congestion Games with Player-Specific Constants.
MFCS 2007: 633-644 |
| 7 | EE | Yvonne Bleischwitz,
Burkhard Monien,
Florian Schoppmann,
Karsten Tiemann:
The Power of Two Prices: Beyond Cross-Monotonicity.
MFCS 2007: 657-668 |
| 2006 |
|---|
| 6 | EE | Martin Gairing,
Burkhard Monien,
Karsten Tiemann:
Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions.
ICALP (1) 2006: 501-512 |
| 5 | EE | Vladimir Mazalov,
Burkhard Monien,
Florian Schoppmann,
Karsten Tiemann:
Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic.
WINE 2006: 331-342 |
| 4 | EE | Torsten Fahle,
Karsten Tiemann:
A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques.
ACM Journal of Experimental Algorithmics 11: (2006) |
| 2005 |
|---|
| 3 | EE | Martin Gairing,
Thomas Lücking,
Burkhard Monien,
Karsten Tiemann:
Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture.
ICALP 2005: 51-65 |
| 2 | EE | Martin Gairing,
Burkhard Monien,
Karsten Tiemann:
Selfish routing with incomplete information.
SPAA 2005: 203-212 |
| 1 | EE | Torsten Fahle,
Karsten Tiemann:
An Improved Branch-and-Bound Algorithm for the Test Cover Problem.
WEA 2005: 89-100 |
