Research Activities

Talks

##@ 2026

1. CONGEST algorithms in sparse graph classes. ENEDISC LaBRI Meeting - Bourdeaux, France.

2. Distributed treewidth Computation and Courcelle’s Theorem in CONGEST model. PODC - Egham, UK.

[slides]

2025

1. Distributed Courcelle’s Theorem in the CONGEST model, Algorithms and Complexity Seminar, IRIF — Paris, France.

2. Distributed Courcelle’s Theorem in the CONGEST model, MoMA — Aussois, France.

3. Deterministic Distributed DFS via Cycle Separators in Planar Graphs, PODC 2025 — Huatulco, México.
   [Paper]

4. Distributed DFS computation in planar graphs, Discrete Summer School — Valparaíso, Chile.

2024

1. Separator sets: Computation and application in distributed models, LIFO Seminar — Orléans, France.

2. Local techniques in global problems, Seminar of Complex Systems — Santiago, Chile.

2023

1. Energy Efficient Algorithms, PhD Seminar — Santiago, Chile.

Conferences and Workshops

1. Modern Optimization Methods and Models in Algorithm Design (MoMA) — Aussois, France. November 2025.

2. Distributed Quantum Computing Workshop — Helsinki, Finland. October 2025.

3. PODC 2025 — Huatulco, México. June 2025.

4. DISC 2024 — Madrid, Spain. October 2024.

Research Visits

1. LIFO, Université d’Orléans — Orléans, France. October 2024 and June 2026.

2. IMDEA Networks — Madrid, Spain. November 2024.