The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Gairing: [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, Burkhard Monien, Karsten Tiemann
    Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:501-512 [Conf]
  6. Martin Gairing, Burkhard Monien, Andreas Woclaw
    A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:828-839 [Conf]
  7. 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]
  8. 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]
  9. 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]
  10. Martin Gairing, Burkhard Monien, Karsten Tiemann
    Selfish routing with incomplete information. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:203-212 [Conf]
  11. Martin Gairing, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae
    Self-Stabilizing Algorithms for {k}-Domination. [Citation Graph (0, 0)][DBLP]
    Self-Stabilizing Systems, 2003, pp:49-60 [Conf]
  12. Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann
    Exact Price of Anarchy for Polynomial Congestion Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:218-229 [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. Dominic Dumrauf, Martin Gairing
    Price of Anarchy for Polynomial Wardrop Games. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:319-330 [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. Martin Gairing, Robert Geist, Stephen T. Hedetniemi, Petter Kristiansen
    A Self-stabilizing Algorithm for Maximal 2-packing. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2004, v:11, n:1, pp:1-11 [Journal]
  18. Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs
    Self-Stabilizing Maximal K-Dependent Sets In Linear Time. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2004, v:14, n:1, pp:75-82 [Journal]
  19. Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae
    Distance-two information in self-stabilizing algorithms. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2004, v:14, n:3-4, pp:387-398 [Journal]
  20. 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]
  21. 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]
  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]
  23. Martin Gairing, Burkhard Monien, Andreas Woclaw
    A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:1-2, pp:87-99 [Journal]

  24. Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness. [Citation Graph (, )][DBLP]


  25. Quasirandom Load Balancing. [Citation Graph (, )][DBLP]


  26. Malicious Bayesian Congestion Games. [Citation Graph (, )][DBLP]


  27. Total Latency in Singleton Congestion Games. [Citation Graph (, )][DBLP]


  28. Covering Games: Approximation through Non-cooperation. [Citation Graph (, )][DBLP]


  29. Malicious Bayesian Congestion Games [Citation Graph (, )][DBLP]


  30. Quasirandom Load Balancing [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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