Giannos Stamoulis
PhD student in
AlGCo team,
LIRMM, Université de Montpellier, CNRS, France.
email: giannos.stamoulislirmm.fr
Laboratoire d'Informatique Robotique et Microélectronique de Montpellier (LIRMM),
161 rue Ada,
34392 Montpellier cedex 5,
France
- Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, and Alexandre Vigny.
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes.
- Petr A. Golovach, Giannos Stamoulis, and Dimitrios M. Thilikos.
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes.
-
Short version
in the Proc. of the 34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023).
-
Full version under review.
- Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, and Giannos Stamoulis.
Shortest Cycles With Monotone Submodular Costs.
-
Short version
in the Proc. of the 34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023).
- Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, and Giannos Stamoulis.
Fixed-Parameter Tractability of Maximum Colored Path and Beyond.
-
Short version
in the Proc. of the 34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023).
- Laure Morelle, Ignasi Sau, Giannos Stamoulis, and Dimitrios M. Thilikos.
Faster parameterized algorithms for modification problems to minor-closed classes.
- Petr A. Golovach, Giannos Stamoulis, and Dimitrios M. Thilikos.
Combing a Linkage in an Annulus.
- Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, and Dimitrios M. Thilikos.
Compound Logics for Modification Problems.
- Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, and Dimitrios M. Thilikos.
Block Elimination Distance.
-
Short version in the Proc. of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2021).
-
Full version in Graphs and Combinatorics (GCOM), 38:133, 2022.
- Ignasi Sau, Giannos Stamoulis, and Dimitrios M. Thilikos.
k-apices of minor-closed graph classes. II. Parameterized algorithms.
-
Short version (entitled ''An FPT-algorithm for recognizing k-apices of minor-closed graph classes'') in Proc. of the 47th International Colloquium on Automata, Languages and Programming (ICALP 2020).
-
Full version in ACM Transactions on Algorithms (TALG), 18(3): 21:1-21:30, 2022.
- Ignasi Sau, Giannos Stamoulis, and Dimitrios M. Thilikos.
k-apices of minor-closed graph classes. I. Bounding the obstructions.
-
Full version in Journal of Combinatorial Theory, Series B (JCTB), 161: 180-227, 2023
- Ignasi Sau, Giannos Stamoulis, and Dimitrios M. Thilikos.
A more accurate view of the Flat Wall Theorem.
- Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, and Dimitrios M. Thilikos.
An Algorithmic Meta-theorem for graph modification to Planarity and FOL.
-
Short version in Proc. of the 28th Annual European Symposium on Algorithms (ESA 2020).
-
Full version
in ACM Transactions on Computation Theory (TOCT), 14(3-4): 13:1-13:29, 2022.
- Petr A. Golovach, Giannos Stamoulis, and Dimitrios M. Thilikos.
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable.
-
Short version
in the Proc. of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020).
-
Full version
in ACM Transactions on Algorithms (TALG), 2023.
- Petr A. Golovach, Stavros G. Kolliopoulos, Giannos Stamoulis, and Dimitrios M. Thilikos.
Planar Disjoint Paths in Linear Time.
- Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis, and Vasiliki Velona.
Minor-Obstructions for Apex Sub-unicyclic Graphs.
-
Short version
in Proc. of EUROCOMB 2019, Acta Mathematica Universitatis Comenianae, volume 88(3), pages 903–910, 2019.
-
Full version
in Discrete Applied Mathematics (DAM), 284: 538 - 555, 2020.
- Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, and Konstantinos Tsatsanis.
Minor-Obstructions for Apex-Pseudoforests.
-
Full version
in Discrete Mathematics (DM) 344(10), 112529, 2021.