2008 |
24 | EE | Martin Gairing,
Thomas Lücking,
Marios Mavronicolas,
Burkhard Monien,
Manuel Rode:
Nash equilibria in discrete routing games with convex latency functions.
J. Comput. Syst. Sci. 74(7): 1199-1225 (2008) |
23 | EE | Thomas Lücking,
Marios Mavronicolas,
Burkhard Monien,
Manuel Rode:
A new model for selfish routing.
Theor. Comput. Sci. 406(3): 187-206 (2008) |
2006 |
22 | EE | Martin Gairing,
Thomas Lücking,
Marios Mavronicolas,
Burkhard Monien:
The Price of Anarchy for Restricted Parallel Links.
Parallel Processing Letters 16(1): 117-132 (2006) |
21 | EE | Thomas Decker,
Thomas Lücking,
Burkhard Monien:
A 5/4-approximation algorithm for scheduling identical malleable tasks.
Theor. Comput. Sci. 361(2-3): 226-240 (2006) |
20 | EE | Martin Gairing,
Thomas Lücking,
Marios Mavronicolas,
Burkhard Monien:
The price of anarchy for polynomial social cost.
Theor. Comput. Sci. 369(1-3): 116-135 (2006) |
2005 |
19 | EE | Martin Gairing,
Thomas Lücking,
Marios Mavronicolas,
Burkhard Monien:
The Price of Anarchy for Polynomial Social Cost.
Computing and Markets 2005 |
18 | 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 |
17 | EE | Robert Elsässer,
Martin Gairing,
Thomas Lücking,
Marios Mavronicolas,
Burkhard Monien:
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling.
WINE 2005: 195-209 |
16 | EE | Martin Gairing,
Thomas Lücking,
Marios Mavronicolas,
Burkhard Monien,
Paul G. Spirakis:
Structure and complexity of extreme Nash equilibria.
Theor. Comput. Sci. 343(1-2): 133-157 (2005) |
2004 |
15 | EE | Martin Gairing,
Thomas Lücking,
Marios Mavronicolas,
Burkhard Monien,
Manuel Rode:
Nash Equilibria in Discrete Routing Games with Convex Latency Functions.
ICALP 2004: 645-657 |
14 | EE | Martin Gairing,
Thomas Lücking,
Marios Mavronicolas,
Burkhard Monien:
The Price of Anarchy for Polynomial Social Cost.
MFCS 2004: 574-585 |
13 | EE | Thomas Lücking,
Marios Mavronicolas,
Burkhard Monien,
Manuel Rode:
A New Model for Selfish Routing.
STACS 2004: 547-558 |
12 | EE | Martin Gairing,
Thomas Lücking,
Marios Mavronicolas,
Burkhard Monien:
Computing Nash equilibria for scheduling on restricted parallel links.
STOC 2004: 613-622 |
2003 |
11 | EE | Rainer Feldmann,
Martin Gairing,
Thomas Lücking,
Burkhard Monien,
Manuel Rode:
Nashification and the Coordination Ratio for a Selfish Routing Game.
ICALP 2003: 514-526 |
10 | EE | Martin Gairing,
Thomas Lücking,
Marios Mavronicolas,
Burkhard Monien,
Paul G. Spirakis:
Extreme Nash Equilibria.
ICTCS 2003: 1-20 |
9 | EE | Rainer Feldmann,
Martin Gairing,
Thomas Lücking,
Burkhard Monien,
Manuel Rode:
Selfish Routing in Non-cooperative Networks: A Survey.
MFCS 2003: 21-45 |
8 | EE | Thomas Lücking,
Marios Mavronicolas,
Burkhard Monien,
Manuel Rode,
Paul G. Spirakis,
Imrich Vrto:
Which Is the Worst-Case Nash Equilibrium?
MFCS 2003: 551-561 |
7 | EE | Thomas Decker,
Thomas Lücking,
Burkhard Monien:
A 5/4-Approximation Algorithm for Scheduling Identical Malleable Tasks.
WAOA 2003: 95-108 |
6 | | Rainer Feldmann,
Martin Gairing,
Thomas Lücking,
Burkhard Monien,
Manuel Rode:
Selfish Routing in Non-Cooperative Networks: A Survey.
Bulletin of the EATCS 81: 137-164 (2003) |
5 | EE | Joachim von zur Gathen,
Thomas Lücking:
Subresultants revisited.
Theor. Comput. Sci. 297(1-3): 199-239 (2003) |
4 | EE | Robert Elsässer,
Thomas Lücking,
Burkhard Monien:
On Spectral Bounds for the k-Partitioning of Graphs.
Theory Comput. Syst. 36(5): 461-478 (2003) |
2002 |
3 | EE | Thomas Lücking,
Burkhard Monien,
Manuel Rode:
On the Problem of Scheduling Flows on Distributed Networks.
MFCS 2002: 495-505 |
2001 |
2 | EE | Robert Elsässer,
Thomas Lücking,
Burkhard Monien:
New spectral bounds on k-partitioning of graphs.
SPAA 2001: 255-262 |
2000 |
1 | | Joachim von zur Gathen,
Thomas Lücking:
Subresultants Revisited.
LATIN 2000: 318-342 |