Spyros Kontogiannis

• INTERREG / INVESTMENT
• EDK / i-Deliver
• EDK / SocialPARK
• EDK / TouristHub

Read more...

• G. Christainas, A. Kampyli, D. Kehagias, M. Kyrkou, S. Kontogiannis, P. Machaira, A. Paraskevopoulos, A. Salamanis, P. Spanidis, and C. Zaroliagis:
  SocialPARK – An integrated Parking-as-a-Service Ecosystem.
  14th its European Congress (2022).
• S. Kontogiannis, N. Zacharatos, C. Zaroliagis:
  A Recommendation Engine for a Smart Parking Ecosystem.
  6th Conference on Sustainable Urban Mobility (csum), Springer (2022).
• A.M. Kampyli, S. Kontogiannis, D. Kypriadis, C. Zaroliagis:
  Incentivizing Truthfulness in Crowdsourced Parking Ecosystems.
  IEEE International Smart Cities Conference (isc2), pp. 1–7, https://doi.org/10.1109/ISC253183.2021.9562950 (2021).
• D. Gavalas, K. Giannakopoulou, V. Kasapakis, D. Kehagias, C. Konstantopoulos, S. Kontogiannis, D. Kypriadis, G. Pantziou, A. Paraskevopoulos, C. Zaroliagis:
  Renewable Mobility in Smart Cities – The MOVESMART Approach.
  Smart Technologies for Smart Cities, EAI/Springer Innovations in Communication and Computing, pp. 135–157, https://doi.org/10.1007/978-3-030-39986-3_7 (2020).
• S. Kontogiannis, A. Paraskevopoulos, C. Zaroliagis:
  Time-Dependent Alternative Route Planning.
  Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (atmos). OASIcs Series 85(8):1–14, https://doi.org/10.4230/OASIcs.ATMOS.2020.8 (2020).
• S. Kontogiannis, A. Papadopoulos, A. Paraskevopoulos, C. Zaroliagis:
  Exploiting Amorphous Data Parallelism to Speed-Up Massive Time-Dependent Shortest-Path Computations.
  Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (atmos). OASIcs Series 75(9):1–18, https://doi.org/10.4230/OASIcs.ATMOS.2019.9 (2019).
• D. Gavalas, K. Giannakopoulou, V. Kasapakis, D. Kehagias, C. Konstantopoulos, S. Kontogiannis, D. Kypriadis, G. Pantziou, A. Paraskevopoulos, C. Zaroliagis:
  Renewable Mobility in Smart Cities: Cloud-Based Services.
  Symposium on Computers and Communications (iscc). IEEE, pp. 1280–1285, https://doi.org/10.1109/ISCC.2018.8538479 (2018).
• S. Kontogiannis, G. Papastavrou, A. Paraskevopoulos, D. Wagner, C. Zaroliagis:
  Improved Oracles for Time-Dependent Road Networks.
  Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (atmos). Dagstuhl, OASICS 59(4), 1–17, https://doi.org/10.4230/OASIcs.ATMOS.2017.4 (2017).
• J. Dibbelt, D. Kehagias, G. Pantziou, D. Gavalas, C. Konstantopoulos, D. Wagner, K. Giannakopoulou, S. Kontogiannis, C. Zaroliagis:
  Eco-aware Vehicle Routing in Urban Environments.
  Symposium on Computers and Communications (iscc). IEEE, pp. 208–213, https://doi.org/10.1109/ISCC.2017.8024531 (2017).
• J. Dibbelt, C. Konstantopoulos, D. Wagner, D. Gavalas, S. Kontogiannis, C. Zaroliagis, V. Kasapakis, G. Pantziou:
  Multimodal Route and Tour Planning in Urban Environments.
  International Symposium on Computers and Communications (iscc). IEEE, pp. 214–219, https://doi.org/10.1109/ISCC.2017.8024532 (2017).
• S. Kontogiannis, D. Wagner, C. Zaroliagis:
  Hierarchical time-dependent oracles.
  Algorithms and Computation (isaac). LIPIcs Series, 47:1–13, https://doi.org/10.4230/LIPIcs.ISAAC.2016.47 (2016).
• S. Kontogiannis, G. Michalopoulos, G. Papastavrou, A. Paraskevopoulos, D. Wagner, C. Zaroliagis:
  Engineering oracles for time-dependent road networks.
  Algorithm Engineering and Experiments (alenex). SIAM, pp. 1–14, https://doi.org/10.1137/1.9781611974317.1 (2016).
