Giannos Stamoulis

CNRS researcher (chargé de recherche) in the graph team in Institut de Recherche en Informatique Fondamentale (IRIF), affiliated to both Université Paris Cité and CNRS.

email: stamoulisirif.fr


2023-2025: Postdoc at the Faculty of Mathematics, Informatics and Mechanics of University of Warsaw. Part of the ERC project BOBR, led by Michał Pilipczuk.
2020-2023: PhD at AlGCo team, LIRMM (Montpellier, France), under the supervision of Ignasi Sau and Dimitrios M. Thilikos. Here is my thesis.

My current research interests are mainly focused in (parameterized) algorithms in graphs, structural graph theory, and logic in computer science.

Here is my detailed CV.

Research Work

See also on arXiv, dblp, and Google Scholar.

  1. Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
    with Michał Pilipczuk and Michał Włodarczyk.
  2. Low rank MSO
    with Mikołaj Bojańczyk, Michał Pilipczuk, Wojciech Przybyszewski, and Marek Sokołowski.
  3. Faster diameter computation in graphs of bounded Euler genus
    with Kacper Kluk, Marcin Pilipczuk, and Michał Pilipczuk.
    • Conference: ICALP 2025
  4. Generating strongly 2-connected digraphs
    with Meike Hatzel, Stephan Kreutzer, Evangelos Protopapas, Florian Reich, and Sebastian Wiederrecht.
    • Under review
  5. Finding irrelevant vertices in linear time on bounded-genus graphs
    with Petr A. Golovach, Stavros G. Kolliopoulos, and Dimitrios M. Thilikos.
  6. Parameterizing the quantification of CMSO: model checking on minor-closed graph classes
    with Ignasi Sau and Dimitrios M. Thilikos.
  7. Minor Containment and Disjoint Paths in almost-linear time
    with Tuukka Korhonen and Michał Pilipczuk.
  8. Elementary first-order model checking for sparse graphs
    with Jakub Gajarský, Michał Pilipczuk, Marek Sokołowski, and Szymon Toruńczyk.
  9. Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes
    with Nicole Schirrmacher, Sebastian Siebertz, Dimitrios M. Thilikos, and Alexandre Vigny.
  10. Branchwidth is (1,g)-self-dual
    with Georgios Kontogeorgiou, Alexandros Leivaditis, Kostas I. Psaromiligkos, and Dimitris Zoros.
  11. Computing paths of large rank in planar frameworks deterministically
    with Fedor V. Fomin, Petr A. Golovach, and Tuukka Korhonen.
  12. Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
    with Petr A. Golovach and Dimitrios M. Thilikos.
  13. Shortest Cycles With Monotone Submodular Costs
    with Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, and Daniel Lokshtanov.
  14. Fixed-Parameter Tractability of Maximum Colored Path and Beyond
    with Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, and Kirill Simonov.
  15. Faster parameterized algorithms for modification problems to minor-closed classes
    with Laure Morelle, Ignasi Sau, and Dimitrios M. Thilikos.
  16. Compound Logics for Modification Problems
    with Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, and Dimitrios M. Thilikos.
  17. Combing a Linkage in an Annulus
    with Petr A. Golovach and Dimitrios M. Thilikos.
  18. Block Elimination Distance
    with Öznur Yasar Diner, Archontia C. Giannopoulou, and Dimitrios M. Thilikos.
  19. k-apices of minor-closed graph classes. II. Parameterized algorithms
    with Ignasi Sau and Dimitrios M. Thilikos.
  20. k-apices of minor-closed graph classes. I. Bounding the obstructions
    with Ignasi Sau and Dimitrios M. Thilikos.
  21. A more accurate view of the Flat Wall Theorem
    with Ignasi Sau and Dimitrios M. Thilikos.
  22. An Algorithmic Meta-theorem for graph modification to Planarity and FOL
    with Fedor V. Fomin, Petr A. Golovach, and Dimitrios M. Thilikos.
  23. Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
    with Petr A. Golovach and Dimitrios M. Thilikos.
  24. Minor-Obstructions for Apex Sub-unicyclic Graphs
    with Alexandros Leivaditis, Alexandros Singh, Dimitrios M. Thilikos, Konstantinos Tsatsanis, and Vasiliki Velona.
  25. Minor-Obstructions for Apex-Pseudoforests
    with Alexandros Leivaditis, Alexandros Singh, Dimitrios M. Thilikos, and Konstantinos Tsatsanis.

