( en | de | ru )

 

Disambiguation of "Walen, Tomasz"

Author of the publication

copydeleteadd this publication to your clipboard
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set.

, and . Electron. J. Comb., (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.

Tomasz Kupka

Ascheablagerungsprobleme bei der Mitverbrennung von alternativen Brennstoffen in Steinkohlekraftwerken. TU Clausthal-Zellerfeld, (2009)

Tomasz Wocjan

Dynamics of DNA in nucleosomes and plasmids studied by Brownian dynamics. Uni Heidelberg, (2009)

Kurt Walenta

Kurt Walenta

Willy Walensky

 

Other publications of authors with the same name

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)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)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)String Periods in the Order-Preserving Model., , , , , and . STACS, volume 96 of LIPIcs, page 38:1-38:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)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)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)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)Quasi-Linear-Time Algorithm for Longest Common Circular Factor., , , , , , , , and . CPM, volume 128 of LIPIcs, page 25:1-25:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)