Publications

P. Charalampopoulos, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń, W. Zuba (2024). Approximate Circular Pattern Matching Under Edit Distance. STACS pp:24:1-24:22.

J. Radoszewski, W. Rytter, T. Waleń (2024). Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words. SPIRE pp:257-271.

C. S. Iliopoulos, T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń, W. Zuba (2023). Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. CPM pp:15:1-15:15.

P. Gawrychowski, T. Kociumaka, W. Rytter, T. Waleń (2023). Tight Bound for the Number of Distinct Palindromes in a Tree. Electron. J. Comb. 30(2).

P. Charalampopoulos, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń, W. Zuba (2022). Subsequence Covers of Words. SPIRE pp:3-15.

P. Charalampopoulos, T. Kociumaka, J. Radoszewski, S. P. Pissis, W. Rytter, T. Waleń, W. Zuba (2022). Approximate Circular Pattern Matching. ESA pp:35:1-35:19.

J. Radoszewski, W. Rytter, J. Straszynski, T. Waleń, W. Zuba (2022). Rectangular Tile Covers of 2D-Strings. CPM pp:23:1-23:14.

M. Crochemore, C. S. Iliopoulos, J. Radoszewski, W. Rytter, J. Straszynski, T. Waleń, W. Zuba (2022). Linear-Time Computation of Shortest Covers of All Rotations of a String. CPM pp:22:1-22:15.

T. Kociumaka, J. Radoszewski, W. Rytter, J. Straszynski, T. Waleń, W. Zuba (2022). Efficient representation and counting of antipower factors in words. Inf. Comput. 286:104779.

T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń (2022). A periodicity lemma for partial words. Inf. Comput. 283:104677.

J. Radoszewski, W. Rytter, J. Straszynski, T. Waleń, W. Zuba (2021). String Covers of a Tree. SPIRE pp:68-82.

J. Radoszewski, W. Rytter, J. Straszynski, T. Waleń, W. Zuba (2021). Hardness of Detecting Abelian and Additive Square Factors in Strings. ESA pp:77:1-77:19.

P. Charalampopoulos, T. Kociumaka, M. Mohamed, J. Radoszewski, W. Rytter, T. Waleń (2021). Internal Dictionary Matching. Algorithmica 83(7):2142-2169.

P. Charalampopoulos, J. Radoszewski, W. Rytter, T. Waleń, W. Zuba (2021). Computing Covers of 2D-Strings. CPM pp:12:1-12:20.

M. Crochemore, C. S. Iliopoulos, J. Radoszewski, W. Rytter, J. Straszynski, T. Waleń, W. Zuba (2021). Shortest covers of all cyclic shifts of a string. Theoretical Computer Science 866:70-81.

P. Charalampopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, J. Straszynski, T. Waleń, W. Zuba (2020). Circular pattern matching with k mismatches. Journal of Computer and System Sciences 115:73-85.

M. Crochemore, C. S. Iliopoulos, J. Radoszewski, W. Rytter, J. Straszynski, T. Waleń, W. Zuba (2020). Internal Quasiperiod Queries. SPIRE pp:60-75.

P. Charalampopoulos, T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń, W. Zuba (2020). Efficient Enumeration of Distinct Factors Using Package Representations. SPIRE pp:247-261.

P. Charalampopoulos, J. Radoszewski, W. Rytter, T. Waleń, W. Zuba (2020). The Number of Repetitions in 2D-Strings. ESA pp:32:1-32:18.

P. Charalampopoulos, S. P. Pissis, J. Radoszewski, T. Waleń, W. Zuba (2020). Unary Words Have the Smallest Levenshtein k-Neighbourhoods. CPM pp:10:1-10:12.

P. Charalampopoulos, T. Kociumaka, M. Mohamed, J. Radoszewski, W. Rytter, J. Straszynski, T. Waleń, W. Zuba (2020). Counting Distinct Patterns in Internal Dictionary Matching. CPM pp:8:1-8:15.

T. Kociumaka, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń (2020). A Linear-Time Algorithm for Seeds Computation. ACM Trans. Algorithms 16(2):27:1-27:23.

P. Gawrychowski, T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń (2020). Universal reconstruction of a string. Theoretical Computer Science 812:174-186.

M. Crochemore, C. S. Iliopoulos, J. Radoszewski, W. Rytter, J. Straszynski, T. Waleń, W. Zuba (2020). Shortest Covers of All Cyclic Shifts of a String. WALCOM pp:69-80.

