Raul Lopes
Talks & events

Where I've spoken

Conference presentations, invited seminars, workshops and schools, newest first.

  1. 2025
    Workshop Bremen-Hamburg Workshop on Algorithms, Combinatorics and Optimization. Talk: On directed pathwidth, jungles, and cliquewidth of h-semicomplete digraphs.
  2. 2025
    Conference 52nd International Colloquium on Automata, Languages, and Programming (ICALP). Talk: Revisiting Directed Disjoint Paths on tournaments (and relatives).
  3. 2024
    Invited talk Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier (LIRMM). Talk: New Menger-like dualities in digraphs and applications to half-integral linkages.
  4. 2023
    Workshop 3rd Workshop Complexity and Algorithms (CoA). Talk: New Menger-like dualities in digraphs and applications to half-integral linkages.
  5. 2023
    Conference 31st Annual European Symposium on Algorithms (ESA). Talk: New Menger-like dualities in digraphs and applications to half-integral linkages.
  6. 2023
    Conference 34th International Workshop on Combinatorial Algorithms (IWOCA). Talk: On computing large temporal (unilateral) connected components.
  7. 2023
    Meeting Fifth ANR Digraphs meeting, Sète, France. Talk: New Menger-like dualities in digraphs and applications to half-integral linkages.
  8. 2022
    Conference 17th International Symposium on Parameterized and Exact Computation (IPEC). Talk: Twin-width VIII: delineation and win-wins.
  9. 2022
    Seminar Discrete Math Seminar, IBS Discrete Mathematics Group (DIMAG), Daejeon, South Korea. Talk: Temporal Menger and related problems.
  10. 2022
    Seminar AlGCo seminar, Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier (LIRMM). Talk: Adapting the Directed Grid Theorem into an FPT algorithm.
  11. 2022
    Seminar Laboratoire d’Analyse et de Modélisation de Systèmes pour l’Aide à la Décision (LAMSADE), Université Paris-Dauphine. Talk: Adapting the Directed Grid Theorem into an FPT algorithm.
  12. 2022
    Conference 16th International Conference and Workshops on Algorithms and Computation (WALCOM). Talk: Parameterized algorithms for Steiner Tree and Dominating Set: bounding the leafage by the vertex leafage.
  13. 2021
    Seminar Seminários online de Grafos, Algoritmos e Combinatória — online. Talk: Adapting the Directed Grid Theorem into an FPT algorithm.
  14. 2021
    Invited talk IBS Discrete Mathematics Group (DIMAG) Virtual Discrete Math Colloquium — online. Talk: Adapting the Directed Grid Theorem into an FPT algorithm.
  15. 2021
    Invited talk Max Planck Institute for Informatics (MPI) — online. Talk: Adapting the Directed Grid Theorem into an FPT algorithm.
  16. 2020
    Conference 45th International Symposium on Mathematical Foundations of Computer Science (MFCS). Talk: A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps.
  17. 2020
    Conference 31st International Workshop on Combinatorial Algorithms (IWOCA). Talk: Edge-disjoint branchings in temporal graphs.
  18. 2019
    Organisation 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG). Member of the organizing committee.
  19. 2018
    Seminar AlGCo seminar, Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier (LIRMM). Talk: Disjoint paths, grids and tree-width: the directed case.
  20. 2018
    Workshop VIII Latin American Workshop on Cliques in Graphs (LAWCG). Talk: Directed tree-width is FPT.
  21. 2016
    School São Paulo School of Advanced Science on Algorithms, Combinatorics and Optimization. Poster: A Proof for a Conjecture of Gorgol.
  22. 2016
    Workshop Bordeaux Graph Workshop (BGW). Talk: A Proof for a Conjecture of Gorgol.
  23. 2015
    Conference VIII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS). Talk: A Proof for a Conjecture of Gorgol.