Ioannis Eleftheriadis
Ioannis Eleftheriadis
Interests
Μy interests broadly lie in theoretical computer science, combinatorics, and mathematical logic. More precisely, I work in structural and algorithmic graph theory and its interactions with (finite) model theory. I am currently exploring applications of the above areas to constraint satisfaction problems.
Biography
Prior to this, I was a PhD student at the University of Cambridge (2021-2025), where I was fortunate to be advised by Anuj Dawar. Before my PhD, I obtained an MMathCompSci in Mathematics and Computer Science at the University of Oxford (2017-2021).
Selected Publications
-
Algebraically universal categories of relational structures
Ioannis Eleftheriadis
In Journal of Pure and Applied Algebra. Vol. 229. No. 6. Pages 107984. 2025.
Details about Algebraically universal categories of relational structures | BibTeX data for Algebraically universal categories of relational structures | DOI (https://doi.org/10.1016/j.jpaa.2025.107984) | Link to Algebraically universal categories of relational structures
-
Extension Preservation on Dense Graph Classes
Ioannis Eleftheriadis
In Jörg Endrullis and Sylvain Schmitz, editors, 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025). Vol. 326 of Leibniz International Proceedings in Informatics (LIPIcs). Pages 7:1–7:21. Dagstuhl‚ Germany. 2025. Schloss Dagstuhl – Leibniz−Zentrum für Informatik.
Details about Extension Preservation on Dense Graph Classes | BibTeX data for Extension Preservation on Dense Graph Classes | DOI (10.4230/LIPIcs.CSL.2025.7) | Link to Extension Preservation on Dense Graph Classes
-
Separability Properties of Monadically Dependent Graph Classes
Έdouard Bonnet‚ Samuel Braunfeld‚ Ioannis Eleftheriadis‚ Colin Geniet‚ Nikolas Mählmann‚ Michał Pilipczuk‚ Wojciech Przybyszewski and Szymon Toruńczyk
In Keren Censor−Hillel‚ Fabrizio Grandoni‚ Joël Ouaknine and Gabriele Puppis, editors, 52nd International Colloquium on Automata‚ Languages‚ and Programming (ICALP 2025). Vol. 334 of Leibniz International Proceedings in Informatics (LIPIcs). Pages 147:1–147:19. Dagstuhl‚ Germany. 2025. Schloss Dagstuhl – Leibniz−Zentrum für Informatik.
Details about Separability Properties of Monadically Dependent Graph Classes | BibTeX data for Separability Properties of Monadically Dependent Graph Classes | DOI (10.4230/LIPIcs.ICALP.2025.147) | Link to Separability Properties of Monadically Dependent Graph Classes