Pierre Bergé

According to our database, Pierre Bergé authored at least 22 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

1-Extendability of Independent Sets.

Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant

Algorithmica, March, 2024

Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs.

Pierre Bergé, Guillaume Ducoffe, Michel Habib

Theory Comput. Syst., February, 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

CoRR, 2024

Approximation algorithms for Job Scheduling with reconfigurable resources.

Pierre Bergé, Mari Chaikovskaia, Jean-Philippe Gayon, Alain Quilliot

CoRR, 2024

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., June, 2023

The influence of maximum (<i>s</i>, <i>t</i>)-cuts on the competitiveness of deterministic strategies for the Canadian Traveller Problem.

Pierre Bergé, Lou Salaün

Theor. Comput. Sci., 2023

Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width.

Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

Deciding Twin-Width at Most 4 Is NP-Complete.

Pierre Bergé, Édouard Bonnet, Hugues Déprés

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Diameter, radius and all eccentricities in linear time for constant-dimension median graphs.

Pierre Bergé, Michel Habib

CoRR, 2021

Diameter in linear time for constant-dimension median graphs.

Pierre Bergé, Michel Habib

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

The Authorization Policy Existence Problem.

Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant

IEEE Trans. Dependable Secur. Comput., 2020

2019

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

Pierre Bergé

PhD thesis, 2019

On the parameterized complexity of separating certain sources from the target.

Pierre Bergé, Arpad Rimmel, Joanna Tomasik

Theor. Comput. Sci., 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

Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts.

Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s, t)-Cuts.

Pierre Bergé, Lou Salaün

Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

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

The Competitiveness of Randomized Strategies for Canadians via Systems of Linear Inequalities.

Pierre Bergé, Julien Hemery, Arpad Rimmel, Joanna Tomasik

Proceedings of the Computer and Information Sciences - 32nd International Symposium, 2018

On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem.

Pierre Bergé, Julien Hemery, Arpad Rimmel, Joanna Tomasik

Proceedings of the Combinatorial Optimization and Applications, 2018

2016

On Simulated Annealing Dedicated to Maximin Latin Hypercube Designs.

Pierre Bergé, Kaourintin Le Guiban, Arpad Rimmel, Joanna Tomasik

CoRR, 2016

Search Space Exploration and an Optimization Criterion for Hard Design Problems.

Pierre Bergé, Kaourintin Le Guiban, Arpad Rimmel, Joanna Tomasik

Proceedings of the Genetic and Evolutionary Computation Conference, 2016

Restricting the search space to boost Quantum Annealing performance.

Pierre Bergé, Baptiste Cavarec, Arpad Rimmel, Joanna Tomasik

Proceedings of the IEEE Congress on Evolutionary Computation, 2016