|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 5 keywords
|
|
|
|
|
Results
Found 26 publication records. Showing 26 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien |
Computing Nash Equilibria for Scheduling on Restricted Parallel Links.  |
Theory Comput. Syst.  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode |
A new model for selfish routing. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien |
The price of anarchy for polynomial social cost. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Decker, Thomas Lücking, Burkhard Monien |
A 5/4-approximation algorithm for scheduling identical malleable tasks. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien |
The Price of Anarchy for Restricted Parallel Links. |
Parallel Processing Letters |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Lücking |
Analyzing models for scheduling and routing. |
|
2005 |
RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis |
Structure and complexity of extreme Nash equilibria. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien |
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. |
WINE |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann |
Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien |
The Price of Anarchy for Polynomial Social Cost. |
Computing and Markets |
2005 |
DBLP BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode |
Nash Equilibria in Discrete Routing Games with Convex Latency Functions. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien |
The Price of Anarchy for Polynomial Social Cost. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode |
A New Model for Selfish Routing. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien |
Computing Nash equilibria for scheduling on restricted parallel links. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
approximation algorithms, Nash equilibria, selfish routing, unsplittable flow, machine scheduling |
| 1 | Joachim von zur Gathen, Thomas Lücking |
Subresultants revisited. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode |
Selfish Routing in Non-Cooperative Networks: A Survey. |
Bulletin of the EATCS |
2003 |
DBLP BibTeX RDF |
|
| 1 | Robert Elsässer, Thomas Lücking, Burkhard Monien |
On Spectral Bounds for the k-Partitioning of Graphs. |
Theory Comput. Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis |
Extreme Nash Equilibria. |
ICTCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode |
Nashification and the Coordination Ratio for a Selfish Routing Game. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto |
Which Is the Worst-Case Nash Equilibrium? |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode |
Selfish Routing in Non-cooperative Networks: A Survey. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Decker, Thomas Lücking, Burkhard Monien |
A 5/4-Approximation Algorithm for Scheduling Identical Malleable Tasks. |
WAOA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Lücking, Burkhard Monien, Manuel Rode |
On the Problem of Scheduling Flows on Distributed Networks. |
MFCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Elsässer, Thomas Lücking, Burkhard Monien |
New spectral bounds on k-partitioning of graphs. |
SPAA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim von zur Gathen, Thomas Lücking |
Subresultants Revisited. |
LATIN |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #26 of 26 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")