( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Subquadratic-time algorithm for the diameter and all eccentricities on median graphs.

, , и . CoRR, (2021)

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.

Louis-Pierre Bergé

Bernd Bergé

Nathalie Bergé

Stefaan Bergé

Meike Bergé-Hasmann

 

Другие публикации лиц с тем же именем

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