Ioannis Eleftheriadis : Publications
-
[1]
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
-
[2]
Monadic NIP in Monotone Classes of Relational Structures
Samuel Braunfeld‚ Anuj Dawar‚ Ioannis Eleftheriadis and Aris Papadopoulos
In 50th International Colloquium on Automata‚ Languages‚ and Programming (ICALP 2023). Schloss Dagstuhl−Leibniz−Zentrum für Informatik. 2023.
Details about Monadic NIP in Monotone Classes of Relational Structures | BibTeX data for Monadic NIP in Monotone Classes of Relational Structures
-
[3]
Universal slices of the category of graphs
Ioannis Eleftheriadis
In Algebra universalis. Vol. 85. No. 4. Pages 42. 2024.
Details about Universal slices of the category of graphs | BibTeX data for Universal slices of the category of graphs
-
[4]
First−Order Model Checking on Monadically Stable Graph Classes
Jan Dreier‚ Ioannis Eleftheriadis‚ Nikolas Mahlmann‚ Rose McCarty‚ Michal Pilipczuk and Szymon Torunczyk
In 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS). Pages 21−30. Los Alamitos‚ CA‚ USA. October, 2024. IEEE Computer Society.
Details about First−Order Model Checking on Monadically Stable Graph Classes | BibTeX data for First−Order Model Checking on Monadically Stable Graph Classes | DOI (10.1109/FOCS61266.2024.00012) | Link to First−Order Model Checking on Monadically Stable Graph Classes
-
[5]
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
-
[6]
Preservation Theorems on Sparse Classes Revisited
Anuj Dawar and Ioannis Eleftheriadis
In Rastislav Královič and Antońın Kučera, editors, 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). Vol. 306 of Leibniz International Proceedings in Informatics (LIPIcs). Pages 47:1–47:16. Dagstuhl‚ Germany. 2024. Schloss Dagstuhl – Leibniz−Zentrum für Informatik.
Details about Preservation Theorems on Sparse Classes Revisited | BibTeX data for Preservation Theorems on Sparse Classes Revisited | DOI (10.4230/LIPIcs.MFCS.2024.47) | Link to Preservation Theorems on Sparse Classes Revisited
-
[7]
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