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 Testing of Equivalence of Words in a Free Idempotent Semigroup. - Jakub Radoszewski; Wojciech Rytter (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)

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)

Hamiltonian Paths in the Square of a Tree. - Jakub Radoszewski; Wojciech Rytter (ISAAC, 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)

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)

On the structure of compacted subword graphs of Thue-Morse words and their applications. - Jakub Radoszewski; Wojciech Rytter (J. Discrete Algorithms, 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)

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)

Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter (CPM, 2014)

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)

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)

Subquadratic-Time Algorithms for Abelian Stringology Problems. - Tomasz Kociumaka; Jakub Radoszewski; Bartlomiej Wisniewski (MACIS, 2015)

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)

Efficient Index for Weighted Sequences. - Carl Barton; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski (CPM, 2016)

Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties. - Costas S. Iliopoulos; Jakub Radoszewski (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)

Parameterizing PWM- and Profile-Matching and Knapsack by the feasible-weight solutions count. - Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski (CoRR, 2016)

Streaming k-mismatch with data recovery and applications. - Jakub Radoszewski; Tatiana Starikovskaya (CoRR, 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)

2015 London Stringology Days and London Algorithmic Workshop (LSD & LAW). - Jakub Radoszewski; Tomasz Radzik (J. Discrete Algorithms, 2016)

Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter (SIAM J. Discret. Math., 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)

Palindromic Decompositions with Gaps and Errors. - Michal Adamczyk; Mai Alzamel; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Jakub Radoszewski (CSR, 2017)

Streaming K-Mismatch with Error Correcting and Applications. - Jakub Radoszewski; Tatiana Starikovskaya (DCC, 2017)

Longest Common Factor After One Edit Operation. - Amihood Amir; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis; Jakub Radoszewski (SPIRE, 2017)

Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter (Algorithmica, 2017)

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

Two strings at Hamming distance 1 cannot be both quasiperiodic. - Amihood Amir; Costas S. Iliopoulos; Jakub Radoszewski (Inf. Process. Lett., 2017)

Fast algorithms for Abelian periods in words and greatest common divisor queries. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter (J. Comput. Syst. Sci., 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)

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)

Longest Common Factor Made Fully Dynamic. - Amihood Amir; Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski (CoRR, 2018)

On Abelian Longest Common Factor with and without RLE. - Szymon Grabowski; Tomasz Kociumaka; Jakub Radoszewski (Fundam. Informaticae, 2018)

Palindromic Decompositions with Gaps and Errors. - Michal Adamczyk; Mai Alzamel; Panagiotis Charalampopoulos; Jakub Radoszewski (Int. J. Found. Comput. Sci., 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)

Quasi-Periodicity in Streams. - Pawel Gawrychowski; Jakub Radoszewski; Tatiana Starikovskaya (CPM, 2019)

Longest Common Substring Made Fully Dynamic. - Amihood Amir; Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski (ESA, 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)

On the Cyclic Regularities of Strings. - Oluwole I. Ajala; Miznah Alshammary; Mai Alzamel; Jia Gao 001; Costas S. Iliopoulos; Jakub Radoszewski; Wojciech Rytter; Bruce W. Watson (AIAI (Workshops), 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)

Pattern Matching on Weighted Strings. - Jakub Radoszewski (Stringology, 2019)

Longest Common Substring with Approximately k Mismatches. - Tomasz Kociumaka; Jakub Radoszewski; Tatiana Starikovskaya (Algorithmica, 2019)

Correction to: Longest Common Substring with Approximately k Mismatches. - Tomasz Kociumaka; Jakub Radoszewski; Tatiana Starikovskaya (Algorithmica, 2019)

On-line weighted pattern matching. - Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis; Jakub Radoszewski (Inf. Comput., 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)

Pattern Matching and Consensus Problems on Weighted Sequences and Profiles. - Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski (Theory Comput. Syst., 2019)

