• 
  Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, et al.. The Canadian Traveller Problem on Outerplanar Graphs. Mathematical Foundations of Computer Science (MFCS), Aug 2024, Bratislava, Slovakia. pp.1-16, ⟨10.4230/LIPIcs.MFCS.2024.19⟩. ⟨hal-04818742⟩
• 
  Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, et al.. Twin-Width IV: Ordered Graphs and Matrices. Journal of the ACM (JACM), 2024, 71 (3), pp.1-45. ⟨10.1145/3651151⟩. ⟨hal-04659322⟩
• 
  Nicolas Bousquet, Louis Esperet, Laurent Feuilloley, Sébastien Zeitoun. Renaming in distributed certification. 2024. ⟨hal-04722289⟩
• 
  Romain Chapoullié, Zoltán Szigeti. On packing time-respecting arborescences. Discrete Optimization, 2022, 45, pp.100702. ⟨10.1016/j.disopt.2022.100702⟩. ⟨hal-03654954⟩
• 
  Louis Esperet, Benjamin Lévêque. Local certification of graphs on surfaces. Theoretical Computer Science, 2022, 909, pp.68-75. ⟨10.1016/j.tcs.2022.01.023⟩. ⟨hal-03135544⟩
• 
  Felix Klingelhoefer. Algorithms for Promise Coloring Problems on Tournaments and Graphs. Data Structures and Algorithms [cs.DS]. Université Grenoble Alpes [2020-..], 2023. English. ⟨NNT : 2023GRALM073⟩. ⟨tel-04612259⟩
• 
  Foivos Fioravantes, Harmender Gahlawat, Nikolaos Melissinos. A parameterized point of view on forming small coalitions. 2024. ⟨hal-04562753⟩
• 
  Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, Lucas Pastor. Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes. Discrete Applied Mathematics, 2024, 345, pp.34-51. ⟨10.1016/j.dam.2023.10.025⟩. ⟨hal-04058748⟩
• 
  Julien Guepet, Olivier Briant, Jean-Philippe Gayon, Rodrigo Acuna Agost. Integration of aircraft ground movements and runway operations. Transportation Research Part E: Logistics and Transportation Review, 2017, 104, pp.131-149. ⟨10.1016/j.tre.2017.05.002⟩. ⟨hal-01567740⟩
• 
  Jean-Philippe Gayon, Guillaume Massonnet, Christophe Rapine, Gautier Stauffer. Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales. European Journal of Operational Research, 2016, 250 (1), pp.155-163. ⟨10.1016/j.ejor.2015.10.054⟩. ⟨hal-01284347⟩
• 
  Julien Guépet, Rodrigo Acuna Agost, Olivier Briant, Jean-Philippe Gayon. Exact and heuristic approaches to the airport stand allocation problem. European Journal of Operational Research, 2015, 246 (2), pp.597-608. ⟨10.1016/j.ejor.2015.04.040⟩. ⟨hal-01204718⟩
• 
  Julien Guépet, Olivier Briant, Jean-Philippe Gayon, Rodrigo Acuna Agost. The aircraft ground routing problem: Analysis of industry punctuality indicators in a sustainable perspective. European Journal of Operational Research, 2016, 248 (3), pp.827-839. ⟨10.1016/j.ejor.2015.08.041⟩. ⟨hal-01236308⟩
• 
  Jean-Philippe Lucien Gayon, Guillaume Massonnet, Christophe Rapine, Gautier Stauffer. Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints. Mathematics of Operations Research, 2017, 42 (3), pp.854-875. ⟨10.1287/moor.2016.0830⟩. ⟨hal-01978078⟩
• 
  Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, et al.. The Canadian Traveller Problem on outerplanar graphs. LIMOS, Université Clermont Auvergne, CNRS, UMR 6158, France; G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production. 2024. ⟨hal-04523851⟩
• 
  Jérémie Chalopin, Victor Chepoi, Ugo Giocanti. Graphs with convex balls. Geometriae Dedicata, 2023, 217 (4), pp.67. ⟨10.1007/s10711-023-00803-0⟩. ⟨hal-03550018⟩
• 
  Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond. Local certification of geometric graph classes. 2024. ⟨hal-04313338⟩
• 
  Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, et al.. Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. Discrete Mathematics and Theoretical Computer Science, 2024, vol. 25:2 (Graph Theory), ⟨10.46298/dmtcs.8715⟩. ⟨hal-03406709⟩
• 
  Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau. Frozen colourings of bounded degree graphs. Electronic Notes in Discrete Mathematics, 2018, 68, pp.167--172. ⟨10.1016/j.endm.2018.06.029⟩. ⟨hal-02527067⟩
• 
  Nicolas Bousquet, Stéphane Bessy. Colorful paths for 3-chromatic graphs. Discrete Mathematics, 2017, 340 (5), pp.1000-1007. ⟨10.1016/j.disc.2017.01.016⟩. ⟨hal-01592548⟩
• 
  Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet. Distributed coloring in sparse graphs with fewer colors. The Electronic Journal of Combinatorics, 2019, 26 (4), ⟨10.37236/8395⟩. ⟨hal-02333202⟩

170

425