G. Gourdel, T. Kociumaka, J. Radoszewski, W. Rytter, A. M. Shur, T. Waleń (2020). String periods in the order-preserving model. Inf. Comput. 270.

P. Charalampopoulos, T. Kociumaka, M. Mohamed, J. Radoszewski, W. Rytter, T. Waleń (2019). Internal Dictionary Matching. ISAAC pp:22:1-22:17.

P. Charalampopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, J. Straszynski, T. Waleń, W. Zuba (2019). Weighted Shortest Common Supersequence Problem Revisited. SPIRE pp:221-238.

P. Charalampopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, J. Straszynski, T. Waleń, W. Zuba (2019). Circular Pattern Matching with k Mismatches. FCT pp:213-228.

M. Alzamel, M. Crochemore, C. S. Iliopoulos, T. Kociumaka, J. Radoszewski, W. Rytter, J. Straszynski, T. Waleń, W. Zuba (2019). Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CPM pp:25:1-25:14.

T. Kociumaka, J. Radoszewski, W. Rytter, J. Straszynski, T. Waleń, W. Zuba (2019). Efficient Representation and Counting of Antipower Factors in Words. LATA pp:421-433.

P. Charalampopoulos, M. Crochemore, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń (2019). Efficient enumeration of non-equivalent squares in partial words with few holes. Journal of Combinatorial Optimization 37(2):501-522.

T. Kociumaka, J. Radoszewski, W. Rytter, J. Straszynski, T. Waleń, W. Zuba (2018). Faster Recovery of Approximate Periods over Edit Distance. SPIRE pp:233-240.

P. Charalampopoulos, M. Crochemore, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń (2018). Linear-Time Algorithm for Long LCF with k Mismatches. CPM pp:23:1-23:16.

M. Alzamel, M. Crochemore, C. S. Iliopoulos, T. Kociumaka, R. Kundu, J. Radoszewski, W. Rytter, T. Waleń (2018). How Much Different Are Two Words with Different Shortest Periods. AIAI (Workshops) pp:168-178.

T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń (2018). On Periodicity Lemma for Partial Words. LATA pp:232-244.

G. Gourdel, T. Kociumaka, J. Radoszewski, W. Rytter, A. M. Shur, T. Waleń (2018). String Periods in the Order-Preserving Model. STACS pp:38:1-38:16.

T. Kociumaka, J. W. Pachocki, J. Radoszewski, W. Rytter, T. Waleń (2018). On the string consensus problem and the Manhattan sequence consensus problem. Theoretical Computer Science 710:126-138.

T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń (2018). Efficient algorithms for shortest partial seeds in words. Theoretical Computer Science 710:139-147.

M. Crochemore, C. S. Iliopoulos, T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń (2017). Covering problems for partial words and for indeterminate strings. Theoretical Computer Science 698:25-39.

T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń (2017). String Powers in Trees. Algorithmica 79(3):814-834.

P. Charalampopoulos, M. Crochemore, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń (2017). Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. COCOON pp:99-111.

T. Kociumaka, J. W. Pachocki, J. Radoszewski, W. Rytter, T. Waleń (2017). On the String Consensus Problem and the Manhattan Sequence Consensus Problem. TCS.

M. Crochemore, C. S. Iliopoulos, T. Kociumaka, R. Kundu, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń (2016). Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. SPIRE pp:22-34.

T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń (2016). Maximum number of distinct and nonequivalent nonstandard squares in a word. Theoretical Computer Science 648:84-95.

P. Gawrychowski, T. Kociumaka, W. Rytter, T. Waleń (2016). Faster Longest Common Extension Queries in Strings over General Alphabets. CPM pp:5:1-5:13.

M. Crochemore, C. S. Iliopoulos, T. Kociumaka, M. Kubica, A. Langiu, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń (2016). Order-preserving indexing. Theoretical Computer Science 638:122-135.

M. Cygan, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń (2016). Polynomial-time approximation algorithms for weighted LCS problem. Discrete Applied Mathematics 204:38-48.

G. Fici, T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń (2015). On the greedy algorithm for the Shortest Common Superstring problem with reversals. Information Processing Letters 116(3):245-251.

T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń (2015). Linear-time version of Holub's algorithm for morphic imprimitivity testing. Theoretical Computer Science 602:7-21.

P. Gawrychowski, T. Kociumaka, W. Rytter, T. Waleń (2015). Tight Bound for the Number of Distinct Palindromes in a Tree. SPIRE pp:270-276.

