Pierre Bergé

37 papers A* 2A 2B 4C 4Journal 21Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Approximation algorithms for demand-based job scheduling with reconfigurable resources.
Discret. Appl. Math.
Pierre Bergé, Mari Chaikovskaia, Jean-Philippe Gayon, Alain Quilliot
2026 J jnl
Nemesis, an Escape Game in Graphs.
CoRR
Pierre Bergé, Antoine Dailly, Yan Gerard
2025 A* conf
Quasilinear-time eccentricities computation, and more, on median graphs.
SODA
Pierre Bergé, Guillaume Ducoffe, Michel Habib
2024 J jnl
1-Extendability of Independent Sets.
Algorithmica
Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant
2024 C conf
Approximation Algorithm for Job Scheduling with Reconfigurable Resources.
ISCO
Pierre Bergé, Mari Chaikovskaia, Jean-Philippe Gayon, Alain Quilliot
2024 J jnl
Approximation algorithms for Job Scheduling with reconfigurable resources.
CoRR
Pierre Bergé, Mari Chaikovskaia, Jean-Philippe Gayon, Alain Quilliot
2024 J jnl
Quasilinear-time eccentricities computation, and more, on median graphs.
CoRR
Pierre Bergé, Guillaume Ducoffe, Michel Habib
2024 J jnl
Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs.
Theory Comput. Syst.
Pierre Bergé, Guillaume Ducoffe, Michel Habib
2024 B conf
The Canadian Traveller Problem on Outerplanar Graphs.
MFCS
Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
2024 J jnl
The Canadian Traveller Problem on outerplanar graphs.
CoRR
Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
2023 A conf
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width.
STACS
Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant
2023 J jnl
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts.
SIAM J. Discret. Math.
Pierre Bergé, Wassim Bouaziz, Arpad Rimmel, Joanna Tomasik
2023 J jnl
The influence of maximum (
Theor. Comput. Sci.
Pierre Bergé, Lou Salaün
2022 C conf
1-Extendability of Independent Sets.
IWOCA
Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant
2022 J jnl
1-Extendability of independent sets.
CoRR
Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant
2022 J jnl
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width.
CoRR
Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant
2022 A* conf
Deciding Twin-Width at Most 4 Is NP-Complete.
ICALP
Pierre Bergé, Édouard Bonnet, Hugues Déprés
2022 A conf
Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs.
STACS
Pierre Bergé, Guillaume Ducoffe, Michel Habib
2021 J jnl
Deciding twin-width at most 4 is NP-complete.
CoRR
Pierre Bergé, Édouard Bonnet, Hugues Déprés
2021 C conf
Diameter in linear time for constant-dimension median graphs.
LAGOS
Pierre Bergé, Michel Habib
2021 J jnl
Diameter, radius and all eccentricities in linear time for constant-dimension median graphs.
CoRR
Pierre Bergé, Michel Habib
2021 J jnl
Subquadratic-time algorithm for the diameter and all eccentricities on median graphs.
CoRR
Pierre Bergé, Guillaume Ducoffe, Michel Habib
2020 J jnl
The Authorization Policy Existence Problem.
IEEE Trans. Dependable Secur. Comput.
Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2019 — —
A guide book for the traveller on graphs full of blockages. (Algorithmes pour voyager sur un graphe contenant des blocages).
Pierre Bergé
2019 B conf
Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts.
WG
Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik
2019 J jnl
Fixed-parameter tractability of counting small minimum (S, T)-cuts.
CoRR
Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik
2019 B conf
Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s, t)-Cuts.
WAOA
Pierre Bergé, Lou Salaün
2019 J jnl
Multiple Canadians on the road: minimizing the distance competitive ratio.
J. Comb. Optim.
Pierre Bergé, Jean Desmarchelier, Wen Guo, Aurélie Lefebvre, Arpad Rimmel, Joanna Tomasik
2019 J jnl
On the parameterized complexity of separating certain sources from the target.
Theor. Comput. Sci.
Pierre Bergé, Arpad Rimmel, Joanna Tomasik
2018 J jnl
A lower bound for weak Schur numbers with a deterministic algorithm.
J. Discrete Algorithms
Ghada Ben Hassine, Pierre Bergé, Arpad Rimmel, Joanna Tomasik
2018 C conf
On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem.
COCOA
Pierre Bergé, Julien Hemery, Arpad Rimmel, Joanna Tomasik
2018 — conf
The Competitiveness of Randomized Strategies for Canadians via Systems of Linear Inequalities.
ISCIS
Pierre Bergé, Julien Hemery, Arpad Rimmel, Joanna Tomasik
2017 — conf
The Authorization Policy Existence Problem.
CODASPY
Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2016 J jnl
On Simulated Annealing Dedicated to Maximin Latin Hypercube Designs.
CoRR
Pierre Bergé, Kaourintin Le Guiban, Arpad Rimmel, Joanna Tomasik
2016 B conf
Restricting the search space to boost Quantum Annealing performance.
CEC
Pierre Bergé, Baptiste Cavarec, Arpad Rimmel, Joanna Tomasik
2016 — conf
Search Space Exploration and an Optimization Criterion for Hard Design Problems.
GECCO (Companion)
Pierre Bergé, Kaourintin Le Guiban, Arpad Rimmel, Joanna Tomasik
2016 J jnl
The Authorization Policy Existence Problem.
CoRR
Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant