Giannos Stamoulis
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
21
Venues
7
Active years
2020–2026
Best venue rank
A*
Where they publish
Papers
21 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | LICS | Low Rank MSO. | Mikolaj Bojanczyk, Michal Pilipczuk, Wojciech Przybyszewski, Marek Sokolowski, Giannos Stamoulis |
| 2026 | LICS | Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes. | Ignasi Sau, Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny |
| 2026 | SODA | A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space. | Benjamin Bergougnoux, Vera Chekan, Giannos Stamoulis |
| 2026 | SODA | Catching Rats in H-minor-free Graphs. | Maximilian Gorsky, Giannos Stamoulis, Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2026 | SODA | Planar Disjoint Shortest Paths is Fixed-Parameter Tractable. | Michal Pilipczuk, Giannos Stamoulis, Michal Wlodarczyk |
| 2025 | ICALP | Faster Diameter Computation in Graphs of Bounded Euler Genus. | Kacper Kluk, Marcin Pilipczuk, Michal Pilipczuk, Giannos Stamoulis |
| 2025 | SODA | Finding irrelevant vertices in linear time on bounded-genus graphs. | Petr A. Golovach, Stavros G. Kolliopoulos, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2025 | SODA | Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. | Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2024 | FOCS | Minor Containment and Disjoint Paths in Almost-Linear Time. | Tuukka Korhonen, Michal Pilipczuk, Giannos Stamoulis |
| 2024 | LICS | Elementary first-order model checking for sparse graphs. | Jakub Gajarsk, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk |
| 2024 | LICS | Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. | Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny |
| 2023 | ICALP | Compound Logics for Modification Problems. | Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2023 | ICALP | Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes. | Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2023 | ISAAC | Computing Paths of Large Rank in Planar Frameworks Deterministically. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis |
| 2023 | SODA | Shortest Cycles With Monotone Submodular Costs. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis |
| 2023 | SODA | Fixed-Parameter Tractability of Maximum Colored Path and Beyond. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis |
| 2023 | SODA | Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. | Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2021 | WG | Block Elimination Distance. | znur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2020 | ESA | An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. | Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2020 | ICALP | An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes. | Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2020 | SODA | Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. | Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos |