Algorithms for Computing the Longest Parameterized Common Subsequence. - Costas S. Iliopoulos; Marcin Kubica 001; M. Sohel Rahman; Tomasz Walen (CPM, 2007)

Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set. - Petr Kolman; Tomasz Walen (Electron. J. Comb., 2007)

Approximating reversal distance for strings with bounded number of duplicates. - Petr Kolman; Tomasz Walen (Discret. Appl. Math., 2007)

RNA multiple structural alignment with longest common subsequences. - Sergey Bereg; Marcin Kubica 001; Tomasz Walen; Binhai Zhu (J. Comb. Optim., 2007)

Improved Algorithms for the Range Next Value Problem and Applications. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Mohammad Sohel Rahman; Tomasz Walen (STACS, 2008)

LPF Computation Revisited. - Maxime Crochemore; Lucian Ilie; Costas S. Iliopoulos; Marcin Kubica 001; Wojciech Rytter; Tomasz Walen (IWOCA, 2009)

On the Maximal Number of Cubic Subwords in a String. - Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (IWOCA, 2009)

On the maximal number of highly periodic runs in a string - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CoRR, 2009)

Algorithms for Three Versions of the Shortest Common Superstring Problem. - Maxime Crochemore; Marek Cygan; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CPM, 2010)

On the Maximal Sum of Exponents of Runsin a String. - Maxime Crochemore; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (IWOCA, 2010)

On the Maximal Number of Cubic Runs in a String. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (LATA, 2010)

Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Wojciech Rytter; Tomasz Walen (SOFSEM, 2010)

Extracting Powers and Periods in a String from Its Runs Structure. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SPIRE, 2010)

Improved induced matchings in sparse graphs. - Rok Erman; Lukasz Kowalik; Matjaz Krnc; Tomasz Walen (Discret. Appl. Math., 2010)

Finding Patterns In Given Intervals. - Maxime Crochemore; Marcin Kubica 001; Tomasz Walen; Costas S. Iliopoulos; M. Sohel Rahman (Fundam. Informaticae, 2010)

Efficient Seeds Computation Revisited. - Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Bartosz Szreder; Tomasz Walen (CPM, 2011)

Approximation of RNA multiple structural alignment. - Marcin Kubica 001; Romeo Rizzi; Stéphane Vialette; Tomasz Walen (J. Discrete Algorithms, 2011)

The Maximum Number of Squares in a Tree. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Wojciech Tyczynski; Tomasz Walen (CPM, 2012)

Efficient Data Structures for the Factor Periodicity Problem. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SPIRE, 2012)

The maximal number of cubic runs in a word. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (J. Comput. Syst. Sci., 2012)

Efficient algorithms for three variants of the LPF table. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Wojciech Rytter; Tomasz Walen (J. Discrete Algorithms, 2012)

On the maximal sum of exponents of runs in a string. - Maxime Crochemore; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (J. Discrete Algorithms, 2012)

Improved algorithms for the range next value problem and applications. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; M. Sohel Rahman; German Tischler; Tomasz Walen (Theor. Comput. Sci., 2012)

Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SPIRE, 2013)

Optimal Data Structure for Internal Pattern Matching Queries in a Text and Applications. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CoRR, 2013)

Order-Preserving Suffix Trees and Their Algorithmic Applications - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CoRR, 2013)

Computing the Longest Previous Factor. - Maxime Crochemore; Lucian Ilie; Costas S. Iliopoulos; Marcin Kubica 001; Wojciech Rytter; Tomasz Walen (Eur. J. Comb., 2013)

On the maximum number of cubic subwords in a word. - Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Eur. J. Comb., 2013)

A note on efficient computation of all Abelian periods in a string. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Jakub Pachocki; Jakub Radoszewski; Wojciech Rytter; Wojciech Tyczynski; Tomasz Walen (Inf. Process. Lett., 2013)

A linear time algorithm for consecutive permutation pattern matching. - Marcin Kubica 001; Tomasz Kulczynski; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Inf. Process. Lett., 2013)

Efficient seed computation revisited. - Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Bartosz Szreder; Tomasz Walen (Theor. Comput. Sci., 2013)

New simple efficient algorithms computing powers and runs in strings. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Krzysztof Stencel; Tomasz Walen (Discret. Appl. Math., 2014)

RNA Bricks - a database of RNA 3D motifs and their interactions. - Grzegorz Chojnowski; Tomasz Walen; Janusz M. Bujnicki (Nucleic Acids Res., 2014)

Extracting powers and periods in a word from its runs structure. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2014)

Efficient counting of square substrings in a tree. - Tomasz Kociumaka; Jakub Pachocki; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2014)

Efficient Algorithms for Longest Closed Factor Array. - Hideo Bannai; Shunsuke Inenaga; Tomasz Kociumaka; Arnaud Lefebvre; Jakub Radoszewski; Wojciech Rytter; Shiho Sugimoto; Tomasz Walen (SPIRE, 2015)

