Giannos Stamoulis

54 papers A* 16A 1B 2Journal 34
YearRankTypeTitle / Venue / Authors
2026 A* conf
A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space.
SODA
Benjamin Bergougnoux, Vera Chekan, Giannos Stamoulis
2026 A* conf
Catching Rats in H-minor-free Graphs.
SODA
Maximilian Gorsky, Giannos Stamoulis, Dimitrios M. Thilikos, Sebastian Wiederrecht
2026 A* conf
Planar Disjoint Shortest Paths is Fixed-Parameter Tractable.
SODA
Michal Pilipczuk, Giannos Stamoulis, Michal Wlodarczyk
2025 J jnl
A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space.
CoRR
Benjamin Bergougnoux, Vera Chekan, Giannos Stamoulis
2025 J jnl
Catching Rats in
CoRR
Maximilian Gorsky, Giannos Stamoulis, Dimitrios M. Thilikos, Sebastian Wiederrecht
2025 J jnl
Compound Logics for Modification Problems.
ACM Trans. Comput. Log.
Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2025 J jnl
Computing Paths of Large Rank in Planar Frameworks Deterministically.
SIAM J. Discret. Math.
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis
2025 A* conf
Faster Diameter Computation in Graphs of Bounded Euler Genus.
ICALP
Kacper Kluk, Marcin Pilipczuk, Michal Pilipczuk, Giannos Stamoulis
2025 J jnl
Faster diameter computation in graphs of bounded Euler genus.
CoRR
Kacper Kluk, Marcin Pilipczuk, Michal Pilipczuk, Giannos Stamoulis
2025 A* conf
Finding irrelevant vertices in linear time on bounded-genus graphs.
SODA
Petr A. Golovach, Stavros G. Kolliopoulos, Giannos Stamoulis, Dimitrios M. Thilikos
2025 J jnl
Low rank MSO.
CoRR
Mikolaj Bojanczyk, Michal Pilipczuk, Wojciech Przybyszewski, Marek Sokolowski, Giannos Stamoulis
2025 A* conf
Parameterizing the quantification of CMSO: model checking on minor-closed graph classes.
SODA
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2025 J jnl
Planar Disjoint Shortest Paths is Fixed-Parameter Tractable.
CoRR
Michal Pilipczuk, Giannos Stamoulis, Michal Wlodarczyk
2024 J jnl
A more accurate view of the Flat Wall Theorem.
J. Graph Theory
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2024 J jnl
Branchwidth is (1,g)-self-dual.
Discret. Appl. Math.
Georgios Kontogeorgiou, Alexandros Leivaditis, Kostas I. Psaromiligkos, Giannos Stamoulis, Dimitris Zoros
2024 A* conf
Elementary first-order model checking for sparse graphs.
LICS
Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk
2024 J jnl
Elementary first-order model checking for sparse graphs.
CoRR
Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk
2024 J jnl
Faster parameterized algorithms for modification problems to minor-closed classes.
TheoretiCS
Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2024 J jnl
Fixed-Parameter Tractability of Maximum Colored Path and Beyond.
ACM Trans. Algorithms
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
2024 A* conf
Minor Containment and Disjoint Paths in Almost-Linear Time.
FOCS
Tuukka Korhonen, Michal Pilipczuk, Giannos Stamoulis
2024 J jnl
Minor Containment and Disjoint Paths in almost-linear time.
CoRR
Tuukka Korhonen, Michal Pilipczuk, Giannos Stamoulis
2024 A* conf
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes.
LICS
Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny
2024 J jnl
Parameterizing the quantification of CMSO: model checking on minor-closed graph classes.
CoRR
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2024 J jnl
Shortest Cycles with Monotone Submodular Costs.
ACM Trans. Algorithms
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
2023 J jnl
Combing a Linkage in an Annulus.
SIAM J. Discret. Math.
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2023 A* conf
Compound Logics for Modification Problems.
ICALP
Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2023 B conf
Computing Paths of Large Rank in Planar Frameworks Deterministically.
ISAAC
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis
2023 J jnl
Computing paths of large rank in planar frameworks deterministically.
CoRR
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis
2023 A* conf
Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes.
ICALP
Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2023 A* conf
Fixed-Parameter Tractability of Maximum Colored Path and Beyond.
SODA
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
2023 J jnl
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable.
ACM Trans. Algorithms
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2023 — —
Logiques et Algorithmes pour de mineurs de graphes. (Logics and Algorithms for Graph Minors).
Giannos Stamoulis
2023 J jnl
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes.
CoRR
Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny
2023 A* conf
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes.
SODA
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2023 A* conf
Shortest Cycles With Monotone Submodular Costs.
SODA
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
2022 J jnl
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL.
ACM Trans. Comput. Theory
Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2022 J jnl
Block Elimination Distance.
Graphs Comb.
Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
2022 J jnl
Faster parameterized algorithms for modification problems to minor-closed classes.
CoRR
Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2022 J jnl
Fixed-Parameter Tractability of Maximum Colored Path and Beyond.
CoRR
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
2022 J jnl
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes.
CoRR
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2022 J jnl
Shortest Cycles With Monotone Submodular Costs.
CoRR
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
2021 J jnl
A more accurate view of the Flat Wall Theorem.
CoRR
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2021 J jnl
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL.
CoRR
Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2021 B conf
Block Elimination Distance.
WG
Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
2021 J jnl
Block Elimination Distance.
CoRR
Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
2021 J jnl
Compound Logics for Modification Problems.
CoRR
Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2021 J jnl
Minor obstructions for apex-pseudoforests.
Discret. Math.
Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis
2021 J jnl
k-apices of minor-closed graph classes. I. Bounding the obstructions.
CoRR
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2020 A conf
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL.
ESA
Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2020 A* conf
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes.
ICALP
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2020 A* conf
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable.
SODA
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2020 J jnl
Minor-obstructions for apex sub-unicyclic graphs.
Discret. Appl. Math.
Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis, Vasiliki Velona
2020 J jnl
k-apices of minor-closed graph classes. II. Parameterized algorithms.
CoRR
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2019 J jnl
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable.
CoRR
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos