Note: The slides of the following talks can be reached by clicking the title.

  • Conference and workshop talks:

    • Introducing and Extracting Irregularity in Graphs (invited talk). Journées Graphes et Algorithmes 2024 (JGA'24), Dijon, France. November 2024.
    • An introduction to the 1-2-3 Conjecture (and related problems) (invited talk). 42èmes Journées Franciliennes de Recherche Opérationnelle (JFRO), online. September 2021.
    • Sequential Metric Dimension (in trees). Meeting of IFCAM project, Indian Statistical Institute, Kolkata, India. February 2019.
    • Sequential Metric Dimension (in trees). Graph Theory 2018 (GT'18), Nyborg, Denmark. August 2018.
    • Augmenting matchings in trees, via bounded-length augmentations. 3rd International Symposium on the Frontier of Graph Theory, Qinghai Normal University, Xining, China. April 2018.
    • Augmenting matchings in trees, via bounded-length augmentations. Sixième rencontre de l'ANR STINT, Saint-Maurice-en-Valgodemard, France. July 2017.
    • The Barát-Thomassen Conjecture. 17èmes Journées Combinatoires et Algorithmes du Littoral Méditerranéen (JCALM17), I3S/INRIA, Sophia-Antipolis, France. May 2017.
    • On a directed variation of the 1-2-3 and 1-2 Conjectures. Journées Graphes et Algorithmes 2015 (JGA'15), Orléans, France. November 2015.
    • Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture. Graph Theory 2015 (GT'15), Nyborg, Denmark. August 2015.
    • Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture. Troisième rencontre de l'ANR STINT, Autrans, France. July 2015.
    • Strong edge-colouring of planar and bipartite graphs (invited talk). Journées nationales du GDR IM, LaBRI, University of Bordeaux, France. February 2015.
    • Decomposing graphs into locally irregular subraphs: allowing K2's helps a lot. Bordeaux Graph Workshop 2014 (BGW'14), Bordeaux, France. November 2014.
    • Strong edge-colouring of sparse planar graphs. 9th International Colloquium on Graph Theory and Combinatorics (ICGT'14), Grenoble, France. June 2014.
    • On the complexity of turning a graph into the analogue of a clique. 9th International Colloquium on Graph Theory and Combinatorics (ICGT'14), Grenoble, France. June 2014.
    • Une version orientée de la 1-2-3 Conjecture. Journées Graphes et Algorithmes 2013 (JGA'13), Paris-Sud University, Orsay, France. November 2013.
    • Coloration localement irrégulière des arêtes d'un graphe. École du GDR IM, Via Domitia University, Perpignan, France. April 2013.
    • Complexité de partitionner un graphe en quelques sous-graphes connexes. Journées Graphes et Algorithmes 2012 (JGA'12), Blaise Pascal University, Clermont-Ferrand, France. November 2012.
    • On the size of graphs that can be partitioned under a given number of prescriptions. 4th Polish Combinatorial Conference (4PCC), Bedlewo, Poland. September 2012.
    • Partition arbitraire et préaffectation de sommets. Journées Graphes et Algorithmes 2011 (JGA'11), Claude Bernard University, Lyon, France. November 2011.

  • Seminar talks:

    • On the hardness of determining the irregularity strength of graphs. GT Graphes et Optimisation, LaBRI, University of Bordeaux, France. November 2023.
    • Recovering disrupted airline operations through matching augmentations. GT Algorithmique Distribuée, LaBRI, University of Bordeaux, France. April 2023.
    • A proof of the Multiplicative 1-2-3 Conjecture. GT Graphes et Optimisation, LaBRI, University of Bordeaux, France. September 2021.
    • On the "quest" towards a directed variant of the 1-2-3 Conjecture. GT Graphes et Optimisation, LaBRI, University of Bordeaux, France. February 2020.
    • On the "quest" towards a directed variant of the 1-2-3 Conjecture. Seminar of the Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an, China. October 2019.
    • On the "quest" towards a directed variant of the 1-2-3 Conjecture. Seminar of the School of Mathematics and Statistics, Xidian University, Xi'an, China. September 2019.
    • On partitioning graphs into connected subgraphs. Seminar of the Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an, China. September 2019.
    • A Decompositional Approach to the 1-2-3 Conjecture. Seminar of the Departamento de Matemática, Universidade Federal do Ceará, Fortaleza, Brazil. May 2019.
    • Sequential Metric Dimension (in trees). GT Graphes et Optimisation, LaBRI, University of Bordeaux, France. December 2018.
    • Sequential Metric Dimension (in trees). Seminarium Matematyka Dyskretna, AGH university, Kraków, Poland. November 2018.
    • A Decompositional Approach to the 1-2-3 Conjecture. Seminar of the Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an, China. May 2018.
    • On partitioning graphs into connected subgraphs. Seminar of the School of Mathematical Sciences, Anhui University, Hefei, China. May 2018.
    • On augmenting matchings via bounded-length augmentations. Séminaire de l'équipe COATI, I3S/INRIA, Sophia-Antipolis, France. October 2017.
    • On augmenting matchings via bounded-length augmentations. GT Graphes et Optimisation, LaBRI, University of Bordeaux, France. April 2017.
    • On partitioning graphs into connected subgraphs. Séminaire de l'équipe COATI, I3S/INRIA, Sophia-Antipolis, France. April 2017.
    • Decomposing graphs into 328 locally irregular graphs. Séminaire de l'équipe ACRO, LIF, Marseille, France. October 2016.
    • Decomposing graphs into 328 locally irregular graphs. GT Graphes et Optimisation, LaBRI, University of Bordeaux, France. October 2016.
    • 1-2-3 Conjecture & Variations. Seminar of the AlgoLoG team, DTU Compute, Lyngby, Denmark. November 2015.
    • Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture. GT Graphes et Applications, LaBRI, University of Bordeaux, France. July 2015.
    • Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture. Seminar of the AlgoLoG team, DTU Compute, Lyngby, Denmark. June 2015.
    • Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture. Seminarium Matematyka Dyskretna, AGH university, Kraków, Poland. April 2015.
    • Strong edge-coloring of (3, Δ)-bipartite graphs. Séminaire de l'équipe AlGCo, LIRMM, Montpellier, France. March 2015.
    • The 1-2-3 Conjecture: 10 years after. Séminaire de l'équipe MC2, LIP, Lyon, France. February 2015.
    • Strong edge-coloring of (3, Δ)-bipartite graphs. GT Graphes et Applications, LaBRI, University of Bordeaux, France. February 2015.
    • The 1-2-3 Conjecture: 10 years after. Séminaire de l'équipe ACRO, LIF, Marseille, France. January 2015.
    • Strong edge-coloring of (3, Δ)-bipartite graphs. Séminaire de l'équipe GOAL, LIRIS, Lyon, France. December 2014.
    • Decomposing oriented graphs into six locally irregular subgraphs. GT Graphes et Applications, LaBRI, University of Bordeaux, France. December 2013.
    • The complexity of finding orientations with fixed weak diameter. GT Graphes et Applications, LaBRI, University of Bordeaux, France. June 2013.
    • Coloration localement irrégulière des arêtes d'un graphe. GT Graphes et Applications, LaBRI, University of Bordeaux, France. March 2013.
    • Computational complexity of partitioning a graph into a few connected subgraphs. GT Graphes et Applications, LaBRI, University of Bordeaux, France. November 2012.
    • Computational complexity of partitioning a graph into connected subgraphs. Seminarium Matematyka Dyskretna, AGH university, Kraków, Poland. October 2012.
    • Partitioning Harary graphs into connected subgraphs containing prescribed vertices. GT Graphes et Applications, LaBRI, University of Bordeaux, France. June 2012.
    • Imposing vertex-part restrictions while arbitrarily partitioning a graph. Seminarium Matematyka Dyskretna, AGH university, Kraków, Poland. November 2011.
    • Partition arbitraire et préaffectation de sommets. GT Graphes et Applications, LaBRI, University of Bordeaux, France. October 2011.
    • Préaffectation de sommets dans les graphes arbitrairement partitionnables. LaBRI, University of Bordeaux, France. June 2011.

  • Defenses:

    • A contribution to distinguishing labellings of graphs. Habilitation defence, online, Université Côte d'Azur, France. December 2020.
    • Partitions and decompositions of graphs. Ph.D. defence, LaBRI, University of Bordeaux, France. June 2014.
    • Préaffectation de sommets dans les graphes arbitrairement partitionnables. Master defence, LaBRI, University of Bordeaux, France. June 2011.