Fast Algorithm for Partial Covers in Words. - Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Algorithmica, 2015)

A note on the longest common compatible prefix problem for partial words. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Jakub Radoszewski; Wojciech Rytter; Bartosz Szreder; Tomasz Walen (J. Discrete Algorithms, 2015)

Linear-time version of Holub's algorithm for morphic imprimitivity testing. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2015)

Faster Longest Common Extension Queries in Strings over General Alphabets. - Pawel Gawrychowski; Tomasz Kociumaka; Wojciech Rytter; Tomasz Walen (CPM, 2016)

Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Ritu Kundu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SPIRE, 2016)

Polynomial-time approximation algorithms for weighted LCS problem. - Marek Cygan; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Discret. Appl. Math., 2016)

On the greedy algorithm for the Shortest Common Superstring problem with reversals. - Gabriele Fici; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Inf. Process. Lett., 2016)

Order-preserving indexing. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2016)

Maximum number of distinct and nonequivalent nonstandard squares in a word. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2016)

String Powers in Trees. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Algorithmica, 2017)

Covering problems for partial words and for indeterminate strings. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2017)

Linear-Time Algorithm for Long LCF with k Mismatches. - Panagiotis Charalampopoulos; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CPM, 2018)

How Much Different Are Two Words with Different Shortest Periods. - Mai Alzamel; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Ritu Kundu; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (AIAI (Workshops), 2018)

Faster Recovery of Approximate Periods over Edit Distance. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (SPIRE, 2018)

On the string consensus problem and the Manhattan sequence consensus problem. - Tomasz Kociumaka; Jakub Pachocki; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2018)

Efficient algorithms for shortest partial seeds in words. - Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2018)

Quasi-Linear-Time Algorithm for Longest Common Circular Factor. - Mai Alzamel; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (CPM, 2019)

Circular Pattern Matching with k Mismatches. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (FCT, 2019)

Weighted Shortest Common Supersequence Problem Revisited. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (SPIRE, 2019)

Efficient enumeration of non-equivalent squares in partial words with few holes. - Panagiotis Charalampopoulos; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (J. Comb. Optim., 2019)

Counting Distinct Patterns in Internal Dictionary Matching. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Manal Mohamed 001; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (CPM, 2020)

Unary Words Have the Smallest Levenshtein k-Neighbourhoods. - Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski; Tomasz Walen; Wiktor Zuba (CPM, 2020)

The Number of Repetitions in 2D-Strings. - Panagiotis Charalampopoulos; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (ESA, 2020)

Efficient Enumeration of Distinct Factors Using Package Representations. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (SPIRE, 2020)

Internal Quasiperiod Queries. - Maxime Crochemore; Costas S. Iliopoulos; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (SPIRE, 2020)

String periods in the order-preserving model. - Garance Gourdel; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Arseny M. Shur; Tomasz Walen (Inf. Comput., 2020)

A Linear-Time Algorithm for Seeds Computation. - Tomasz Kociumaka; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (ACM Trans. Algorithms, 2020)

Universal reconstruction of a string. - Pawel Gawrychowski; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2020)

Computing Covers of 2D-Strings. - Panagiotis Charalampopoulos; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (CPM, 2021)

Hardness of Detecting Abelian and Additive Square Factors in Strings. - Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (ESA, 2021)

String Covers of a Tree. - Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (SPIRE, 2021)

Internal Dictionary Matching. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Manal Mohamed 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Algorithmica, 2021)

Circular pattern matching with k mismatches. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (J. Comput. Syst. Sci., 2021)

Shortest covers of all cyclic shifts of a string. - Maxime Crochemore; Costas S. Iliopoulos; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (Theor. Comput. Sci., 2021)

Linear-Time Computation of Shortest Covers of All Rotations of a String. - Maxime Crochemore; Costas S. Iliopoulos; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (CPM, 2022)

Rectangular Tile Covers of 2D-Strings. - Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (CPM, 2022)

Approximate Circular Pattern Matching. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Jakub Radoszewski; Solon P. Pissis; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (ESA, 2022)

Efficient representation and counting of antipower factors in words. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (Inf. Comput., 2022)

A periodicity lemma for partial words. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Inf. Comput., 2022)

Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. - Costas S. Iliopoulos; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (CPM, 2023)

Tight Bound for the Number of Distinct Palindromes in a Tree. - Pawel Gawrychowski; Tomasz Kociumaka; Wojciech Rytter; Tomasz Walen (Electron. J. Comb., 2023)

Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words. - Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SPIRE, 2024)

Approximate Circular Pattern Matching Under Edit Distance. - Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (STACS, 2024)

Internal Pattern Matching Queries in a Text and Applications. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SIAM J. Comput., 2024)

Counting Distinct Square Substrings in Sublinear Time. - Panagiotis Charalampopoulos; Manal Mohamed 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (MFCS, 2025)

Subsequence covers of words. - Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (Theor. Comput. Sci., 2025)