Spyros C. Kontogiannis

According to our database1, Spyros C. Kontogiannis authored at least 54 papers between 1997 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Renewable Mobility in Smart Cities: Cloud-Based Services.
Proceedings of the 2018 IEEE Symposium on Computers and Communications, 2018

2017
Improved Oracles for Time-Dependent Road Networks.
CoRR, 2017

Multimodal route and tour planning in urban environments.
Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

Eco-aware vehicle routing in urban environments.
Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

Improved Oracles for Time-Dependent Road Networks.
Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

2016
Computing Pure Equilibria in the Game of Parallel Links.
Encyclopedia of Algorithms, 2016

Distance Oracles for Time-Dependent Networks.
Algorithmica, 2016

Hierarchical Time-Dependent Oracles.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

A Cloud-Based Time-Dependent Routing Service.
Proceedings of the Algorithmic Aspects of Cloud Computing - Second International Workshop, 2016

Engineering Oracles for Time-Dependent Road Networks.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015
Hierarchical Oracles for Time-Dependent Networks.
CoRR, 2015

Engineering Oracles for Time-Dependent Road Networks.
CoRR, 2015

A Glimpse at Paul G. Spirakis.
Proceedings of the Algorithms, Probability, Networks, and Games, 2015

Analysis and Experimental Evaluation of Time-Dependent Distance Oracles.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
Distance Oracles for Time-Dependent Networks.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Preface to Special Issue on Algorithmic Game Theory.
Theory Comput. Syst., 2013

Distance Oracles for Time-Dependent Networks.
CoRR, 2013

2012
On mutual concavity and strategically-zero-sum bimatrix games.
Theor. Comput. Sci., 2012

2011
Robust Line Planning in case of Multiple Pools and Disruptions
CoRR, 2011

Approximability of Symmetric Bimatrix Games and Related Experiments.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Robust Line Planning in Case of Multiple Pools and Disruptions.
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Frontmatter, Table of Contents, Preface, Workshop Organization.
Proceedings of the ATMOS 2011, 2011

2010
Well Supported Approximate Equilibria in Bimatrix Games.
Algorithmica, 2010

Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses.
Proceedings of the Approximation, 2010

2009
Incentive-Compatible Robust Line Planning.
Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Preface.
Theor. Comput. Sci., 2009

On the support size of stable strategies in random games.
Theor. Comput. Sci., 2009

Polynomial algorithms for approximating Nash equilibria of bimatrix games.
Theor. Comput. Sci., 2009

The structure and complexity of Nash equilibria for a selfish routing game.
Theor. Comput. Sci., 2009

Recent Advances in Approximability of Bimatrix Nash.
Bulletin of the EATCS, 2009

2008
Approximations of Bimatrix Nash Equilibria.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Atomic congestion games among coalitions.
ACM Trans. Algorithms, 2008

Equilibrium Points in Fear of Correlated Threats.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Robust Line Planning under Unknown Incentives and Elasticity of Frequencies.
Proceedings of the ATMOS 2008, 2008

2007
Atomic Selfish Routing in Networks.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

On the Support Size of Stable Strategies in Random Games.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007

Probabilistic Techniques in Algorithmic Game Theory.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007

Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Atomic Congestion Games Among Coalitions.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Selfish unsplittable flows.
Theor. Comput. Sci., 2005

Atomic Selfish Routing in Networks: A Survey.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

The Contribution of Game Theory to Complex Systems.
Proceedings of the Advances in Informatics, 2005

Counting Stable Strategies in Random Evolutionary Games.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Evolutionary Games: An Algorithmic View.
Proceedings of the Self-star Properties in Complex Information Systems, 2005

2004
Selfish Unsplittable Flows.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2002
Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

The Structure and Complexity of Nash Equilibria for a Selfish Routing Game.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2000
Robust Parallel Computations through Randomization.
Theory Comput. Syst., 2000

1998
"Dynamic-Fault-Prone BSP": A Paradigm for Robust Computations in Changing Environments.
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

1997
Efficient Computations on Fault-Prone BSP Machines.
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997


  Loading...