( en | de | ru )

 

Disambiguation of "Kolman, Petr"

Author of the publication

copydeleteadd this publication to your clipboard
Short length menger's theorem and reliable optical routing.

, , and . SPAA, page 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. You can also use the button next to the name to display some publications already assigned to the person.

Andreas Petr

Petr Rudenko

Petr Obrdlik

Petr Hyspecký

Petr Bohata

 

Other publications of authors with the same name

Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set., and . Electron. J. Comb., (2007)Approximating Reversal Distance for Strings with Bounded Number of Duplicates.. MFCS, volume 3618 of Lecture Notes in Computer Science, page 580-590. Springer, (2005)On Algorithms Employing Treewidth for L-bounded Cut Problems.. J. Graph Algorithms Appl., 22 (2): 177-191 (2018)Short length Menger's theorem and reliable optical routing., , and . Theor. Comput. Sci., 339 (2-3): 315-332 (2005)Extension Complexity, MSO Logic, and Treewidth., , and . 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)Approximating reversal distance for strings with bounded number of duplicates., and . Discret. Appl. Math., 155 (3): 327-336 (2007)How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut., and . APPROX-RANDOM, volume 176 of LIPIcs, page 41:1-41:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set., and . WAOA, volume 4368 of Lecture Notes in Computer Science, page 279-289. Springer, (2006)On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow., , and . J. Graph Algorithms Appl., 24 (3): 303-322 (2020)