Spyros C. Kontogiannis

Meletis Pogkas

Proceedings of the Algorithmic Aspects of Cloud Computing - 8th International Symposium, 2023

2022

An Axiomatic Approach to Time-Dependent Shortest Path Oracles.

[BibT_eX]

[DOI]

Algorithmica, 2022

REX: A Realistic Time-Dependent Model for Multimodal Public Transport.

[BibT_eX]

[DOI]

Paraskevi-Maria-Malevi Machaira

Proceedings of the 22nd Symposium on Algorithmic Approaches for Transportation Modelling, 2022

Cloud-Based Urban Mobility Services.

[BibT_eX]

[DOI]

Paraskevi-Maria-Malevi Machaira

Konstantinos Raftopoulos

Proceedings of the Algorithmic Aspects of Cloud Computing - 7th International Symposium, 2022

2021

Time-Dependent Alternative Route Planning: Theory and Practice.

[BibT_eX]

[DOI]

Algorithms, 2021

Incentivizing Truthfulness in Crowdsourced Parking Ecosystems.

[BibT_eX]

[DOI]

Anastasia-Maria Kampyli

Damianos Kypriadis

Proceedings of the IEEE International Smart Cities Conference, 2021

2020

Time-Dependent Alternative Route Planning.

[BibT_eX]

[DOI]

Proceedings of the 20th Symposium on Algorithmic Approaches for Transportation Modelling, 2020

2019

Exploiting Amorphous Data Parallelism to Speed-Up Massive Time-Dependent Shortest-Path Computations.

[BibT_eX]

[DOI]

Anastasios Papadopoulos

Charalampos Konstantopoulos

Proceedings of the 19th Symposium on Algorithmic Approaches for Transportation Modelling, 2019

2018

Renewable Mobility in Smart Cities: Cloud-Based Services.

[BibT_eX]

[DOI]

Damianos Gavalas

Kalliopi Giannakopoulou

Vlasios Kasapakis

Dionisis D. Kehagias

Damianos Kypriadis

Charalampos Konstantopoulos

Proceedings of the 2018 IEEE Symposium on Computers and Communications, 2018

2017

Multimodal route and tour planning in urban environments.

[BibT_eX]

[DOI]

Julian Dibbelt

Damianos Gavalas

Vlasios Kasapakis

Charalampos Konstantopoulos

Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

Eco-aware vehicle routing in urban environments.

[BibT_eX]

[DOI]

Kalliopi Giannakopoulou

Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

Improved Oracles for Time-Dependent Road Networks.

[BibT_eX]

[DOI]

Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

2016

Computing Pure Equilibria in the Game of Parallel Links.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Distance Oracles for Time-Dependent Networks.

[BibT_eX]

[DOI]

Algorithmica, 2016

Hierarchical Time-Dependent Oracles.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

A Cloud-Based Time-Dependent Routing Service.

[BibT_eX]

[DOI]

Kalliopi Giannakopoulou

Proceedings of the Algorithmic Aspects of Cloud Computing - Second International Workshop, 2016

Engineering Oracles for Time-Dependent Road Networks.

[BibT_eX]

[DOI]

George Michalopoulos

Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015

Hierarchical Oracles for Time-Dependent Networks.

[BibT_eX]

[DOI]

CoRR, 2015

A Glimpse at Paul G. Spirakis.

[BibT_eX]

[DOI]

Ioannis Chatzigiannakis

Othon Michail

Sotiris E. Nikoletseas

Proceedings of the Algorithms, Probability, Networks, and Games, 2015

Analysis and Experimental Evaluation of Time-Dependent Distance Oracles.

[BibT_eX]

[DOI]

George Michalopoulos

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2013

Preface to Special Issue on Algorithmic Game Theory.

[BibT_eX]

[DOI]

Elias Koutsoupias

Pavlos G. Spirakis

Theory Comput. Syst., 2013

2012

On mutual concavity and strategically-zero-sum bimatrix games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

2011

Approximability of Symmetric Bimatrix Games and Related Experiments.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Robust Line Planning in Case of Multiple Pools and Disruptions.

[BibT_eX]

[DOI]

Apostolos Bessas

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Frontmatter, Table of Contents, Preface, Workshop Organization.

[BibT_eX]

[DOI]

Alberto Caprara

Proceedings of the ATMOS 2011, 2011

2010

Well Supported Approximate Equilibria in Bimatrix Games.

[BibT_eX]

[DOI]

Algorithmica, 2010

Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2010

2009

Incentive-Compatible Robust Line Planning.

[BibT_eX]

[DOI]

Apostolos Bessas

Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Preface.

[BibT_eX]

[DOI]

Marios Mavronicolas

Theor. Comput. Sci., 2009

On the support size of stable strategies in random games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Polynomial algorithms for approximating Nash equilibria of bimatrix games.

[BibT_eX]

[DOI]

Panagiota N. Panagopoulou

Theor. Comput. Sci., 2009

The structure and complexity of Nash equilibria for a selfish routing game.

[BibT_eX]

[DOI]

Elias Koutsoupias

Marios Mavronicolas

Theor. Comput. Sci., 2009

Recent Advances in Approximability of Bimatrix Nash.

[BibT_eX]

Haralampos Tsaknakis

Bull. EATCS, 2009

2008

Approximations of Bimatrix Nash Equilibria.

[BibT_eX]

[DOI]

Panagiota N. Panagopoulou

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Computing Pure Equilibria in the Game of Parallel Links.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Atomic congestion games among coalitions.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Equilibrium Points in Fear of Correlated Threats.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Robust Line Planning under Unknown Incentives and Elasticity of Frequencies.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2008, 2008

2007

Atomic Selfish Routing in Networks.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Probabilistic Techniques in Algorithmic Game Theory.

[BibT_eX]

[DOI]

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007

Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2005

Selfish unsplittable flows.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Atomic Selfish Routing in Networks: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, First International Workshop, 2005

Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

The Contribution of Game Theory to Complex Systems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Informatics, 2005

Counting Stable Strategies in Random Evolutionary Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Evolutionary Games: An Algorithmic View.

[BibT_eX]

[DOI]

Proceedings of the Self-star Properties in Complex Information Systems, 2005

2002

Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

2000

Robust Parallel Computations through Randomization.

[BibT_eX]

[DOI]

Moti Yung

Theory Comput. Syst., 2000

1998

"Dynamic-Fault-Prone BSP": A Paradigm for Robust Computations in Changing Environments.

[BibT_eX]

[DOI]

Moti Yung

Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

1997

Efficient Computations on Fault-Prone BSP Machines.

[BibT_eX]

[DOI]