Pierre Bergé
Orcid: 0000-0002-6170-9473
According to our database1,
Pierre Bergé
authored at least 24 papers
between 2016 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
6
3
2
1
1
2
1
1
1
2
1
1
1
2
2
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
2024
Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs.
Theory Comput. Syst., February, 2024
CoRR, 2024
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024
2023
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts.
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.
Theor. Comput. Sci., 2023
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023
2022
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.
CoRR, 2021
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
2020
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).
PhD thesis, 2019
Theor. Comput. Sci., 2019
J. Comb. Optim., 2019
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019
Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s, t)-Cuts.
Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019
2018
J. Discrete Algorithms, 2018
The Competitiveness of Randomized Strategies for Canadians via Systems of Linear Inequalities.
Proceedings of the Computer and Information Sciences - 32nd International Symposium, 2018
On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem.
Proceedings of the Combinatorial Optimization and Applications, 2018
2016
Proceedings of the Genetic and Evolutionary Computation Conference, 2016
Proceedings of the IEEE Congress on Evolutionary Computation, 2016