Claire Hilaire

Current position

• Post-Doc
• Supervisor: Martin Milanič
• at Famnit, University of Primorska in Koper, Slovenia
• Started in October 2023

PhD

• Title: Structure of Graphs: Minors and Induced Trees
• Manuscript accessible here
• PhD Supervisors: Cyril Gavoille and Marthe Bonamy
• Laboratoire Bordelais de Recherche en Informatique (UMR 5800) (LaBRI)
• Started in October 2020, defended on July 4th 2023

Papers

• Path eccentricity of k-AT-free graphs and application on graphs with the consecutive ones property
  P. Bastide, C. H., E. Robinson
  Discrete Mathematics 2025 (also on arXiv:2403.05360).
• Sufficient conditions for polynomial-time detection of induced minors
  C. Dallard, M: Dumas, C. H., A. Perez
  SOFSEM 2025 (accessible on arXiv:2501.00161).
• On the proper interval completion problem within some chordal subclasses
  F. Dross, C. H., I. Koch, V. Leoni, N. Pardal, M. Pujato, V. Fernandes dos Santos
  Discrete Mathematics 2025 (also on arXiv:2110.07706).
• Detecting K_2,3 as an induced minor
  C. Dallard, M. Dumas, C. H., M. Milanič, A. Perez, N. Trotignon
  IWOCA 2024 (accessible on arXiv:2402.08332).
• Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
  M. Bonamy, É. Bonnet, H. Déprés, L. Esperet, C. Geniet, C. H., S. Thomassé, A. Wesolek
  Journal of Combinatorial Theory Series B (JCTB) 2024.
• On tree decompositions whose trees are minors
  P. Blanco, L. Cook, M. Hatzel, C. H., F. Illingworth, R. McCarty
  Journal of Graph Theory 2024 (also on arXiv:2302.12106).
• Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
  M. Bonamy, É Bonnet, H. Déprés, L. Esperet, C. Geniet, C. H., S. Thomassé, A. Wesolek
  SODA 2023 (also on arXiv:2206.00594).
• Long induced paths in minor-closed graph classes and beyond
  C. H., J.-F. Raymond
  Electronic Journal of Combinatorics 2023 (also on arXiv:2201.03880).

Preprints

