Restricting the search space to boost Quantum Annealing performance. - Pierre Bergé; Baptiste Cavarec; Arpad Rimmel; Joanna Tomasik (CEC, 2016)

Search Space Exploration and an Optimization Criterion for Hard Design Problems. - Pierre Bergé; Kaourintin Le Guiban; Arpad Rimmel; Joanna Tomasik (GECCO (Companion), 2016)

On Simulated Annealing Dedicated to Maximin Latin Hypercube Designs. - Pierre Bergé; Kaourintin Le Guiban; Arpad Rimmel; Joanna Tomasik (CoRR, 2016)

On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem. - Pierre Bergé; Julien Hemery; Arpad Rimmel; Joanna Tomasik (COCOA, 2018)

The Competitiveness of Randomized Strategies for Canadians via Systems of Linear Inequalities. - Pierre Bergé; Julien Hemery; Arpad Rimmel; Joanna Tomasik (ISCIS, 2018)

A lower bound for weak Schur numbers with a deterministic algorithm. - Ghada Ben Hassine; Pierre Bergé; Arpad Rimmel; Joanna Tomasik (J. Discrete Algorithms, 2018)

Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s, t)-Cuts. - Pierre Bergé; Lou Salaün (WAOA, 2019)

Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts. - Pierre Bergé; Benjamin Mouscadet; Arpad Rimmel; Joanna Tomasik (WG, 2019)

Multiple Canadians on the road: minimizing the distance competitive ratio. - Pierre Bergé; Jean Desmarchelier; Wen Guo; Aurélie Lefebvre; Arpad Rimmel; Joanna Tomasik (J. Comb. Optim., 2019)

On the parameterized complexity of separating certain sources from the target. - Pierre Bergé; Arpad Rimmel; Joanna Tomasik (Theor. Comput. Sci., 2019)

A guide book for the traveller on graphs full of blockages. (Algorithmes pour voyager sur un graphe contenant des blocages). - Pierre Bergé (2019)

The Authorization Policy Existence Problem. - Pierre Bergé; Jason Crampton; Gregory Z. Gutin; Rémi Watrigant (IEEE Trans. Dependable Secur. Comput., 2020)

Diameter in linear time for constant-dimension median graphs. - Pierre Bergé; Michel Habib (LAGOS, 2021)

Diameter, radius and all eccentricities in linear time for constant-dimension median graphs. - Pierre Bergé; Michel Habib (CoRR, 2021)

Deciding Twin-Width at Most 4 Is NP-Complete. - Pierre Bergé; Édouard Bonnet; Hugues Déprés (ICALP, 2022)

Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. - Pierre Bergé; Édouard Bonnet; Hugues Déprés; Rémi Watrigant (STACS, 2023)

The influence of maximum (s, t)-cuts on the competitiveness of deterministic strategies for the Canadian Traveller Problem. - Pierre Bergé; Lou Salaün (Theor. Comput. Sci., 2023)

On the Parameterized Complexity of Counting Small-Sized Minimum ( boldsymbol{(S,T)} )-Cuts. - Pierre Bergé; Wassim Bouaziz; Arpad Rimmel; Joanna Tomasik (SIAM J. Discret. Math., 2023)

Approximation Algorithm for Job Scheduling with Reconfigurable Resources. - Pierre Bergé; Mari Chaikovskaia; Jean-Philippe Gayon; Alain Quilliot (ISCO, 2024)

The Canadian Traveller Problem on Outerplanar Graphs. - Laurent Beaudou; Pierre Bergé; Vsevolod Chernyshev; Antoine Dailly; Yan Gerard; Aurélie Lagoutte; Vincent Limouzy; Lucas Pastor (MFCS, 2024)

Approximation algorithms for Job Scheduling with reconfigurable resources. - Pierre Bergé; Mari Chaikovskaia; Jean-Philippe Gayon; Alain Quilliot (CoRR, 2024)

Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs. - Pierre Bergé; Guillaume Ducoffe; Michel Habib (Theory Comput. Syst., 2024)

1-Extendability of Independent Sets. - Pierre Bergé; Anthony Busson; Carl Feghali; Rémi Watrigant (Algorithmica, 2024)

Quasilinear-time eccentricities computation, and more, on median graphs. - Pierre Bergé; Guillaume Ducoffe; Michel Habib (SODA, 2025)