| 2026 | FUN | Nemesis, an Escape Game in Graphs. | Pierre Berg, Antoine Dailly, Yan Gerard |
| 2025 | SODA | Quasilinear-time eccentricities computation, and more, on median graphs. | Pierre Berg, Guillaume Ducoffe, Michel Habib |
| 2024 | MFCS | The Canadian Traveller Problem on Outerplanar Graphs. | Laurent Beaudou, Pierre Berg, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurlie Lagoutte, Vincent Limouzy, Lucas Pastor |
| 2023 | STACS | Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. | Pierre Berg, douard Bonnet, Hugues Dprs, Rmi Watrigant |
| 2022 | ICALP | Deciding Twin-Width at Most 4 Is NP-Complete. | Pierre Berg, douard Bonnet, Hugues Dprs |
| 2022 | IWOCA | 1-Extendability of Independent Sets. | Pierre Berg, Anthony Busson, Carl Feghali, Rmi Watrigant |
| 2022 | STACS | Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs. | Pierre Berg, Guillaume Ducoffe, Michel Habib |
| 2021 | LAGOS | Diameter in linear time for constant-dimension median graphs. | Pierre Berg, Michel Habib |
| 2019 | WAOA | Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s, t)-Cuts. | Pierre Berg, Lou Salan |
| 2019 | WG | Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts. | Pierre Berg, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik |
| 2018 | COCOA | On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem. | Pierre Berg, Julien Hemery, Arpad Rimmel, Joanna Tomasik |
| 2016 | CEC | Restricting the search space to boost Quantum Annealing performance. | Pierre Berg, Baptiste Cavarec, Arpad Rimmel, Joanna Tomasik |
| 2016 | GECCO | Search Space Exploration and an Optimization Criterion for Hard Design Problems. | Pierre Berg, Kaourintin Le Guiban, Arpad Rimmel, Joanna Tomasik |