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

Talks

2023
  1. Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes, 34th ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Florence, Italy, January 24, 2023.
2022
  1. Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes, Discrete Math Seminar, IBS, Daejeon, South Korea, December 06, 2022.
  2. Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes, LoGAlg2022: Workshop on Logic, Graphs, and Algorithms, Montpellier, France, November 21, 2022.
  3. Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes, 24e Journées Graphes et Algorithmes (JGA 2022), Paris, France, November 16-18, 2022.
  4. Fixed-Parameter Tractability of Maximum Colored Path and Beyond, CoA 2022, Paris, France, September 28, 2022.
  5. Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes, GROW 2022, Koper, Slovenia, September 21, 2022.
  6. Obstruction Set Constructibility of Minor-Closed Graph Classes, ICGT 2022, Montpellier, France, July 04, 2022.
  7. Paths and Cycles of Large Rank in Frameworks, APGA 2022, Calp, Spain, May 04, 2022.
  8. Theta-logic and Algorithmic meta-theorems, Poster presentation at Journées Nationales du GDR IM (JNIM 2022), Villeneuve d'Ascq, France, March 31, 2022.
  9. Paths and Cycles of Large Rank in Frameworks, AlGCo seminar, Montpellier, France, March 24, 2022, held online.
2021
  1. Bounding the Obstructions for Apices of Minor-closed Graph Classes, 23e Journées Graphes et Algorithmes (JGA 2021), Montpellier, France, November 15-19, 2021, held online.
  2. Block elimination distance, Algorithms research group seminar, UiB, Bergen, Norway, September 17, 2021.
  3. Block elimination distance, AlGCo seminar, Montpellier, France, July 01, 2021, held online.
  4. Block elimination distance, 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2021), June 23-25, 2021, held online.
  5. Block elimination distance, Athens, Greece, June 21, 2021, held online.
  6. An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL, Athens, Greece, May 24, 2021, held online.
  7. Parameterized Algorithms for Vertex Deletion to Minor-closed Graph Classes, AlGCo seminar, Montpellier, France, April 15, 2021, held online.
  8. Bounding the obstructions of apices of minor-closed graph classes, series of 6 lectures, Athens, Greece, March-April 2021, held online.
2020
  1. Block elimination distance, 22e Journées Graphes et Algorithmes (JGA 2020), November 16-18, 2020, held online.
  2. An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL, 28th Annual European Symposium on Algorithms (ESA 2020), September 7-9, 2020, held online.
  3. An FPT-algorithm for recognizing k-apices of minor-closed graph classes, 47th International Colloquium on Automata, Languages and Programming (ICALP 2020), July 8-11, 2020, held online.
2019
  1. Graph Modification: An algorithmic meta-theorem beyond treewidth, First French-Norwegian Workshop on Algorithms and Combinatorics (FraNorAC 2019), Montpellier, France, September 19-20, 2019.

Participation in workshops

  1. 2nd Workshop Complexity and Algorithms (CoA 2022), September 26-28, 2022, Paris, France.
  2. 10th Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2022), September 19-22, 2022, Koper, Slovenia.
  3. 10th Workshop on GRAph Searching, Theory and Applications (GRASTA 2022), May 16-20, 2022, Porquerolles, France.
  4. Advances in Parameterized Graph Algorithms (APGA 2022), May 02-06, 2022, Calp, Spain.
  5. Directed minors and digraph structure theory, April 04-08, 2022, held online.
  6. Graph Product Structure Theory (21w5235), November 21-26, 2021, Banff, Canada (remote participation).
  7. Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391), September 26 - October 1, 2021, Dagstuhl, Germany (remote participation).
  8. First French-Norwegian Workshop on Algorithms and Combinatorics (FraNorAC 2019), September 19-20, 2019, Montpellier, France.

Participation in organizing comittees

  1. JGA 2021, ICGT 2022