• K. Giannakopoulou, S. Kontogiannis, G. Papastavrou, and C. Zaroliagis:
  A Cloud-based Time-Dependent Routing Service.
  Algorithmic Aspects of Cloud Computing (algocloud). Springer, LNCS 10230:41–64, https://doi.org/10.1007/978-3-319-57045-7_4 (2017).
• S. Kontogiannis, G. Michalopoulos, G. Papastavrou, A. Paraskevopoulos, D. Wagner, C. Zaroliagis:
  Analysis and experimental evaluation of time-dependent distance oracles.
  Algorithm Engineering and Experiments (alenex). SIAM, pp. 147–158, https://doi.org/10.1137/1.9781611973754.13 (2015).
• S. Kontogiannis, C. Zaroliagis:
  Distance oracles for time dependent networks.
  Automata, Languages, and Programming (icalp – track a). Springer, LNCS 8572:713–725, S. Kontogiannis, P. Spirakis:
  Approximability of bimatrix games and related experiments.
  Symposium on Experimental Algorithms (sea). Springer, LNCS 6630:1–20, https://doi.org/10.1007/978-3-642-20662-7_1 (2011).
• A. Bessas, S. Kontogiannis, C. Zaroliagis:
  Robust line planning in case of multiple pools and disruptions.
  Theory and Practice of Algorithms in Computer Systems (tapas). Springer, LNCS 6595:33–44, https://doi.org/10.1007/978-3-642-19754-3_6 (2011).
• I. Chatzigiannakis, U. Colesanti, S. Kontogiannis, G. Leshem, A. Marchetti-Spaccamela, J. Mehler, G. Persiano, P. Spirakis, A. Vitaletti:
  MURPESS – Multi radio pedestrian energy scavenging sensor network.
  e-Challenges Conference (2010). IEEE, pp. 1–8, https://ieeexplore.ieee.org/document/5756588 (2010).
• S. Kontogiannis, P. Spirakis:
  Exploiting concavity in bimatrix games – New polynomially tractable classes.
  Approximation Algorithms for Combinatorial Optimization Problems (approx). Springer, LNCS 6302:312–325, https://dl.acm.org/doi/10.5555/1886521.1886546 (2010).
• S. Kontogiannis, P. Spirakis:
  Equilibrium points in fear of correlated threats.
  Internet & Network Economics (wine). Springer, LNCS 5385:210–221, https://doi.org/10.1007/978-3-540-92185-1_28 (2008).
• S. Kontogiannis, P. Spirakis:
  Foundations of economics and web science.
  Pan-Hellenic Conference on Informatics (pci). Invited paper, 10 pages (2008).
• S. Kontogiannis, C. Zaroliagis:
  Robust line planning under unknown incentives and elasticity of frequencies.
  Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (atmos), 16 pages, https://doi.org/10.1007/978-3-642-05465-5_4 (2008).
• S. Kontogiannis, P. Spirakis:
  Probabilistic techniques in algorithmic game theory.
  Stochastic Algorithms, Foundations, and Applications (saga). Springer, LNCS 4665:30–53, https://doi.org/10.1007/978-3-540-74871-7_4 (2007).
• S. Kontogiannis, P. Spirakis:
  On the Support size of stable strategies in random games.
  Stochastic Algorithms, Foundations, and Applications (saga). Springer, LNCS 4665:154–165, https://doi.org/10.1007/978-3-540-74871-7_14 (2007).
• S. Kontogiannis, P. Spirakis:
  Well supported approximate equilibria in bimatrix games – A graph theoretic approach.
  Mathematical Foundations of Computer Science (mfcs). Springer, LNCS 4708:596–608, https://doi.org/10.1007/978-3-540-74456-6_53 (2007).
• S. Kontogiannis, P. Spirakis:
  Efficient algorithms for constant well supported approximate equilibria in bimatrix games.
  Automata, Languages and Programming (icalp–track a). Springer, LNCS 4596:595-606, https://doi.org/10.1007/978-3-540-73420-8_52 (2007).
• S. Kontogiannis, P. Panagopoulou, P. Spirakis:
  Polynomial Algorithms for approximating Nash equilibria of bimatrix games.
  Internet & Network Economics (wine). Springer, LNCS 4286:286–296, https://doi.org/10.1007/11944874_26 (2006).
• D. Fotakis, S. Kontogiannis, P. Spirakis:
  Atomic congestion games among coalitions.
  Automata, Languages and Programming (icalp–track a). Springer, LNCS 4051:572–583, https://doi.org/10.1007/11786986_50 (2006).