H. Bannai, S. Inenaga, T. Kociumaka, A. Lefebvre, J. Radoszewski, W. Rytter, S. Sugimoto, T. Waleń (2015). Efficient Algorithms for Longest Closed Factor Array. SPIRE pp:95-102.

M. Crochemore, C. S. Iliopoulos, T. Kociumaka, M. Kubica, A. Langiu, J. Radoszewski, W. Rytter, B. Szreder, T. Waleń (2015). A note on the longest common compatible prefix problem for partial words. Journal of Discrete Algorithms 34:49-53.

P. Gawrychowski, T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń (2015). Universal Reconstruction of a String. WADS pp:386-397.

T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń (2015). Fast Algorithm for Partial Covers in Words. Algorithmica 73(1):217-233.

T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń (2015). String Powers in Trees. CPM pp:284-294.

T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń (2015). Internal Pattern Matching Queries in a Text and Applications. SODA pp:532-551.

M. Crochemore, C. S. Iliopoulos, T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń (2014). Covering Problems for Partial Words and for Indeterminate Strings. ISAAC pp:220-232.

T. Kociumaka, J. W. Pachocki, J. Radoszewski, W. Rytter, T. Waleń (2014). On the String Consensus Problem and the Manhattan Sequence Consensus Problem. SPIRE pp:244-255.

T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń (2014). Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. Developments in Language Theory pp:215-226.

M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, K. Stencel, T. Waleń (2014). New simple efficient algorithms computing powers and runs in strings. Discrete Applied Mathematics 163:258-267.

T. Kociumaka, J. Pachocki, J. Radoszewski, W. Rytter, T. Waleń (2014). Efficient counting of square substrings in a tree. Theoretical Computer Science 544:60-73.

T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń (2014). Efficient Algorithms for Shortest Partial Seeds in Words. CPM pp:192-201.

G. Chojnowski, T. Waleń, J. M. Bujnicki (2014). RNA Bricks - a database of RNA 3D motifs and their interactions. Nucleic Acids Research 42(Database-Issue):123-131.

M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń (2014). Extracting powers and periods in a word from its runs structure. Theoretical Computer Science 521:29-41.

T. Waleń, G. Chojnowski, P. Gierski, J. M. Bujnicki (2014). ClaRNA: a classifier of contacts in RNA 3D structures based on a comparative analysis of various classification schemes. Nucleic Acids Research (NAR).

T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń (2013). Optimal Data Structure for Internal Pattern Matching Queries in a Text and Applications. arXiv CoRR abs/1311.6235.

M. Crochemore, C. S. Iliopoulos, T. Kociumaka, M. Kubica, A. Langiu, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń (2013). Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. SPIRE pp:84-95.

M. Kubica, T. Kulczyński, J. Radoszewski, W. Rytter, T. Waleń (2013). A linear time algorithm for consecutive permutation pattern matching. Information Processing Letters 113(12):430-433.

T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń (2013). Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing. LATA pp:383-394.

T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń (2013). Fast Algorithm for Partial Covers in Words. CPM pp:177-188.

M. Christou, M. Crochemore, C. S. Iliopoulos, M. Kubica, S. P. Pissis, J. Radoszewski, W. Rytter, B. Szreder, T. Waleń (2013). Efficient seed computation revisited. Theoretical Computer Science 483:171-181.

T. Kociumaka, J. Pachocki, J. Radoszewski, W. Rytter, T. Waleń (2013). Efficient Counting of Square Substrings in a Tree. ISAAC pp:207-216.

M. Crochemore, C. S. Iliopoulos, T. Kociumaka, M. Kubica, J. Pachocki, J. Radoszewski, W. Rytter, W. Tyczyński, T. Waleń (2013). A note on efficient computation of all Abelian periods in a string. Information Processing Letters 113(3):74-77.

T. Kociumaka, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń (2012). A linear time algorithm for seeds computation. SODA pp:1095-1112.

M. Crochemore, C. S. Iliopoulos, M. Kubica, M. Sohel Rahman, G. Tischler, T. Waleń (2012). Improved algorithms for the range next value problem and applications. Theoretical Computer Science 434:23-34.

M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń (2012). The maximal number of cubic runs in a word. Journal of Computer and System Sciences 78(6):1828-1836.

M. Kubica, J. Radoszewski, W. Rytter, T. Waleń (2012). On the maximum number of cubic subwords in a word. European Journal of Combinatorics 34(1):27-37.

