Pierre Bergé

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 32

Top Topics

Parameterized Complexity

Top Venues

Theor. Comput. Sci.

GECCO (Companion)

Publications

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