| The structure and complexity of Nash equilibria for a selfish routing game D Fotakis, S Kontogiannis, E Koutsoupias, M Mavronicolas, P Spirakis International Colloquium on Automata, Languages, and Programming, 123-134, 2002 | 271 | 2002 |
| Selfish unsplittable flows D Fotakis, S Kontogiannis, P Spirakis Theoretical Computer Science 348 (2-3), 226-239, 2005 | 200 | 2005 |
| Polynomial algorithms for approximating Nash equilibria of bimatrix games SC Kontogiannis, PN Panagopoulou, PG Spirakis International Workshop on Internet and Network Economics, 286-296, 2006 | 70 | 2006 |
| Selfish unsplittable flows D Fotakis, S Kontogiannis, P Spirakis International Colloquium on Automata, Languages, and Programming, 593-605, 2004 | 69 | 2004 |
| The structure and complexity of Nash equilibria for a selfish routing game D Fotakis, S Kontogiannis, E Koutsoupias, M Mavronicolas, P Spirakis Theoretical Computer Science 410 (36), 3305-3326, 2009 | 67 | 2009 |
| Symmetry in network congestion games: Pure equilibria and anarchy cost D Fotakis, S Kontogiannis, P Spirakis International Workshop on Approximation and Online Algorithms, 161-175, 2005 | 64 | 2005 |
| Atomic congestion games among coalitions D Fotakis, S Kontogiannis, P Spirakis International Colloquium on Automata, Languages, and Programming, 572-583, 2006 | 47 | 2006 |
| Well supported approximate equilibria in bimatrix games SC Kontogiannis, PG Spirakis Algorithmica 57 (4), 653-667, 2010 | 40 | 2010 |
| Atomic congestion games among coalitions D Fotakis, S Kontogiannis, P Spirakis ACM Transactions on Algorithms (TALG) 4 (4), 1-27, 2008 | 40 | 2008 |
| Atomic selfish routing in networks: A survey S Kontogiannis, P Spirakis International Workshop on Internet and Network Economics, 989-1002, 2005 | 37 | 2005 |
| Polynomial algorithms for approximating Nash equilibria of bimatrix games SC Kontogiannis, PN Panagopoulou, PG Spirakis Theoretical Computer Science 410 (17), 1599-1606, 2009 | 32 | 2009 |
| Efficient algorithms for constant well supported approximate equilibria in bimatrix games SC Kontogiannis, PG Spirakis International Colloquium on Automata, Languages, and Programming, 595-606, 2007 | 31 | 2007 |
| Distance oracles for time-dependent networks S Kontogiannis, C Zaroliagis Algorithmica 74 (4), 1404-1434, 2016 | 28 | 2016 |
| Engineering oracles for time-dependent road networks S Kontogiannis, G Michalopoulos, G Papastavrou, A Paraskevopoulos, ... 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and …, 2016 | 15 | 2016 |
| Analysis and experimental evaluation of time-dependent distance oracles S Kontogiannis, G Michalopoulos, G Papastavrou, A Paraskevopoulos, ... 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and …, 2014 | 15 | 2014 |
| Approximability of symmetric bimatrix games and related experiments S Kontogiannis, P Spirakis International Symposium on Experimental Algorithms, 1-20, 2011 | 12 | 2011 |
| Robust line planning under unknown incentives and elasticity of frequencies S Kontogiannis, C Zaroliagis 8th Workshop on Algorithmic Approaches for Transportation Modeling …, 2008 | 11 | 2008 |
| Exploiting concavity in bimatrix games: New polynomially tractable subclasses S Kontogiannis, P Spirakis Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2010 | 10 | 2010 |
| Using Multimedia/Hypermedia Tools Over Networks for Distance Education & Training C Bouras, D Fotakis, V Kapoulas, S Kontogiannis, P Lampsas, P Spirakis, ... Educational Technology Review, 20-26, 1997 | 10 | 1997 |
| Improved oracles for time-dependent road networks S Kontogiannis, G Papastavrou, A Paraskevopoulos, D Wagner, ... arXiv preprint arXiv:1704.08445, 2017 | 9 | 2017 |
Paul SpirakisProfessor of Computer Science U. Liverpool and U. PatrasDirección de correo verificada de liverpool.ac.uk