• Path Eccentricity and Forbidden Induced Subgraphs
  S. Cichacz, C. H., T. Masařík, J. Masaříková, M. Milanič
  on arXiv:2503.15747 (accepted in Eurocomb'25).
• Faithful universal graphs for minor-closed classes
  P. Bastide, L. Esperet, C. Groenland, C. H., C. Rambaud, A. Wesolek
  on arXiv:2504.19582.
• Linear colorings of graphs
  C. H., M. Krnc, M. Milanič, J.-F. Raymond
  on arXiv:2505.02768.
• Induced Minor Models. I. Structural Properties and Algorithmic Consequences
  N. Bousquet, C. Dallard, M. Dumas, C. H., M. Milanič, A. Perez, N. Trotignon
  on arXiv:2402.08332.
• Treewidth versus clique number: induced minors
  C. H., M. Milanič, N. Trotignon, Dj. Vasić
  on arXiv:2410.17979.
• Minor-Universal Graph for Graphs on Surfaces
  C. Gavoille, C. H.
  on arXiv:2305.06673.

Talks

• Journées Graphes et Algorithmes (JGA 2024) (Dijon, France, November 2024)
  Un graphe pour les gouverner tous
• Graph Classes, Optimization, and Width Parameters (GROW 2024) (Cottbus, Germany, September 2024)
  Structure of graphs with no independent cycles
• Seminar of University of Maths of Graz (Graz, Austria, December 19th 2023)
  Minor-universal graph for graphs on surfaces
• Journées Graphes et Algorithmes (JGA 2023) (Lyon, France, November 22nd 2023)
  Graphes mineur-universels pour les graphes plongés sur des surfaces
• Seminar of Famnit (Koper, Slovenia, October 2nd 2023)
  Minor-universal graph for graphs on surfaces
• 10th Slovenian Conference on Graph Theory (SICGT 2023) (Kranjska Gora, Slovenia, June 18th-24th 2023)
  Minor-universal graph for graphs on surfaces
• Drafting Workshop in Discrete Mathematics and Probability 2023 (Budapest, Hungary, February 6th-8th 2023)
  Structure of graphs with no independent cycles
• Journées de combinatoire de Bordeaux (JCB 2023) (Bordeaux, France, January 30th-February 1st 2023)
  Minor-universal graph for bounded genus graphs (Invited talk)
• Second 2022 Barbados Graph Theory Workshop (Holetown, Barbados, December 9th-16th 2022)
  Structure of graphs with no independent cycles
• Seminar of Utrecht University (Utrecht, Netherlands, November 2022)
  Structure of graphs with no independent cycles
• Bordeaux graph seminar (Bordeaux, France, October 2022)
  Structure of graphs with no independent cycles
• Journées Graphes et Algorithmes (JGA 2022) (Paris, November 16th-18th 2022)
  Structure des graphes sans cycles indépendants
• 2nd Workshop Complexity and Algorithms (CoA 2022) (Paris, September 26th-28th septembre 2022)
  On the proper interval completion problem within some chordal subclasses
• ICGT 2022: 11th International Colloquium on Graph Theory and combinatorics (Montpellier, France, July 4th-8th 2022)
  Long induced paths in graphs with bounded treewidth
• Barbados Graph Theory Workshop 2022 (Holetown, Barbados, March 4th-11th 2022)
  Long induced paths in graphs with bounded treewidth
• Bordeaux graph seminar (Bordeaux, France, February 2021)
  Long induced paths in minor-closed graph classes and beyond
• Journées Graphes et Algorithmes (JGA 2021) (Online, November 15th-19th 2021)
  Grilles majeures de graphes déssinés
• Seminar of Limos (Clermont-Ferrand, France, September 2021)
  Grid Major of Graph Drawings
• AlGCo seminar (Montpellier, France, August 2021)
  Grid Major of Graph Drawings
• BCC 2021: 28th British Combinatorial Conference (Online, July 5th-9th 2021)
  Grid Major of Graph Drawings
• Journées Graphes et Algorithmes (JGA 2020) (Online, November 16th-18th 2020)
  Dessin et mineur de graphe

Teaching

• Computer Practicum for 1st year Bachelor students in maths (60h, L1, Famnit, Univ. of Primorska)

• TD Discrete Mathematics II for 2nd year Bachelor students in computer science and 1st year Bachelor students in maths (60h, L1,L2, Famnit, Univ. of Primorska)

• TP Applied Algorithms for Master 2 students in computer science (24h, M2, Univ. Bordeaux)
• Advanced graph theory, for master 2 students in computer science (2h, M2, Univ. Bordeaux)
• TP Réseaux for 2nd year Bachelor students in computer science (26h, L2, Univ. Bordeaux)

• TP Technique algorithmique et programmation for 3rd year Bachelor students in computer science (25h, L3, Univ. Bordeaux)
• TP Programmation C for 2nd year Bachelor students in computer science (32h, L2, Univ. Bordeaux)
• TP Compétences numériques, méthodologie et communication for 1st year Bachelor students (6h, L1, Univ. Bordeaux)

• TD Logique et preuve for 3rd year Bachelor students in computer science (32h, L3, Univ. Bordeaux)

Supervisions

Đorđe Vasić, Master thesis (1 year), with Martin Milanič
Subject: tree-independence and forbidden induced subgraph.

Louann Coste, 3rd year Bachelor internship (2 months), with Marthe Bonamy
Subject: Firefighter problem on planar graph.

Contacts

• University of Primorska Faculty of Mathematics, Natural Sciences and Information Technologies
• Glagoljaška 8, SI-6000 Koper, SLOVENIA
• Office phone: +386 (0) 5-611-76-59
• E-mail: claire.hilaire at upr.si