( en | de | ru )

 

Disambiguation of "Bergé, Pierre"

Author of the publication

copydeleteadd this publication to your clipboard
Search Space Exploration and an Optimization Criterion for Hard Design Problems.

, , , and . GECCO (Companion), page 43-44. ACM, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Louis-Pierre Bergé

Bernd Bergé

Nathalie Bergé

Stefaan Bergé

Meike Bergé-Hasmann

 

Other publications of authors with the same name

On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem., , , and . COCOA, volume 11346 of Lecture Notes in Computer Science, page 566-576. Springer, (2018)Restricting the search space to boost Quantum Annealing performance., , , and . CEC, page 3238-3245. IEEE, (2016)Approximation algorithms for Job Scheduling with reconfigurable resources., , , and . CoRR, (2024)A lower bound for weak Schur numbers with a deterministic algorithm., , , and . J. Discrete Algorithms, (2018)Multiple Canadians on the road: minimizing the distance competitive ratio., , , , , and . J. Comb. Optim., 38 (4): 1086-1100 (2019)On the Parameterized Complexity of Counting Small-Sized Minimum \((S,T)\)-Cuts., , , and . SIAM J. Discret. Math., 37 (2): 964-996 (June 2023)The influence of maximum (s, t)-cuts on the competitiveness of deterministic strategies for the Canadian Traveller Problem., and . Theor. Comput. Sci., (2023)1-Extendability of Independent Sets., , , and . Algorithmica, 86 (3): 757-781 (March 2024)Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width., , , and . CoRR, (2022)Deciding twin-width at most 4 is NP-complete., , and . CoRR, (2021)