| Deciding twin-width at most 4 is NP-complete P Bergé, É Bonnet, H Déprés arXiv preprint arXiv:2112.08953, 2021 | 42 | 2021 |
| The authorization policy existence problem P Bergé, J Crampton, G Gutin, R Watrigant Proceedings of the Seventh ACM on Conference on Data and Application …, 2017 | 16 | 2017 |
| On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem P Bergé, J Hemery, A Rimmel, J Tomasik International Conference on Combinatorial Optimization and Applications, 566-576, 2018 | 8 | 2018 |
| Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts P Bergé, B Mouscadet, A Rimmel, J Tomasik International Workshop on Graph-Theoretic Concepts in Computer Science, 79-92, 2019 | 6 | 2019 |
| Approximating highly inapproximable problems on graphs of bounded twin-width P Bergé, É Bonnet, H Déprés, R Watrigant arXiv preprint arXiv:2207.07708, 2022 | 5 | 2022 |
| Multiple Canadians on the road: minimizing the distance competitive ratio P Bergé, J Desmarchelier, W Guo, A Lefebvre, A Rimmel, J Tomasik Journal of Combinatorial Optimization 38 (4), 1086-1100, 2019 | 5 | 2019 |
| Detection and quantification of pulmonary embolism with artificial intelligence: The SFR 2022 artificial intelligence data challenge Y Belkouchi, M Lederlin, AB Afia, C Fabre, G Ferretti, C De Margerie, ... Diagnostic and Interventional Imaging 104 (10), 485-489, 2023 | 4 | 2023 |
| Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s, t)-Cuts P Bergé, L Salaün International Workshop on Approximation and Online Algorithms, 29-42, 2019 | 4 | 2019 |
| The competitiveness of randomized strategies for Canadians via systems of linear inequalities P Bergé, J Hemery, A Rimmel, J Tomasik International Symposium on Computer and Information Sciences, 96-103, 2018 | 3 | 2018 |
| Search space exploration and an optimization criterion for hard design problems P Bergé, K Le Guiban, A Rimmel, J Tomasik Proceedings of the 2016 on Genetic and Evolutionary Computation Conference …, 2016 | 3 | 2016 |
| On the parameterized complexity of separating certain sources from the target P Bergé, A Rimmel, J Tomasik Theoretical Computer Science 795, 183-193, 2019 | 2 | 2019 |
| Restricting the search space to boost Quantum Annealing performance P Bergé, B Cavarec, A Rimmel, J Tomasik 2016 IEEE Congress on Evolutionary Computation (CEC), 3238-3245, 2016 | 2 | 2016 |
| Detection and severity quantification of pulmonary embolism with 3D CT data using an automated deep learning-based artificial solution A Djahnine, C Lazarus, M Lederlin, S Mulé, R Wiemker, S Si-Mohamed, ... Diagnostic and Interventional Imaging 105 (3), 97-103, 2024 | 1 | 2024 |
| 1-extendability of independent sets P Bergé, A Busson, C Feghali, R Watrigant Algorithmica 86 (3), 757-781, 2024 | 1 | 2024 |
| Subquadratic-time algorithm for the diameter and all eccentricities on median graphs P Bergé, G Ducoffe, M Habib Theory of Computing Systems 68 (1), 144-193, 2024 | 1 | 2024 |
| The influence of maximum (s, t)-cuts on the competitiveness of deterministic strategies for the Canadian Traveller Problem P Bergé, L Salaün Theoretical Computer Science 941, 221-240, 2023 | 1 | 2023 |
| Diameter, radius and all eccentricities in linear time for constant-dimension median graphs P Bergé, M Habib arXiv preprint arXiv:2105.12150, 2021 | 1 | 2021 |
| Diameter in linear time for constant-dimension median graphs P Bergé, M Habib Procedia Computer Science 195, 97-107, 2021 | 1 | 2021 |
| The Canadian Traveller Problem on outerplanar graphs L Beaudou, P Bergé, V Chernyshev, A Dailly, Y Gerard, A Lagoutte, ... arXiv preprint arXiv:2403.01872, 2024 | | 2024 |
| Approximation algorithms for Job Scheduling with reconfigurable resources P Bergé, M Chaikovskaia, JP Gayon, A Quilliot arXiv preprint arXiv:2401.00419, 2023 | | 2023 |
Arpad RimmelCentraleSupelecVerified email at centralesupelec.fr
