( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Short length menger's theorem and reliable optical routing.

, , и . SPAA, стр. 246-247. ACM, (2003)

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.

Andreas Petr

Petr Rudenko

Petr Obrdlik

Petr Hyspecký

Petr Danecek

 

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

Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set., и . Electron. J. Comb., (2007)Approximating Reversal Distance for Strings with Bounded Number of Duplicates.. MFCS, том 3618 из Lecture Notes in Computer Science, стр. 580-590. Springer, (2005)Extension Complexity, MSO Logic, and Treewidth., , и . Discret. Math. Theor. Comput. Sci., (2020)A note on the greedy algorithm for the unsplittable flow problem.. Inf. Process. Lett., 88 (3): 101-105 (2003)How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut., и . APPROX-RANDOM, том 176 из LIPIcs, стр. 41:1-41:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Greedy Algorithm for the Minimum Common String Partition Problem., , и . APPROX-RANDOM, том 3122 из Lecture Notes in Computer Science, стр. 84-95. Springer, (2004)Extension Complexity, MSO Logic, and Treewidth ., , и . SWAT, том 53 из LIPIcs, стр. 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set., и . WAOA, том 4368 из Lecture Notes in Computer Science, стр. 279-289. Springer, (2006)PRAM Lower Bound for Element Distinctness Revisited.. SOFSEM, том 1338 из Lecture Notes in Computer Science, стр. 448-455. Springer, (1997)On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow., , и . WADS, том 11646 из Lecture Notes in Computer Science, стр. 14-27. Springer, (2019)