Spyros Kontogiannis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Spyros Kontogiannis has a total of 45 co-authors. Here are the top co-authors by number of shared publications:
- Christos Zaroliagis
University of Patras
22 shared publications Paul Spirakis
Patras Univ. Campus
13 shared publications- Dimitris Fotakis
National Technical University of Athens Greece
8 shared publications Andreas Paraskevopoulos
Computer Technology Institute
4 shared publications- Andreas Paraskevopoulos
Computer Technology Institute and Press “Diophantus” (CTI)
4 shared publications - Charalampos Konstantopoulos
Department of Informatics, University of Piraeus, Piraeus, Greece
4 shared publications
Latest Publications
- 14 July 2026
- Published by Springer Nature
- p. 116-130
AI-Powered Wildfire Detection
- 2 January 2026
- Published by Springer Nature
- p. 73-93
Task Orchestration in the Cloud Continuum via Multi-objective Evolutionary Algorithms
- 2 January 2026
- Published by Springer Nature
- p. 73-93
Task Orchestration in the Cloud Continuum via Multi-objective Evolutionary Algorithms
- 23 June 2025
- Published by Springer Nature
- p. 209-222
Optimizing Task Orchestration Across the Cloud Continuum
- 23 June 2025
- Published by Springer Nature
- p. 209-222
Optimizing Task Orchestration Across the Cloud Continuum
- 14 December 2023
- Published by Springer Nature
- p. 172-183
i-Deliver P&D Engine: A Decentralized Middleware for a Delivery-as-a-Service System
- 14 December 2023
- Published by Springer Nature
- p. 172-183
i-Deliver P&D Engine: A Decentralized Middleware for a Delivery-as-a-Service System
- 26 May 2023
- Published by Springer Nature
- p. 1-20
Cloud-Based Urban Mobility Services
- 11 March 2023
- Published by Springer Nature
- p. 311-322
A Recommendation Engine for a Smart Parking Ecosystem
- 11 March 2023
- Published by Springer Nature
- p. 311-322
A Recommendation Engine for a Smart Parking Ecosystem
- 24 January 2022
- Published by Springer Nature in Algorithmica
- Vol. 84 (3) , 815-870
An Axiomatic Approach to Time-Dependent Shortest Path Oracles
- 24 January 2022
- Published by Springer Nature in Algorithmica
- Vol. 84 (3) , 815-870
An Axiomatic Approach to Time-Dependent Shortest Path Oracles
- 7 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Incentivizing Truthfulness in Crowdsourced Parking Ecosystems
Limited parking space in urban environments has a severe social and environmental impact, because of time loss and unnecessary pollution while looking for free parking spaces. In a recent effort, we have developed the SocialPARK ecosystem to tackle this problem through the activation of a community of interacting citizens, parking companies and municipalities. SocialPARK offers an integrated platform for the provision of personalized parking functionalities as a service, auditing parking availability information through a crowdsourcing approach that gathers relevant information provided by users, parking vendors and municipalities. In this context, a central challenge in delivering trustworthy parking services is to ensure a truthful behavior of the involved (possibly unreliable) users. Towards this direction, we present two rewarding schemes that provably incentivize users to behave truthfully. Both schemes are based on virtual credits (points) that users earn for providing parking availability information. Apart from incentivizing truthful behavior, our schemes cater for point circulation, do not allow point overaccumulation, and prevent malicious users to aggregate points by misreporting.
- 7 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Incentivizing Truthfulness in Crowdsourced Parking Ecosystems
Limited parking space in urban environments has a severe social and environmental impact, because of time loss and unnecessary pollution while looking for free parking spaces. In a recent effort, we have developed the SocialPARK ecosystem to tackle this problem through the activation of a community of interacting citizens, parking companies and municipalities. SocialPARK offers an integrated platform for the provision of personalized parking functionalities as a service, auditing parking availability information through a crowdsourcing approach that gathers relevant information provided by users, parking vendors and municipalities. In this context, a central challenge in delivering trustworthy parking services is to ensure a truthful behavior of the involved (possibly unreliable) users. Towards this direction, we present two rewarding schemes that provably incentivize users to behave truthfully. Both schemes are based on virtual credits (points) that users earn for providing parking availability information. Apart from incentivizing truthful behavior, our schemes cater for point circulation, do not allow point overaccumulation, and prevent malicious users to aggregate points by misreporting.
- Open Access
- 21 July 2021
- Published by MDPI AG in Algorithms
- Vol. 14 (8) , 220
Time-Dependent Alternative Route Planning: Theory and Practice
We consider the problem of computing a set of meaningful alternative origin-to-destination routes, in real-world road network instances whose arcs are accompanied by travel-time functions rather than fixed costs. In this time-dependent alternative route scenario, we present a novel query algorithm, called Time-Dependent Alternative Graph (TDAG), that exploits the outcome of a time-consuming preprocessing phase to create a manageable amount of travel-time metadata, in order to provide answers for arbitrary alternative-routes queries, in only a few milliseconds for continental-size instances. The resulting set of alternative routes is aggregated in the form of a time-dependent alternative graph, which is characterized by the minimum route overlap, small stretch factor, small size, and low complexity. To our knowledge, this is the first work that deals with the time-dependent setting in the framework of alternative routes. The preprocessed metadata prescribe the minimum travel-time informations between a small set of “landmark” nodes and all other nodes in the graph. The TDAG query algorithm carries out the work in two distinct phases: initially, a collection phase constructs candidate alternative routes; consequently, a pruning phase cautiously discards uninteresting or low-quality routes from the candidate set. Our experimental evaluation on real-world, time-dependent road networks demonstrates that TDAG performed much better (by one or two orders of magnitude) than the existing baseline approaches.
- 21 July 2021
- Published by MDPI AG in Algorithms
- Vol. 14 (8) , 220
Open AccessTime-Dependent Alternative Route Planning: Theory and Practice
We consider the problem of computing a set of meaningful alternative origin-to-destination routes, in real-world road network instances whose arcs are accompanied by travel-time functions rather than fixed costs. In this time-dependent alternative route scenario, we present a novel query algorithm, called Time-Dependent Alternative Graph (TDAG), that exploits the outcome of a time-consuming preprocessing phase to create a manageable amount of travel-time metadata, in order to provide answers for arbitrary alternative-routes queries, in only a few milliseconds for continental-size instances. The resulting set of alternative routes is aggregated in the form of a time-dependent alternative graph, which is characterized by the minimum route overlap, small stretch factor, small size, and low complexity. To our knowledge, this is the first work that deals with the time-dependent setting in the framework of alternative routes. The preprocessed metadata prescribe the minimum travel-time informations between a small set of “landmark” nodes and all other nodes in the graph. The TDAG query algorithm carries out the work in two distinct phases: initially, a collection phase constructs candidate alternative routes; consequently, a pruning phase cautiously discards uninteresting or low-quality routes from the candidate set. Our experimental evaluation on real-world, time-dependent road networks demonstrates that TDAG performed much better (by one or two orders of magnitude) than the existing baseline approaches.
- 24 April 2020
- Published by Springer Nature in EAI/Springer Innovations in Communication and Computing
- p. 135-157
Renewable Mobility in Smart Cities:TheMOVESMART Approach
- 24 April 2020
- Published by Springer Nature in EAI/Springer Innovations in Communication and Computing
- p. 135-157
Renewable Mobility in Smart Cities:TheMOVESMART Approach