M. Crochemore, L. Ilie, C. S. Iliopoulos, M. Kubica, W. Rytter, T. Waleń (2012). Computing the Longest Previous Factor. European Journal of Combinatorics 34(1):15-26.

T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń (2012). Efficient Data Structures for the Factor Periodicity Problem. SPIRE pp:284-294.

M. Crochemore, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń (2012). On the maximal sum of exponents of runs in a string. Journal of Discrete Algorithms 14:29-36.

M. Crochemore, C. S. Iliopoulos, T. Kociumaka, M. Kubica, J. Radoszewski, W. Rytter, W. Tyczyński, T. Waleń (2012). The Maximum Number of Squares in a Tree. CPM pp:27-40.

M. Crochemore, C. S. Iliopoulos, M. Kubica, W. Rytter, T. Waleń (2012). Efficient algorithms for three variants of the LPF table. Journal of Discrete Algorithms 11:51-61.

M. Kubica, R. Rizzi, S. Vialette, T. Waleń (2011). Approximation of RNA multiple structural alignment. Journal of Discrete Algorithms 9(4):365-376.

M. Cygan, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń (2011). Polynomial-Time Approximation Algorithms for Weighted LCS Problem. CPM pp:455-466.

M. Christou, M. Crochemore, C. S. Iliopoulos, M. Kubica, S. P. Pissis, J. Radoszewski, W. Rytter, B. Szreder, T. Waleń (2011). Efficient Seeds Computation Revisited. CPM pp:350-363.

M. Crochemore, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń (2011). On the Maximal Sum of Exponents of Runs in a String. IWOCA pp:10-19.

R. Erman, Ł. Kowalik, M. Krnc, T. Waleń (2010). Improved induced matchings in sparse graphs. Discrete Applied Mathematics 158(18):1994-2003.

M. Crochemore, M. Kubica, T. Waleń, C. S. Iliopoulos, M. Sohel Rahman (2010). Finding Patterns In Given Intervals. Fundamenta Informaticae 101(3):173-186.

M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń (2010). Extracting Powers and Periods in a String from Its Runs Structure. SPIRE pp:258-269.

M. Crochemore, M. Cygan, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń (2010). Algorithms for Three Versions of the Shortest Common Superstring Problem. CPM pp:299-309.

M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Waleń (2010). On the Maximal Number of Cubic Runs in a String. LATA pp:227-238.

M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, K. Stencel, T. Waleń (2010). New Simple Efficient Algorithms Computing Powers and Runs in Strings. Stringology pp:138-149.

M. Crochemore, C. S. Iliopoulos, M. Kubica, M. Sohel Rahman, T. Waleń (2010). Improved Algorithms for the Range Next Value Problem and Applications. STACS pp:205-216.

M. Crochemore, C. S. Iliopoulos, M. Kubica, W. Rytter, T. Waleń (2009). Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. SOFSEM pp:296-307.

R. Erman, Ł. Kowalik, M. Krnc, T. Waleń (2009). Improved Induced Matchings in Sparse Graphs. IWPEC pp:134-148.

M. Kubica, J. Radoszewski, W. Rytter, T. Waleń (2009). On the Maximal Number of Cubic Subwords in a String. IWOCA pp:345-355.

M. Crochemore, L. Ilie, C. S. Iliopoulos, M. Kubica, W. Rytter, T. Waleń (2009). LPF Computation Revisited. IWOCA pp:158-169.

P. Kolman, T. Waleń (2008). Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set. Electr. J. Comb. 14(1).

C. S. Iliopoulos, M. Kubica, M. Sohel Rahman, T. Waleń (2007). Algorithms for Computing the Longest Parameterized Common Subsequence. CPM pp:265-273.

P. Kolman, T. Waleń (2007). Approximating reversal distance for strings with bounded number of duplicates. Discrete Applied Mathematics 155(3):327-336.

S. Bereg, M. Kubica, T. Waleń, B. Zhu (2007). RNA multiple structural alignment with longest common subsequences. Journal of Combinatorial Optimization 13(2):179-188.

P. Kolman, T. Waleń (2007). Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set. WAOA pp:279-289.

M. Kubica, R. Rizzi, S. Vialette, T. Waleń (2006). Approximation of RNA Multiple Structural Alignment. CPM pp:211-222.

K. Ciebiera, J. Mincer-Daszkiewicz, T. Waleń (2004). New Course Registration Module for the University Study-Oriented System. The 10th International Conference of European University Information Systems, EUNIS.