Author of the publication

Approximating reversal distance for strings with bounded number of duplicates.

, and . Discret. Appl. Math., 155 (3): 327-336 (2007)

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

A Note on Efficient Computation of All Abelian Periods in a String, , , , , , , , and . CoRR, (2012)Efficient algorithms for shortest partial seeds in words., , , , and . Theor. Comput. Sci., (2018)Efficient Representation and Counting of Antipower Factors in Words., , , , , and . CoRR, (2018)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)Weighted Shortest Common Supersequence Problem Revisited., , , , , , , and . SPIRE, volume 11811 of Lecture Notes in Computer Science, page 221-238. Springer, (2019)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)Extracting powers and periods in a word from its runs structure., , , , , and . Theor. Comput. Sci., (2014)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)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)