( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Exact algorithms for the repetition-bounded longest common subsequence problem.

, , , , , и . Theor. Comput. Sci., (2020)

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.

No persons found for author name Utashima, Tadatoshi
add a person with the name Utashima, Tadatoshi
 

Другие публикации лиц с тем же именем

Path Cover Problems with Length Cost., , , , , , и . Algorithmica, 85 (11): 3348-3375 (ноября 2023)Exact algorithms for the repetition-bounded longest common subsequence problem., , , , , и . Theor. Comput. Sci., (2020)Path Cover Problems with Length Cost., , , , , , и . WALCOM, том 13174 из Lecture Notes in Computer Science, стр. 396-408. Springer, (2022)Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants., , , , , и . CPM, том 223 из LIPIcs, стр. 15:1-15:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem., , , , , и . COCOA, том 11949 из Lecture Notes in Computer Science, стр. 1-12. Springer, (2019)