Institute of Theoretical Informatics, Algorithmics I

Dr. Tamara Mchedlidze

Karlsruhe Institute of Technology (KIT)
Institute of Theoretical Informatics
Am Fasanengarten 5
76131 Karlsruhe Germany

phone +49 721 608-44245
fax +49 721 608-44211
email tamara [dot] mtsentlintze [at] kit [dot] edu
office room 307, Computer Science building 50.34
office hours by appointment

Research Interests

  • Graph Drawing
  • Algorithmic Graph Theory
  • Computational Geometry
  • Information Visualisation
  • Visual Perception and Cognition
  • Digital Humanities


  • October, 2020: Starting from October I work as an Assistant Professor at Utrecht University. Here is my new official web-page.
  • October, 2020: For the next three years I will serve as co-editor-in-chief of CGTA: Computational Geometry: Theory and Applications.
  • February, 2020 Together with Prof. G. Betz (KIT), Dr. A. Hirblinger (Graduate Institute Geneva), Dr. D. Lanius (KIT), Dr. A. Pak (Fraunhofer-IOSB), we have received a grant from Volkswagen Foundation for the project “Mediating Machines? Opportunities and Challenges of Artificial Intelligence (AI) in Peacemaking” within the program “Artificial Intelligence and the Society of the Future”.
  • September, 2019: I am excited to be in Program Committee of ITCS2020 (Innovations in Theoretical Computer Science).
  • February, 2019: I am happy to teach an introductory course to Algorithms for Network Visualization at the Winter School on Theoretical Foundations of Computer Science at the International Black Sea University (IBSU) in my home town Tbilisi. Here are some graphs we will visualize manually at this course.
  • July, 2018: Our paper with Moritz Klammler and Alexey Pak “Aesthetic Discrimination of Graph Layouts” was accepted to Graph Drawing 2108, Track B and was acknowledged with the best paper award in this track. In this paper we touch the basic question of Graph Drawing: “how to determine which of the two given layouts of the same graph is more aesthetically pleasing?” We succefully apply machine learning methods to answer this question.
  • July, 2018: Our paper with Almut Demel, Dominik Dürrschnabel, Marcel Radermacher and Lasse Wulf “A Greedy Heuristic for Crossing Angle Maximization” was accepted to Graph Drawing 2018, Track B. In this paper we report the algorithm that won the Graph Drawing Challenge in 2017 on Crossing Angle Maximization and present its experimental evaluation.