Giannos Stamoulis

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 38

Top Topics

Temporal Epistemic

Top Venues

ACM Trans. Algorithms

Publications

Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
Shortest Cycles with Monotone Submodular Costs. ACM Trans. Algorithms 20 (1) (2024)
Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk
Elementary first-order model checking for sparse graphs. LICS (2024)
Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk
Elementary first-order model checking for sparse graphs. CoRR (2024)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. CoRR (2024)
Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. LICS (2024)
Tuukka Korhonen, Michal Pilipczuk, Giannos Stamoulis
Minor Containment and Disjoint Paths in almost-linear time. CoRR (2024)
Georgios Kontogeorgiou, Alexandros Leivaditis, Kostas I. Psaromiligkos, Giannos Stamoulis, Dimitris Zoros
Branchwidth is (1,g)-self-dual. Discret. Appl. Math. 350 (2024)
Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. SODA (2023)
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. ACM Trans. Algorithms 19 (3) (2023)
Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes. ICALP (2023)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
-apices of minor-closed graph classes. I. Bounding the obstructions. J. Comb. Theory, Ser. B 161 (2023)
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. SODA (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis
Computing paths of large rank in planar frameworks deterministically. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
Shortest Cycles With Monotone Submodular Costs. SODA (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis
Computing Paths of Large Rank in Planar Frameworks Deterministically. ISAAC (2023)
Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Compound Logics for Modification Problems. ICALP (2023)
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Combing a Linkage in an Annulus. SIAM J. Discret. Math. 37 (4) (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. CoRR (2022)
Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Faster parameterized algorithms for modification problems to minor-closed classes. CoRR (2022)
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. CoRR (2022)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
-apices of Minor-closed Graph Classes. II. Parameterized Algorithms. ACM Trans. Algorithms 18 (3) (2022)
Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ACM Trans. Comput. Theory 14 (3-4) (2022)
Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
Block Elimination Distance. Graphs Comb. 38 (5) (2022)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
Shortest Cycles With Monotone Submodular Costs. CoRR (2022)
Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
Block Elimination Distance. WG (2021)
Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. CoRR (2021)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
k-apices of minor-closed graph classes. I. Bounding the obstructions. CoRR (2021)
Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis
Minor obstructions for apex-pseudoforests. Discret. Math. 344 (10) (2021)
Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
Block Elimination Distance. CoRR (2021)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
A more accurate view of the Flat Wall Theorem. CoRR (2021)
Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
A Compound Logic for Modification Problems: Big Kingdoms Fall from Within. CoRR (2021)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes. ICALP (2020)
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. SODA (2020)
Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ESA (2020)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
k-apices of minor-closed graph classes. II. Parameterized algorithms. CoRR (2020)
Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis, Vasiliki Velona
Minor-obstructions for apex sub-unicyclic graphs. Discret. Appl. Math. 284 (2020)
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. CoRR (2019)