Special issue in honor of the 70th birthday of Prof. Wojciech Rytter. - Maxime Crochemore; Jakub Radoszewski (Theor. Comput. Sci., 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)

Approximating Longest Common Substring with k mismatches: Theory and Practice. - Garance Gourdel; Tomasz Kociumaka; Jakub Radoszewski; Tatiana Starikovskaya (CPM, 2020)

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

Efficient Computation of 2-Covers of a String. - Jakub Radoszewski; Juliusz Straszynski (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)

Dynamic and Internal Longest Common Substring. - Amihood Amir; Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski (Algorithmica, 2020)

Indexing weighted sequences: Neat and efficient. - Carl Barton; Tomasz Kociumaka; Chang Liu 035; Solon P. Pissis; Jakub Radoszewski (Inf. Comput., 2020)

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

Streaming k-mismatch with error correcting and applications. - Jakub Radoszewski; Tatiana Starikovskaya (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)

Faster algorithms for 1-mappability of a sequence. - Mai Alzamel; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis; Jakub Radoszewski; Wing-Kin Sung (Theor. Comput. Sci., 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)

Faster Algorithms for Longest Common Substring. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski (ESA, 2021)

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

Pattern Masking for Dictionary Matching. - Panagiotis Charalampopoulos; Huiping Chen; Peter Christen; Grigorios Loukides; Nadia Pisanti; Solon P. Pissis; Jakub Radoszewski (ISAAC, 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)

Experimental evaluation of algorithms for computing quasiperiods. - Patryk Czajka; Jakub Radoszewski (Theor. Comput. Sci., 2021)

Optimal skeleton and reduced Huffman trees. - Shmuel T. Klein; Jakub Radoszewski; Tamar C. Serebro; Dana Shapira (Theor. Comput. Sci., 2021)

Longest Palindromic Substring in Sublinear Time. - Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski (CPM, 2022)

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

k-Approximate Quasiperiodicity Under Hamming and Edit Distance. - Aleksander Kedzierski; Jakub Radoszewski (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)

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

Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications. - Estéban Gabory; Njagi Moses Mwaniki; Nadia Pisanti; Solon P. Pissis; Jakub Radoszewski; Michelle Sweering; Wiktor Zuba (CPM, 2023)

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)

Linear Time Construction of Cover Suffix Tree and Applications. - Jakub Radoszewski (ESA, 2023)

Publisher Correction: Longest Common Substring with Approximately k Mismatches. - Tomasz Kociumaka; Jakub Radoszewski; Tatiana Starikovskaya (Algorithmica, 2023)

Maintaining the Size of LZ77 on Semi-Dynamic Strings. - Hideo Bannai; Panagiotis Charalampopoulos; Jakub Radoszewski (CPM, 2024)

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

Computing String Covers in Sublinear Time. - Jakub Radoszewski; Wiktor Zuba (SPIRE, 2024)

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

A Note on the Maximum Number of k-Powers in a Finite Word. - Shuo Li; Jakub Pachocki; Jakub Radoszewski (Electron. J. Comb., 2024)

Pangenome comparison via ED strings. - Estéban Gabory; Njagi Moses Mwaniki; Nadia Pisanti; Solon P. Pissis; Jakub Radoszewski; Michelle Sweering; Wiktor Zuba (Frontiers Bioinform., 2024)

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

Pattern Masking for Dictionary Matching: Theory and Practice. - Panagiotis Charalampopoulos; Huiping Chen; Peter Christen; Grigorios Loukides; Nadia Pisanti; Solon P. Pissis; Jakub Radoszewski (Algorithmica, 2024)

Faster Approximate Elastic-Degenerate String Matching - Part A. - Solon P. Pissis; Jakub Radoszewski; Wiktor Zuba (CPM, 2025)

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

Elastic-degenerate string comparison. - Estéban Gabory; Njagi Moses Mwaniki; Nadia Pisanti; Solon P. Pissis; Jakub Radoszewski; Michelle Sweering; Wiktor Zuba (Inf. Comput., 2025)

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