Efficient Computation of Sequence Mappability. - Mai Alzamel; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Juliusz Straszynski (SPIRE, 2018)

Faster Recovery of Approximate Periods over Edit Distance. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (SPIRE, 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)

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)

Efficient Computation of 2-Covers of a String. - Jakub Radoszewski; Juliusz Straszynski (ESA, 2020)

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

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)

A lower bound for the coverability problem in acyclic pushdown VAS. - Matthias Englert; Piotr Hofman; Slawomir Lasota 001; Ranko Lazic 001; Jérôme Leroux; Juliusz Straszynski (Inf. Process. Lett., 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)

Efficient Computation of Sequence Mappability. - Panagiotis Charalampopoulos; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Juliusz Straszynski (Algorithmica, 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)