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

  1. 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.
  2. 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).
  3. 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).
  4. Laure Morelle, Ignasi Sau, Giannos Stamoulis, and Dimitrios M. Thilikos. Faster parameterized algorithms for modification problems to minor-closed classes.
    • Under review.
  5. Petr A. Golovach, Giannos Stamoulis, and Dimitrios M. Thilikos. Combing a Linkage in an Annulus.
    • Under review.
  6. Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, and Dimitrios M. Thilikos. Compound Logics for Modification Problems.
    • Under review.
  7. Ö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.
  8. 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.
  9. Ignasi Sau, Giannos Stamoulis, and Dimitrios M. Thilikos. k-apices of minor-closed graph classes. I. Bounding the obstructions.
    • Under review.
  10. Ignasi Sau, Giannos Stamoulis, and Dimitrios M. Thilikos. A more accurate view of the Flat Wall Theorem.
    • Under review.
  11. 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.
  12. 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 accepted in ACM Transactions on Algorithms (TALG).
  13. Petr A. Golovach, Stavros G. Kolliopoulos, Giannos Stamoulis, and Dimitrios M. Thilikos. Planar Disjoint Paths in Linear Time.
  14. 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.
  15. Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, and Konstantinos Tsatsanis. Minor-Obstructions for Apex-Pseudoforests.

arXiv link dblp link google scholar link