( en | de | ru )

 

Disambiguation of "Kolman, Petr"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating Reversal Distance for Strings with Bounded Number of Duplicates.

. MFCS, volume 3618 of Lecture Notes in Computer Science, page 580-590. Springer, (2005)

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.

Petr Bohata

Petr Danecek

Andreas Petr

Petr Rudenko

Petr Obrdlik

 

Other publications of authors with the same name

Approximating Reversal Distance for Strings with Bounded Number of Duplicates.. MFCS, volume 3618 of Lecture Notes in Computer Science, page 580-590. Springer, (2005)Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set., and . Electron. J. Comb., (2007)Approximating Spanning Tree Congestion on Graphs with Polylog Degree.. IWOCA, volume 14764 of Lecture Notes in Computer Science, page 497-508. Springer, (2024)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)Extension Complexity, MSO Logic, and Treewidth ., , and . SWAT, volume 53 of LIPIcs, page 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow., , and . WADS, volume 11646 of Lecture Notes in Computer Science, page 14-27. Springer, (2019)PRAM Lower Bound for Element Distinctness Revisited.. SOFSEM, volume 1338 of Lecture Notes in Computer Science, page 448-455. Springer, (1997)Extension Complexity, MSO Logic, and Treewidth., , and . Discret. Math. Theor. Comput. Sci., (2020)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)The Greedy Algorithm for the Minimum Common String Partition Problem., , and . APPROX-RANDOM, volume 3122 of Lecture Notes in Computer Science, page 84-95. Springer, (2004)