[2] Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. Metric Dimension and its Variants: Structural and Algorithmic Results Minisymposium of the Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM 2023), Winnipeg, Canada, June 2023.

[1] Eternal Domination in D-Dimensional Grids. Graph Searching Minisymposium of the Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM 2021), Online, May 2021. 

[24] Non-Clashing Teaching Maps for Balls in Graphs. 37th Annual Conference on Learning Theory (COLT 2024), Edmonton, Canada, June 2024.

[23] Enumerating Minimal Solution Sets for Metric Graph Problems. 50th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2024), Gozd Martuljek, Slovenia, June 2024.

[22] Tight (Double) Exponential Bounds for NP-complete Problems: Treewidth and Vertex Cover Parameterizations. 25es Journées Graphes et Algorithmes (JGA 2023), Lyon, France, November 2023.

[21] Tight (Double) Exponential Bounds for NP-complete Problems: Treewidth and Vertex Cover Parameterizations. 11th Workshop on GRAph Searching, Theory & Applications (GRASTA 2023), Bertinoro, Italy, October 2023.

[20] Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. 24es Journées Graphes et Algorithmes (JGA 2022), Paris, France, November 2022.

[19] Sample compression schemes for balls in graphs. 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Vienna, Austria, August 2022.

[18] The Largest Connected Subgraph Game. 9th Graph Searching in Canada Workshop (GRASCan 2021), Online, August 2021.

[17] The Largest Connected Subgraph Game. 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2021), Online, June 2021.

[16] Distinguishing Balls in Graphs. 22es Journées Graphes et Algorithmes (JGA 2020), Online, November 2020.

[15] Metric Dimension: from Graphs to Oriented Graphs. 21es Journées Graphes et Algorithmes (JGA 2019), Brussels, Belgium, November 2019.

[14] The Orthogonal Colouring Game. 5th Bordeaux Graph Workshop (BGW 2019), Bordeaux, France, October 2019.

[13] Sequential Metric Dimension. 8th Graph Searching in Canada Workshop (GRASCan 2019), Toronto, Canada, August 2019.

[12] Metric Dimension: from Graphs to Oriented Graphs. 10th Latin & American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), Belo Horizonte, Brazil, June 2019.

[11] Eternal Domination in Grids. 11th International Conference on Algorithms and Complexity (CIAC 2019), Rome, Italy, May 2019.

[10] The Orthogonal Colouring Game. Combinatorial Game Theory Colloquium III (CGTC III), Lisbon, Portugal, January 2019.

[9] Eternal Domination in Grids. 20es Journées Graphes et Algorithmes (JGA 2018), Grenoble, France, November 2018.

[8] Sequential Metric Dimension. 9th Workshop on GRAph Searching, Theory & Applications (GRASTA 2018), Berlin, Germany, September 2018.

[7] Sequential Metric Dimension. 16th Workshop on Approximation and Online Algorithms  (WAOA 2018), Helsinki, Finland, August 2018.

[6] Sequential Metric Dimension. 10th International Colloquium on Graph Theory and Combinatorics (ICGT 2018), Lyon, France, July 2018.

[5] Localiser une cible dans un graphe. 20es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel 2018), Roscoff, France, May 2018.

[4] Spy Game on Graphs. Games and Graphs Workshop (GAG), Lyon, France, October 2017.

[3] Spy Game on Graphs. 6th Graph Searching in Canada Workshop (GRASCan 2017), Corner Brook, Canada, August 2017.

[2] Enquêter dans les graphes. 19es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel 2017), Quiberon, France, June 2017.

[1] Introduction to Designs and Steiner Triple Systems. 17èmes Journées Combinatoires et Algorithmes du Littoral Méditerranéen (JCALM17), Sophia-Antipolis, France, May 2017.

[11] The Complexity of Optimizing Atomic Congestion. NEO Seminar, Inria Sophia Antipolis, France, January 2024

[10] Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth and Vertex Cover. LIMDA Seminar, Universitat Politècnica de Catalunya, Barcelona, Spain, November 2023.

[9] Eternal Domination in D-Dimensional Grids. Séminaire de l'équipe COATI, Inria Sophia Antipolis, France, June 2021.

[8] Sequential Metric Dimension. Séminaire Graphes@Lyon, LIRIS, Lyon, France, May 2019.

[7] Sequential Metric Dimension and Oriented Metric Dimension. Séminaire de l'équipe ACRO, LIS, Marseille, France, March 2019.

[6] The Orthogonal Colouring Game. Séminaire de l'équipe COATI, Inria Sophia Antipolis, France, March 2019.

[5] Sequential Metric Dimension. Séminaire de l'équipe COATI, Inria Sophia Antipolis, France, October 2018.

[4] Spy Game on Graphs. Seminario del Doctorado en Ingeniería de Sistemas Complejos, Universidad Adolfo Ibáñez, Santiago, Chile, November 2017.

[3] The Game of Cops and Robbers on Graphs. The PhD Seminars of Inria Sophia Antipolis - Méditerranée, Inria Sophia Antipolis, France, November 2017.

[2] Spy Game on Graphs. Séminaire de l'équipe COATI, Inria Sophia Antipolis, France, June 2017.

[1] Wall Cops and Robbers. Séminaire de l'équipe COATI, Inria Sophia Antipolis, France, November 2016.