• 
  Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, et al.. PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters. 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, Sep 2021, Lisbonne, Portugal. pp.29:1-29:4, ⟨10.4230/LIPIcs.IPEC.2021.29⟩. ⟨hal-03671173⟩
• 
  Valentin Bartier. Combinatorial and Algorithmic aspects of Reconfiguration. Computational Complexity [cs.CC]. Université Grenoble Alpes [2020-..], 2021. English. ⟨NNT : 2021GRALM055⟩. ⟨tel-03643495⟩
• 
  Antoine Dailly, Elżbieta Sidorowicz. The neighbour sum distinguishing edge-weighting with local constraints. 2022. ⟨hal-03615738⟩
• 
  Louis Esperet, Matěj Stehlík. Bipartite complements of circle graphs. Discrete Mathematics, Elsevier, 2020, 343 (6), pp.111834. ⟨10.1016/j.disc.2020.111834⟩. ⟨hal-02321500⟩
• 
  Alexandre Le Jean, Olivier Briant, Nadia Brauner. Génération dynamique de couches pour la palettisation. 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France. ⟨hal-03595291⟩
• 
  Cléophée Robin. Hereditary classes of graphs : from structure to coloring. Computational Complexity [cs.CC]. Université Grenoble Alpes [2020-..], 2021. English. ⟨NNT : 2021GRALM041⟩. ⟨tel-03587403⟩
• 
  Florian Hoersch. Connectivity problems in graph theory : structures, algorithms and complexity. Computer Arithmetic. Université Grenoble Alpes [2020-..], 2021. English. ⟨NNT : 2021GRALM033⟩. ⟨tel-03559972⟩
• 
  Guillaume Bonfante, Alexandre Talon. At the bottom of binary analysis: instructions. 14th International Symposium on Foundations & Practice of Security, Dec 2021, Paris, France. ⟨hal-03557004⟩
• 
  Anne-Claire Chêne, Eléonore Pigalle, Julie Perrin, Laetitia Challe, Souleymane Mbaye, et al.. Opportunités et risques liés au développement du télétravail en Île-de-France, une approche interdisciplinaire. Future Days, Nov 2021, Marne-la-Vallée, France. ⟨halshs-03375018v2⟩
• 
  Myriam Preissmann, Paul-Elliot Angles d'Auriac, Francis Maisonneuve, Vivien Maisonneuve, Emmanuel Preissmann. On more variants of the Majority Problem. Discrete Applied Mathematics, Elsevier, 2019, 265, pp.1-12. ⟨10.1016/j.dam.2019.03.030⟩. ⟨hal-02148478⟩
• 
  Boadu Mensah Sarpong, Christian Artigues, Nicolas Jozefowiez. Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems. RAIRO - Operations Research, EDP Sciences, 2015, 49 (3), pp.527 - 554. ⟨10.1051/ro/2014054⟩. ⟨hal-01875890⟩
• 
  Guillaume Bagan, Valentin Gledel, Marc Heinrich, Fionn Mc Inerney. Weighted Total Acquisition. Discrete Applied Mathematics, Elsevier, 2021, 304, pp.260-282. ⟨10.1016/j.dam.2021.07.040⟩. ⟨hal-02880093v2⟩
• 
  Camille Gras, Van-Dat Cung, Nathalie Herr, Alantha Newman, Nicolas Teypaz. Long-haul Parcel Transportation on a Hierarchical Network. ROADEF 2021 - 22ème congrès annuel de la Société française de recherche opérationnelle et d’aide à la décision, Apr 2021, Mulhouse (en ligne), France. ⟨hal-03235584⟩
• 
  Marwane Bouznif, Rodolphe Giroudeau. Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks. Advances in Operations Research, Hindawi Publishing Corporation, 2011, 2011, pp.#476939. ⟨10.1155/2011/476939⟩. ⟨lirmm-00605652⟩
• 
  Arash Haddadan, Alantha Newman. Towards Improving Christofides Algorithm for Half-Integer TSP. ESA 2019 - European Symposium on Algorithms, Sep 2019, Munich, Germany. ⟨10.4230/LIPIcs.ESA.2019.56⟩. ⟨hal-03101770⟩
• 
  Alantha Newman. An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs (Journal Version). SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2020, 34 (1), pp.865-884. ⟨10.1137/19M1259353⟩. ⟨hal-03049522⟩
• 
  Arash Haddadan, Alantha Newman. Towards Improving Christofides Algorithm on Fundamental Classes by Gluing Convex Combinations of Tours (Journal Version). 2021. ⟨hal-03101691⟩
• 
  Maria Chudnovsky, Irene Lo, Frédéric Maffray, Nicolas Trotignon, Kristina Vušković. Coloring square-free Berge graphs. Journal of Combinatorial Theory, Series B, Elsevier, 2019, 135, pp.96-128. ⟨10.1016/j.jctb.2018.07.010⟩. ⟨hal-01993462⟩
• 
  Louis Esperet, Nicolas Trotignon. Coloring graphs with no induced subdivision of $K_4^+$. 2021. ⟨hal-03092640⟩
• 
  Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos. Edge degeneracy: Algorithmic and structural results. Theoretical Computer Science, Elsevier, 2020, 839, pp.164-175. ⟨10.1016/j.tcs.2020.06.006⟩. ⟨hal-03001062⟩

124

409