Author of the publication

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)

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.

 

Other publications of authors with the same name

Efficient Representation and Counting of Antipower Factors in Words., , , , , and . CoRR, (2018)Extracting powers and periods in a word from its runs structure., , , , , and . Theor. Comput. Sci., (2014)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)A note on efficient computation of all Abelian periods in a string., , , , , , , , and . Inf. Process. Lett., 113 (3): 74-77 (2013)Efficient Algorithms for Shortest Partial Seeds in Words., , , , and . CPM, volume 8486 of Lecture Notes in Computer Science, page 192-201. Springer, (2014)Unary Words Have the Smallest Levenshtein k-Neighbourhoods., , , , and . CPM, volume 161 of LIPIcs, page 10:1-10:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Number of Repetitions in 2D-Strings., , , , and . ESA, volume 173 of LIPIcs, page 32:1-32:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Rectangular Tile Covers of 2D-Strings., , , , and . CPM, volume 223 of LIPIcs, page 23:1-23:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)New Simple Efficient Algorithms Computing Powers and Runs in Strings., , , , , , and . Stringology, page 138-149. Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2010)Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word., , , and . Developments in Language Theory, volume 8633 of Lecture Notes in Computer Science, page 215-226. Springer, (2014)