Author of the publication

Constructing Strings Avoiding Forbidden Substrings.

, , , , and . CPM, volume 191 of LIPIcs, page 9:1-9:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

On Breaking Truss-Based Communities., , , , , and . KDD, page 117-126. ACM, (2021)On Breaking Truss-based and Core-based Communities., , , , , and . ACM Trans. Knowl. Discov. Data, 18 (6): 135:1-135:43 (July 2024)Hide and Mine in Strings: Hardness, Algorithms, and Experiments., , , , , , , , , and . IEEE Trans. Knowl. Data Eng., 35 (6): 5948-5963 (June 2023)String Sanitization Under Edit Distance., , , , , , and . CPM, volume 161 of LIPIcs, page 7:1-7:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)String Sanitization Under Edit Distance: Improved and Generalized., , , and . CoRR, (2020)Making de Bruijn Graphs Eulerian., , , , , and . CPM, volume 223 of LIPIcs, page 12:1-12:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)String Sanitization Under Edit Distance: Improved and Generalized., , , and . CPM, volume 191 of LIPIcs, page 19:1-19:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Combinatorial Algorithms for String Sanitization., , , , , , , , and . ACM Trans. Knowl. Discov. Data, 15 (1): 8:1-8:34 (2021)Elastic-Degenerate String Matching with 1 Error., , , , , and . LATIN, volume 13568 of Lecture Notes in Computer Science, page 20-37. Springer, (2022)Constructing Strings Avoiding Forbidden Substrings., , , , and . CPM, volume 191 of LIPIcs, page 9:1-9:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)