Recent Scientific Activities

  1. [Mar 2025]: With Hector Buffière and Patrice Ossona de Mendez, we started the working group "Graphs and Logic" in IRIF, with a monthly seminar and weekly work sessions.
  2. [Mar 2025]: Talk at the Distributed Algorithms and Graphs seminar (IRIF, Paris, France) about our algorithm for computing the diameter.
  3. [Feb 2025]: Started new position as CNRS researcher (chargé de recherche) in IRIF (Paris, France).
  4. [Jan 2025]: Talk at the Automata seminar of MIMUW (Warsaw, Poland) about low rank MSO.
  5. [Jan 2025]: Presented two papers at SODA 2025, in New Orleans, Louisiana, U.S..
  6. [Jan 2025]: Received a honorable mention ("accessit") in the 2024 "Gilles Kahn" prize for an excellent thesis in computer science in France.
  7. [Nov 2024]: Talk at the TCS seminar of Jagiellonian University (Krakow, Poland) about our linear-time implementation of the irrelevant vertex technique.
  8. [Oct 2024]: Participated in the Dagstuhl seminar ``New Tools in Parameterized Complexity: Paths, Cuts, and Decompositions''.
  9. [Aug 2024]: Received the 2024 "Charles Delorme" prize for an excellent thesis in graphs (theory and algorithms) in France.
  10. [July 2024]: Presented our paper on Disjoint-Paths Logic at LICS 2024, in Tallinn, Estonia.
  11. [July 2024]: Participated and gave a talk on Minor testing in almost-linear time at the 2nd Workshop on Structural Graph Theory (STWOR) in Chęciny, Poland.
  12. [June 2024]: Attended HALG 2024 in Warsaw, Poland.
  13. [Jan 2024]: Talks at the Graphs and Optimization seminar in LaBRI, Bordeaux, France, and the Distributed Algorithms and Graphs seminar in IRIF, Paris, France.
  14. [Dec 2023]: Talk at JCALM 2023 in Montpellier, France.
  15. [12 Dec 2023]: PhD defence (slides).
  16. [Nov 2023]: Talk at JGA 2023 in Villeurbanne, France.
  17. [Nov 2023]: Talk at the 2nd Workshop on Logic, Graphs, and Algorithms (LoGAlg2023) in Warsaw, Poland.
  18. [Sep 2023]: Participation in the Structural and Algorithmic Graph Theory Workshop in Będlewo, Poland.
  19. [Aug 2023]: Talk at ACAC'23 in Athens, Greece.
  20. [July 2023]: Presented our paper on Compound Logics at ICALP 2023, in Paderborn, Germany.
  21. [Apr 2023]: 4 weeks research visit at The Cambridge Logical Structures Hub, University of Cambridge, United Kingdom, invited by Anuj Dawar. Gave a talk at the Logic and Semantics Seminar about Disjoint-Paths Logic.
  22. [Mar 2023]: 4 weeks research visit at MIMUW, University of Warsaw, Poland, invited by Michał Pilipczuk. Gave talks at the Automata seminar about our paper on Model Checking Disjoint-Paths Logic and at the Algorithms seminar about our paper on FPT-algorithms for the Maximum Colored Path problem.
  23. [Jan 2023]: Presented our paper on Model Checking Disjoint-Paths Logic on Minor-free Graph Classes at SODA 2023, in Florence, Italy.
  24. [Dec 2022]: 4 weeks research visit at IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹), Daejeon, South Korea, invited by Sang-il Oum. Gave a talk at the Discrete Math Seminar of IBS.
  25. [Nov 2022]: Talk at the Workshop on Logic, Graphs, and Algorithms (LoGAlg2022) at LIRMM, Montpellier, France.
  26. [Nov 2022]: Talk at JGA 2022 in Paris, France.
  27. [Oct 2022]: 1 week research visit at AG Theoretische Informatik, University of Bremen, invited by Sebastian Siebertz.
  28. [Oct 2022]: Popular-science presentation at Fête de la Science, LIRMM, Montpellier, France.
  29. [Sep 2022]: Talk at CoA 2022 in Paris, France.
  30. [Sep 2022]: Talk at GROW 2022 in Koper, Slovenia.
  31. [Jul 2022]: Talk at ICGT 2022 in Montpellier, France (also served as part of the organizing commitee).
  32. [May 2022]: Participation in GRASTA 2022 in Porquerolles, France.
  33. [May 2022]: Talk at APGA 2022 in Calp, Spain.
  34. [Apr 2022]: Participated in the online Directed minors and digraph structure theory workshop.
  35. [Mar 2022]: Poster presentation at JNIM 2022 in Villeneuve d'Ascq, France (the poster).
  36. [Sep 2021]: 2 weeks research visit at Algorithms Research Group, University of Bergen, invited by Fedor Fomin. Gave a talk at the Algorithms seminar.
  37. Regular talks at the AlGCo seminar in LIRMM, Montpellier, France.

Teaching

As a tutor

In the Inter-Institutional Graduate Program “Algorithms, Logic, & Discrete Mathematics”, Athens, Greece:

As a teaching assistant

In the Department of Informatics, Faculty of Science, University of Montpellier, Montpellier, France:

In the Department of Informatics and Telecommunications & Department of Mathematics, NKUA, Athens, Greece:



Address: Office 3036, Bâtiment Sophie Germain, 8 Place Aurélie Nemours, 75205 Paris Cedex 13, France.

OSZAR »