Get started
Author

Spyros C. Kontogiannis

Observed names: Kontogiannis, Spyros, Kontogiannis, Spyros C., S. C. Kontogiannis, S. Kontogiannis, Spyros Kontogiannis, Σπύρος Κοντογιάννης
ORCID: 0000-0002-8559-6418
Observed ORCID: 0000-0002-8559-6418
OpenAlex ID: A5086270340
Selfish unsplittable flows
2005 · Dimitris Fotakis, Spyros Kontogiannis, et al. · Theoretical Computer Science · 217
PDF
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
2002 · Dimitris Fotakis, Spyros Kontogiannis, et al. · Lecture notes in computer science · 215
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
2006 · Spyros C. Kontogiannis, Panagiota N. Panagopoulou, et al. · Theoretical Computer Science · 108
PDF
The structure and complexity of Nash equilibria for a selfish routing game
2008 · Dimitris Fotakis, Spyros Kontogiannis, et al. · Theoretical Computer Science · 93
PDF
Atomic congestion games among coalitions
2008 · Dimitris Fotakis, Spyros Kontogiannis, et al. · ACM Transactions on Algorithms · 57
Well Supported Approximate Equilibria in Bimatrix Games
2008 · Spyros C. Kontogiannis, Paul G. Spirakis · Algorithmica · 51
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
2006 · Dimitris Fotakis, Spyros Kontogiannis, et al. · Lecture notes in computer science · 50
Selfish Unsplittable Flows
2004 · Dimitris Fotakis, Spyros Kontogiannis, et al. · Lecture notes in computer science · 47
Atomic Congestion Games Among Coalitions
2006 · Dimitris Fotakis, Spyros Kontogiannis, et al. · Lecture notes in computer science · 36
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
2007 · Spyros C. Kontogiannis, Paul G. Spirakis · Lecture notes in computer science · 35
Atomic Selfish Routing in Networks: A Survey
2005 · Spyros Kontogiannis, Paul Spirakis · Lecture notes in computer science · 30
Distance Oracles for Time-Dependent Networks
2015 · Spyros Kontogiannis, Christos Zaroliagis · Algorithmica · 20
PDF
Algorithms, Probability, Networks, and Games
2015 · Christos Zaroliagis, Grammati Pantziou, et al. · Lecture notes in computer science · 19
Approximability of Symmetric Bimatrix Games and Related Experiments
2011 · Spyros Kontogiannis, Paul Spirakis · Lecture notes in computer science · 18
Multimodal route and tour planning in urban environments
2017 · Julian Dibbelt, Charalampos Konstantopoulos, et al. · IEEE Symposium on Computers and Communications (ISCC) · 15
Analysis and Experimental Evaluation of Time-Dependent Distance Oracles
2014 · Spyros Kontogiannis, George Michalopoulos, et al. · Society for Industrial and Applied Mathematics eBooks · 14
Engineering Oracles for Time-Dependent Road Networks
2015 · Spyros Kontogiannis, George Michalopoulos, et al. · 12
PDF
Internet and Network Economics: Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006. Proceedings
2006 · Spirakis, Paul, Mavronicolas, Marios, et al. · Lecture notes in computer science · 11
Improved Oracles for Time-Dependent Road Networks
2017 · Kontogiannis, Spyros, Papastavrou, Georgia, et al. · arXiv (Cornell University) · 10
PDF
On mutual concavity and strategically-zero-sum bimatrix games
2012 · Spyros Kontogiannis, Paul Spirakis · Theoretical Computer Science · 10
PDF
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
2010 · Spyros Kontogiannis, Paul Spirakis · Lecture notes in computer science · 10
Robust Line Planning under Unknown Incentives and Elasticity of Frequencies
2008 · Kontogiannis, Spyros, Zaroliagis, Christos · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 10
PDF
On the support size of stable strategies in random games
2009 · Spyros C. Kontogiannis, Paul G. Spirakis · Theoretical Computer Science · 9
PDF
Equilibrium Points in Fear of Correlated Threats
2008 · Spyros C. Kontogiannis, Paul G. Spirakis · Lecture notes in computer science · 9
Counting Stable Strategies in Random Evolutionary Games
2005 · Spyros Kontogiannis, Paul Spirakis · Lecture notes in computer science · 9
Works count: 105
Citation count: 1,225
H-index: 15
I10-index: 22
Year
Topic
Type