Dr. Theodoros Chondrogiannis

Post-doctoral Researcher

Theodoros studied computer science in his home country of Greece. He obtained his 4-year BSc degree in Computer Science and Technology with a focus on Software Systems from the Department of Computer Science and Technology of the University of Peloponnese in 2009, and his MSc degree in Advanced Information Systems from Department of Informatics and Telecommunications of the National Kapodistrian University of Athens in 2013. 

In 2013, Theodoros was awarded a PhD fellowship from the Free University of Bozen-Bolzano and he started his PhD at the  Faculty of Computer Science. In 2017, he completed successfully his PhD studies and received a doctorate for his thesis entitled Efficient Algorithms for Route Planning Problems on Road Networks. After his doctorate, he continued working as a postdoctolar researcher at the Faculty of Computer Science until December 2017, when he joined the University of Konstanz.  

Theodoros joined the Database and Information Systems group of the University of Konstanz on December 2017.

Areas of Interest

  • Indexing for path queries on graph databases 
  • Graph analytics
  • Graph query optimization
  • Multi-modal transportation network analysis
  • Trajectory data analysis

Selected Publications

  1. Manuel Hotz, Theodoros Chondrogiannis, Leonard Wörteler, Michael Grossniklaus: Experiences with Implementing Landmark Embedding in Neo4j. GRADES/NDA@SIGMOD/PODS 2019: 7:1-7:9 paper
  2. Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, Ulf Leser: Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap. EDBT 2017: 414-425 paper source poster
  3. Dimitris Sacharidis, Panagiotis Bouros, Theodoros Chondrogiannis: Finding The Most Preferred Path. SIGSPATIAL/GIS 2017: 5:1-5:10 paper
  4. Theodoros Chondrogiannis, Johann Gamper: ParDiSP: A Partition-Based Framework for Distance and Shortest Path Queries on Road Networks. MDM 2016: 242-251 paper source
  5. Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, Ulf Leser: Alternative routing: k-shortest paths with limited overlap. SIGSPATIAL/GIS 2015: 68:1-68:4 paper source poster



  • Co-chair of the 5th ACM SIGSPATIAL Student Research Competition, 2020 
  • Co-chair of the 4th ACM SIGSPATIAL Student Research Competition, 2019 
  • Web-chair of the 16th International Symposium on Spatial and Temporal Databases (SSTD'19), 2019 
  • Web-chair of the 30th International Conference on Scientific and Statistical Database Management (SSDBM'18), 2018 

Programme Committees

  • 25th International Conference on Database Systems for Advanced Applications (DASFAA'20), 2020 
  • 3rd ACM SIGSPATIAL Workshop on Recommendations for Location-based Services and Social Networks (LocalRec'19), 2019 
  • 20th International Conference on Web Information Systems Engineering (WISE'19), 2019 
  • 11th International Conference on Advanced Geographic Information Systems, Applications, and Services (GEOProcessing'19), 2019 
  • 3rd ACM SIGSPATIAL Student Research Competition (2018) 
  • 2nd ACM SIGSPATIAL Workshop on Recommendations for Location-based Services and Social Networks (LocalRec'18), 2018 
  • 1st Workkshop on Data Engineering meets Intelligent Food and COoking Recipe (DECOR'18), 2018 
  • 1st ACM SIGSPATIAL Workshop on Recommendations for Location-based Services and Social Networks (LocalRec'17), 2017​ 
  • ADBIS Workshop on Novel Techniques for Integrating Big Data (BigNovelTI'17)​​