The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas Lücking: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002