• D. Fotakis, S. Kontogiannis, P. Panagopoulou, C. Raptopoulos, P. Spirakis:
  Algorithmic issues in coalitional and dynamic network games. Heinz Nixdorf Symposium on New Trends in Parallel & Distributed Computing, pp. 25–42 (2006).
• S. Kontogiannis, P. Spirakis:
  Counting stable strategies in random evolutionary games.
  Algorithms and Computation (isaac). Springer, LNCS 3827:839–848, https://doi.org/10.1007/11602613_84 (2005).
• S. Kontogiannis, P. Spirakis:
  Atomic selfish routing in networks – A survey.
  Internet & Network Economics (wine). Springer, LNCS 3828:989–1002, https://doi.org/10.1007/11600930_100 (2005).
• S. Kontogiannis, P. Spirakis:
  The Contribution of game theory to complex systems.
  Panhellenic Conference of Informatics (pci). Springer, LNCS 3746:101–111 (2005).
• D. Fotakis, S. Kontogiannis, P. Spirakis:
  Symmetry in network congestion games – Pure equilibria and anarchy cost.
  Approximation and Online Algorithms (waoa). Springer, LNCS 3879:161–175, https://doi.org/10.1007/11671411_13 (2005).
• S. Kontogiannis, P. Spirakis:
  Evolutionary games – An algorithmic view.
  Self-Star Properties in Complex Information Systems. Springer, LNCS 3460:97–111, https://doi.org/10.1007/11428589_7 (2004).
• D. Fotakis, S. Kontogiannis, P. Spirakis:
  Selfish unsplittable flows. Automata, Languages and Programming (icalp–track a). Springer, LNCS 3142:593–605, https://doi.org/10.1007/978-3-540-27836-8_51 (2004).
• D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, P. Spirakis:
  The structure and complexity of Nash equilibria for a selfish routing game.
  Automata, Languages and Programming (icalp–track a). Springer, LNCS 2380:123–134, https://doi.org/10.1007/3-540-45465-9_12 (2002).
• S. Kontogiannis:
  Lower Bounds & Competitive Algorithms for online scheduling of unit-size tasks to related machines.
  Symposium on Theory of Computing (stoc), pp. 124–133, https://doi.org/10.1145/509907.509929 (2002).
• C. Bouras, A. Gkamas, V. Kapoulas, S. Kontogiannis, T. Tsiatsos:
  Network based information system to support ODL activities. Telecommunications for Education and Training (tet), pp. 117–125 (1999).
• S. Kontogiannis, G. Pantziou, P. Spirakis and M. Yung:
  Dynamic fault prone BSP – A paradigm for robust computations in changing environments.
  Parallel Algorithms and Architectures (spaa), pp. 37–46, https://doi.org/10.1145/277651.277666 (1998).
• S. Kontogiannis, G. Pantziou, P. Spirakis:
  Efficient computations on fault-prone BSP machines.
  Parallel Algorithms and Architectures (spaa), pp. 84–93, https://doi.org/10.1145/258492.258501 (1997).
• K. Antonis, C. Bouras, J. Garofalakis, N. Kastis, S. Kontogiannis, P. Lampsas, P. Spirakis, G. Tsakarissianos:
  Conclusions on the analysis of user requirements concerning the use of ICT in the didactic process.
  Educational Multimedia and Hypermedia (ed-media/ed-telecom), pp. 13–18 (1997).
• C. Bouras, D. Fotakis, A. Katanou, A. Konidaris, S. Kontogiannis, A. Sevasti, E. Stephanou:
  Major principles on the design of an educational network.
  Open Classroom, pp. 359–366 (1997).
• C. Bouras, D. Fotakis, V. Kapoulas, S. Kontogiannis, K. Kyriakou, P. Lampsas, P. Spirakis, and A. Tatakis:
  An interactive cooperative teleworking environment - Τηλεμαθεια.
  Educational Multimedia and Hypermedia (ed-media), pp. 37–42 (1996).
• C. Bouras, D. Fotakis, V. Kapoulas, S. Kontogiannis, P. Lampsas, P. Spirakis, and A. Tatakis:
  Multilingual implementations of OSI applications.
  Computer and Information Sciences (iscis), pp. 367–374 (1995).
• E. Kapoulas, S. Kontogiannis, C. Bouras, P. Spirakis, D. Fotakis:
  Hellenization of X.500 Recommendation.
  Panhellenic Conference of Informatics, Vol.1, pp. 513–521 (1995).

Read more...