Lucas Picasarri-Arrieta

PhD Student

lucas.picasarri-arrieta@inria.fr
Bat. Lagrange, Office L010C,
Inria Sophia Antipolis Méditerranée,
2004 route des Lucioles,
06902 Sophia Antipolis, France

---

Bio

As of October 2021, I'm a PhD Student in Computer Science at Université Côte D'Azur in the COATI team which is a joint project-team between Inria Sophia Antipolis - Méditerranée and the I3S laboratory, under the supervision of Frédéric Havet and Stéphane Bessy.
My main interests lie in theoretical Computer Science and Discrete Mathematics. I am currently working in the field of Graph Theory, especially in directed graphs.

---

Research activities

International Journals

Submitted

• Minimum number of arcs in k-critical digraphs with order at most 2k−1
  L. Picasarri-Arrieta, M. Stiebitz, 2023.
• Constrained Flows in Networks
  S. Bessy, J. Bang-Jensen, L. Picasarri-Arrieta, 2023.
• Dichromatic number of chordal graphs
  S. Bessy, F. Havet, L. Picasarri-Arrieta, 2023.
• Redicolouring digraphs: directed treewidth and cycle-degeneracy
  N. Nisse, L. Picasarri-Arrieta, I. Sau, 2023.
• On the minimum number of arcs in 4-dicritical oriented graphs
  F. Havet, L. Picasarri-Arrieta, C. Rambaud, 2023.

Accepted

• Strengthening the Directed Brooks' Theorem for oriented graphs and consequences on digraph redicolouring
  L. Picasarri-Arrieta, Journal of Graph Theory, 2023.

Published

• Digraph redicolouring
  N. Bousquet, F. Havet, N. Nisse, L. Picasarri-Arrieta, A. Reinald, European Journal of Combinatorics, 2023, available on ArXiv.
• Unbalanced spanning subgraphs in edge labeled complete graphs
  S. Bessy, J. Pardey, L. Picasarri-Arrieta, D. Rautenbach, Electronic Journal of Combinatorics, 2023, available on ArXiv.
• Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound
  S. Bessy, J. Pardey, L. Picasarri-Arrieta, D. Rautenbach, Electronic Journal of Combinatorics, 2022, available on ArXiv.
• Complexity of some arc-partition problems for digraphs
  J. Bang-Jensen, S. Bessy, D. Gonçalves, L. Picasarri-Arrieta, Theoretical Computer Science, 2022, available on HAL.

International Conferences

• Strengthening the Directed Brooks' Theorem for oriented graphs and consequences on digraph redicolouring
  L. Picasarri-Arrieta, Eurocomb'23.
• On the minimum number of arcs in 4-dicritical oriented graphs
  F. Havet, L. Picasarri-Arrieta, C. Rambaud, WG'23.

Talks

• Recolouring digraphs of bounded cycle-degeneracy
  For the Third Workshop Complexity and Algorithm (CoA) in Paris.
• On the minimum number of arcs in 4-dicritical oriented graphs
  For the Fifth ANR Digraph Meeting in Sète.
• Recolouring digraphs with bounded maximum degree
  For the GT Graphes et Optimisation in Bordeaux.
  For the Fourth ANR Digraph Meeting in Lyon.
• Digraph Redicolouring
  For the Journées Graphes et Algorithmes (JGA) 2022 in Paris.
  For the COATI seminar in Sophia-Antipolis.
• Complexity of some arc-partition problems for digraphs
  For the Journées Graphes et Algorithmes (JGA) 2021 in Montpellier.
  For the COATI seminar in Sophia-Antipolis.

---

Teaching

• Introduction aux services réseaux
  IUT Université Côte D'Azur, 2024.
• Communication et fonctionnement bas niveau
  IUT Université Côte D'Azur, 2024.
• Méthodes d'optimisation pour l'aide à la décision
  IUT Université Côte D'Azur, 2024.
• Automates et langages
  IUT Université Côte D'Azur, 2023.
• Introduction à la programmation
  IUT Université Côte D'Azur, 2023.
• Qualité de développement,
  IUT Université Côte D'Azur, 2022.
• Bases de données avancé,
  IUT Université Côte D'Azur, 2022.