An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes. - Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (ICALP, 2020)

k-apices of minor-closed graph classes. II. Parameterized algorithms. - Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (CoRR, 2020)

Minor-obstructions for apex sub-unicyclic graphs. - Alexandros Leivaditis; Alexandros Singh; Giannos Stamoulis; Dimitrios M. Thilikos; Konstantinos Tsatsanis; Vasiliki Velona (Discret. Appl. Math., 2020)

k-apices of minor-closed graph classes. I. Bounding the obstructions. - Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (CoRR, 2021)

Minor obstructions for apex-pseudoforests. - Alexandros Leivaditis; Alexandros Singh; Giannos Stamoulis; Dimitrios M. Thilikos; Konstantinos Tsatsanis (Discret. Math., 2021)

Block Elimination Distance. - Öznur Yasar Diner; Archontia C. Giannopoulou; Giannos Stamoulis; Dimitrios M. Thilikos (Graphs Comb., 2022)

k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms. - Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (ACM Trans. Algorithms, 2022)

An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. - Fedor V. Fomin; Petr A. Golovach; Giannos Stamoulis; Dimitrios M. Thilikos (ACM Trans. Comput. Theory, 2022)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. - Petr A. Golovach; Giannos Stamoulis; Dimitrios M. Thilikos (SODA, 2023)

k-apices of minor-closed graph classes. I. Bounding the obstructions. - Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (J. Comb. Theory B, 2023)

Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. - Petr A. Golovach; Giannos Stamoulis; Dimitrios M. Thilikos (ACM Trans. Algorithms, 2023)

Combing a Linkage in an Annulus. - Petr A. Golovach; Giannos Stamoulis; Dimitrios M. Thilikos (SIAM J. Discret. Math., 2023)

Minor Containment and Disjoint Paths in Almost-Linear Time. - Tuukka Korhonen; Michal Pilipczuk; Giannos Stamoulis (FOCS, 2024)

Elementary first-order model checking for sparse graphs. - Jakub Gajarský; Michal Pilipczuk; Marek Sokolowski 001; Giannos Stamoulis; Szymon Torunczyk (LICS, 2024)

Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. - Nicole Schirrmacher; Sebastian Siebertz; Giannos Stamoulis; Dimitrios M. Thilikos; Alexandre Vigny (LICS, 2024)

Branchwidth is (1,g)-self-dual. - Georgios Kontogeorgiou; Alexandros Leivaditis; Kostas I. Psaromiligkos; Giannos Stamoulis; Dimitris Zoros (Discret. Appl. Math., 2024)

A more accurate view of the Flat Wall Theorem. - Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (J. Graph Theory, 2024)

Faster parameterized algorithms for modification problems to minor-closed classes. - Laure Morelle; Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (TheoretiCS, 2024)

Shortest Cycles with Monotone Submodular Costs. - Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; Daniel Lokshtanov; Giannos Stamoulis (ACM Trans. Algorithms, 2024)

Fixed-Parameter Tractability of Maximum Colored Path and Beyond. - Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; Kirill Simonov; Giannos Stamoulis (ACM Trans. Algorithms, 2024)

Faster Diameter Computation in Graphs of Bounded Euler Genus. - Kacper Kluk; Marcin Pilipczuk; Michal Pilipczuk; Giannos Stamoulis (ICALP, 2025)

Finding irrelevant vertices in linear time on bounded-genus graphs. - Petr A. Golovach; Stavros G. Kolliopoulos; Giannos Stamoulis; Dimitrios M. Thilikos (SODA, 2025)

Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. - Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (SODA, 2025)

Computing Paths of Large Rank in Planar Frameworks Deterministically. - Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; Giannos Stamoulis (SIAM J. Discret. Math., 2025)

Compound Logics for Modification Problems. - Fedor V. Fomin; Petr A. Golovach; Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (ACM Trans. Comput. Log., 2025)

Low rank MSO. - Mikolaj Bojanczyk; Michal Pilipczuk; Wojciech Przybyszewski; Marek Sokolowski 001; Giannos Stamoulis (CoRR, 2025)

Planar Disjoint Shortest Paths is Fixed-Parameter Tractable. - Michal Pilipczuk; Giannos Stamoulis; Michal Wlodarczyk 001 (CoRR, 2025)

Catching Rats in H-minor-free Graphs. - Maximilian Gorsky; Giannos Stamoulis; Dimitrios M. Thilikos; Sebastian Wiederrecht (CoRR, 2025)