Author of the publication

A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem.

, , and . CPM, volume 78 of LIPIcs, page 10:1-10:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

Hyper-minimisation Made Efficient., and . MFCS, volume 5734 of Lecture Notes in Computer Science, page 356-368. Springer, (2009)Cut Query Algorithms with Star Contraction., , , , , and . FOCS, page 507-518. IEEE, (2022)Faster Exponential Algorithm for Permutation Pattern Matching., and . SOSA, page 279-284. SIAM, (2022)Alphabetic Minimax Trees in Linear Time.. CSR, volume 7913 of Lecture Notes in Computer Science, page 36-48. Springer, (2013)Euclidean TSP with Few Inner Points in Linear Space., and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 701-713. Springer, (2014)Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets., , , , and . Theory Comput. Syst., 62 (1): 162-191 (2018)Streaming Regular Expression Membership and Pattern Matching., , , and . SODA, page 670-694. SIAM, (2022)Matching Patterns with Variables Under Edit Distance., , and . SPIRE, volume 13617 of Lecture Notes in Computer Science, page 275-289. Springer, (2022)Fully dynamic approximation of LIS in polylogarithmic time., and . STOC, page 654-667. ACM, (2021)LZ77 Factorisation of Trees., and . FSTTCS, volume 65 of LIPIcs, page 35:1-35:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)