default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSpyros C. Kontogiannis
Person information
- affiliation: University of Patras, Greece
- affiliation: University of Ioannina, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c39]Spyros C. Kontogiannis, Andreas Paraskevopoulos, Christos D. Zaroliagis:
Online Vehicle Routing with Pickups and Deliveries Under Time-Dependent Travel-Time Constraints. ATMOS 2024: 9:1-9:20- [e6]Paul C. Bouman
, Spyros C. Kontogiannis:
24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2024, September 5-6, 2024, Royal Holloway, London, United Kingdom. OASIcs 123, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-350-8 [contents] - [i7]Spyros C. Kontogiannis, Andreas Paraskevopoulos, Christos D. Zaroliagis:
Online Vehicle Routing with Pickups and Deliveries under Time-Dependent Travel-Time Constraints. CoRR abs/2408.06324 (2024) - 2023
- [c38]Spyros C. Kontogiannis, Andreas Paraskevopoulos, Meletis Pogkas, Christos D. Zaroliagis:
i-Deliver P&D Engine: A Decentralized Middleware for a Delivery-as-a-Service System. ALGOCLOUD 2023: 172-183 - [e5]Luca Foschini, Spyros C. Kontogiannis:
Algorithmic Aspects of Cloud Computing - 7th International Symposium, ALGOCLOUD 2022, Potsdam, Germany, September 6, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13799, Springer 2023, ISBN 978-3-031-33436-8 [contents] - 2022
- [j14]Spyros C. Kontogiannis, Dorothea Wagner, Christos D. Zaroliagis:
An Axiomatic Approach to Time-Dependent Shortest Path Oracles. Algorithmica 84(3): 815-870 (2022) - [c37]Spyros C. Kontogiannis, Paraskevi-Maria-Malevi Machaira, Andreas Paraskevopoulos, Konstantinos Raftopoulos, Christos D. Zaroliagis:
Cloud-Based Urban Mobility Services. ALGOCLOUD 2022: 1-20 - [c36]Spyros C. Kontogiannis, Paraskevi-Maria-Malevi Machaira, Andreas Paraskevopoulos, Christos D. Zaroliagis:
REX: A Realistic Time-Dependent Model for Multimodal Public Transport. ATMOS 2022: 12:1-12:16 - 2021
- [j13]Spyros C. Kontogiannis, Andreas Paraskevopoulos, Christos D. Zaroliagis:
Time-Dependent Alternative Route Planning: Theory and Practice. Algorithms 14(8): 220 (2021) - [c35]Anastasia-Maria Kampyli, Spyros C. Kontogiannis, Damianos Kypriadis, Christos D. Zaroliagis:
Incentivizing Truthfulness in Crowdsourced Parking Ecosystems. ISC2 2021: 1-7 - 2020
- [c34]Spyros C. Kontogiannis, Andreas Paraskevopoulos, Christos D. Zaroliagis:
Time-Dependent Alternative Route Planning. ATMOS 2020: 8:1-8:14
2010 – 2019
- 2019
- [c33]Spyros C. Kontogiannis, Anastasios Papadopoulos, Andreas Paraskevopoulos, Christos D. Zaroliagis:
Exploiting Amorphous Data Parallelism to Speed-Up Massive Time-Dependent Shortest-Path Computations. ATMOS 2019: 9:1-9:18 - 2018
- [c32]Damianos Gavalas, Kalliopi Giannakopoulou, Vlasios Kasapakis, Dionisis D. Kehagias, Charalampos Konstantopoulos, Spyros C. Kontogiannis, Damianos Kypriadis, Grammati E. Pantziou, Andreas Paraskevopoulos, Christos D. Zaroliagis:
Renewable Mobility in Smart Cities: Cloud-Based Services. ISCC 2018: 1280-1285 - 2017
- [c31]Spyros C. Kontogiannis, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis:
Improved Oracles for Time-Dependent Road Networks. ATMOS 2017: 4:1-4:17 - [c30]Julian Dibbelt, Dionisis D. Kehagias, Grammati E. Pantziou, Damianos Gavalas, Charalampos Konstantopoulos, Dorothea Wagner, Kalliopi Giannakopoulou, Spyros C. Kontogiannis, Christos D. Zaroliagis:
Eco-aware vehicle routing in urban environments. ISCC 2017: 208-213 - [c29]Julian Dibbelt, Charalampos Konstantopoulos, Dorothea Wagner, Damianos Gavalas, Spyros C. Kontogiannis, Christos D. Zaroliagis, Vlasios Kasapakis, Grammati E. Pantziou:
Multimodal route and tour planning in urban environments. ISCC 2017: 214-219 - [i6]Spyros C. Kontogiannis, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis:
Improved Oracles for Time-Dependent Road Networks. CoRR abs/1704.08445 (2017) - 2016
- [j12]Spyros C. Kontogiannis, Christos D. Zaroliagis:
Distance Oracles for Time-Dependent Networks. Algorithmica 74(4): 1404-1434 (2016) - [c28]Spyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis:
Engineering Oracles for Time-Dependent Road Networks. ALENEX 2016: 1-14 - [c27]Kalliopi Giannakopoulou, Spyros C. Kontogiannis, Georgia Papastavrou, Christos D. Zaroliagis:
A Cloud-Based Time-Dependent Routing Service. ALGOCLOUD 2016: 41-64 - [c26]Spyros C. Kontogiannis, Dorothea Wagner, Christos D. Zaroliagis:
Hierarchical Time-Dependent Oracles. ISAAC 2016: 47:1-47:13 - [r4]Spyros C. Kontogiannis:
Computing Pure Equilibria in the Game of Parallel Links. Encyclopedia of Algorithms 2016: 415-421 - 2015
- [c25]Spyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis:
Analysis and Experimental Evaluation of Time-Dependent Distance Oracles. ALENEX 2015: 147-158 - [c24]Ioannis Chatzigiannakis, Dimitris Fotakis, Spyros C. Kontogiannis, Othon Michail, Sotiris E. Nikoletseas, Grammati E. Pantziou, Christos D. Zaroliagis:
A Glimpse at Paul G. Spirakis. Algorithms, Probability, Networks, and Games 2015: 3-24 - [e4]Christos D. Zaroliagis, Grammati E. Pantziou, Spyros C. Kontogiannis:
Algorithms, Probability, Networks, and Games - Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 9295, Springer 2015, ISBN 978-3-319-24023-7 [contents] - [i5]Spyros C. Kontogiannis, Dorothea Wagner, Christos D. Zaroliagis:
Hierarchical Oracles for Time-Dependent Networks. CoRR abs/1502.05222 (2015) - [i4]Spyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis:
Engineering Oracles for Time-Dependent Road Networks. CoRR abs/1511.08303 (2015) - 2014
- [c23]Spyros C. Kontogiannis, Christos D. Zaroliagis:
Distance Oracles for Time-Dependent Networks. ICALP (1) 2014: 713-725 - 2013
- [j11]Spyros C. Kontogiannis, Elias Koutsoupias, Pavlos G. Spirakis:
Preface to Special Issue on Algorithmic Game Theory. Theory Comput. Syst. 53(1): 1-2 (2013) - [i3]Spyros C. Kontogiannis, Christos D. Zaroliagis:
Distance Oracles for Time-Dependent Networks. CoRR abs/1309.4973 (2013) - 2012
- [j10]Spyros C. Kontogiannis, Paul G. Spirakis:
On mutual concavity and strategically-zero-sum bimatrix games. Theor. Comput. Sci. 432: 64-76 (2012) - 2011
- [c22]Alberto Caprara, Spyros C. Kontogiannis:
Frontmatter, Table of Contents, Preface, Workshop Organization. ATMOS 2011 - [c21]Apostolos Bessas, Spyros C. Kontogiannis, Christos D. Zaroliagis:
Robust Line Planning in Case of Multiple Pools and Disruptions. TAPAS 2011: 33-44 - [c20]Spyros C. Kontogiannis, Paul G. Spirakis:
Approximability of Symmetric Bimatrix Games and Related Experiments. SEA 2011: 1-20 - [e3]Alberto Caprara, Spyros C. Kontogiannis:
ATMOS 2011 - 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, Saarbrücken, Germany, September 8, 2011. OASIcs 20, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2011, ISBN 978-3-939897-33-0 [contents] - [i2]Apostolos Bessas, Spyros C. Kontogiannis, Christos D. Zaroliagis:
Robust Line Planning in case of Multiple Pools and Disruptions. CoRR abs/1101.2770 (2011) - 2010
- [j9]Spyros C. Kontogiannis, Paul G. Spirakis:
Well Supported Approximate Equilibria in Bimatrix Games. Algorithmica 57(4): 653-667 (2010) - [c19]Spyros C. Kontogiannis, Paul G. Spirakis:
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses. APPROX-RANDOM 2010: 312-325 - [e2]Spyros C. Kontogiannis, Elias Koutsoupias, Paul G. Spirakis:
Algorithmic Game Theory - Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010. Proceedings. Lecture Notes in Computer Science 6386, Springer 2010, ISBN 978-3-642-16169-8 [contents]
2000 – 2009
- 2009
- [j8]Spyros C. Kontogiannis, Paul G. Spirakis, Haralampos Tsaknakis:
Recent Advances in Approximability of Bimatrix Nash. Bull. EATCS 98: 60-77 (2009) - [j7]Spyros C. Kontogiannis, Paul G. Spirakis:
On the support size of stable strategies in random games. Theor. Comput. Sci. 410(8-10): 933-942 (2009) - [j6]Paul G. Spirakis, Marios Mavronicolas, Spyros C. Kontogiannis:
Preface. Theor. Comput. Sci. 410(17): 1551 (2009) - [j5]Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis:
Polynomial algorithms for approximating Nash equilibria of bimatrix games. Theor. Comput. Sci. 410(17): 1599-1606 (2009) - [j4]Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis:
The structure and complexity of Nash equilibria for a selfish routing game. Theor. Comput. Sci. 410(36): 3305-3326 (2009) - [p1]Apostolos Bessas, Spyros C. Kontogiannis, Christos D. Zaroliagis:
Incentive-Compatible Robust Line Planning. Robust and Online Large-Scale Optimization 2009: 85-118 - 2008
- [j3]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
Atomic congestion games among coalitions. ACM Trans. Algorithms 4(4): 52:1-52:27 (2008) - [c18]Spyros C. Kontogiannis, Christos D. Zaroliagis:
Robust Line Planning under Unknown Incentives and Elasticity of Frequencies. ATMOS 2008 - [c17]Spyros C. Kontogiannis, Paul G. Spirakis:
Equilibrium Points in Fear of Correlated Threats. WINE 2008: 210-221 - [r3]Spyros C. Kontogiannis:
Computing Pure Equilibria in the Game of Parallel Links. Encyclopedia of Algorithms 2008 - [r2]Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis:
Approximations of Bimatrix Nash Equilibria. Encyclopedia of Algorithms 2008 - 2007
- [c16]Spyros C. Kontogiannis, Paul G. Spirakis:
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games. ICALP 2007: 595-606 - [c15]Spyros C. Kontogiannis, Paul G. Spirakis:
Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach. MFCS 2007: 596-608 - [c14]Spyros C. Kontogiannis, Paul G. Spirakis:
Probabilistic Techniques in Algorithmic Game Theory. SAGA 2007: 30-53 - [c13]Spyros C. Kontogiannis, Paul G. Spirakis:
On the Support Size of Stable Strategies in Random Games. SAGA 2007: 154-165 - [r1]Spyros C. Kontogiannis, Paul G. Spirakis:
Atomic Selfish Routing in Networks. Handbook of Parallel Computing 2007 - 2006
- [c12]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
Atomic Congestion Games Among Coalitions. ICALP (1) 2006: 572-583 - [c11]Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis:
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. WINE 2006: 286-296 - [e1]Paul G. Spirakis, Marios Mavronicolas, Spyros C. Kontogiannis:
Internet and Network Economics, Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings. Lecture Notes in Computer Science 4286, Springer 2006, ISBN 3-540-68138-8 [contents] - [i1]Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis:
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j2]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
Selfish unsplittable flows. Theor. Comput. Sci. 348(2-3): 226-239 (2005) - [c10]Spyros C. Kontogiannis, Paul G. Spirakis:
Evolutionary Games: An Algorithmic View. Self-star Properties in Complex Information Systems 2005: 97-111 - [c9]Spyros C. Kontogiannis, Paul G. Spirakis:
Counting Stable Strategies in Random Evolutionary Games. ISAAC 2005: 839-848 - [c8]Spyros C. Kontogiannis, Paul G. Spirakis:
The Contribution of Game Theory to Complex Systems. Panhellenic Conference on Informatics 2005: 101-111 - [c7]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. WAOA 2005: 161-175 - [c6]Spyros C. Kontogiannis, Paul G. Spirakis:
Atomic Selfish Routing in Networks: A Survey. WINE 2005: 989-1002 - 2004
- [c5]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
Selfish Unsplittable Flows. ICALP 2004: 593-605 - 2002
- [c4]Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis:
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. ICALP 2002: 123-134 - [c3]Spyros C. Kontogiannis:
Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines. STOC 2002: 124-133 - 2000
- [j1]Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung:
Robust Parallel Computations through Randomization. Theory Comput. Syst. 33(5/6): 427-464 (2000)
1990 – 1999
- 1998
- [c2]Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung:
"Dynamic-Fault-Prone BSP": A Paradigm for Robust Computations in Changing Environments. SPAA 1998: 37-46 - 1997
- [c1]Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis:
Efficient Computations on Fault-Prone BSP Machines. SPAA 1997: 84-93
Coauthor Index
aka: Pavlos G. Spirakis
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-08 21:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
