Publications

(2023). Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. CPM pp:15:1-15:15.

(2023). Tight Bound for the Number of Distinct Palindromes in a Tree. Electron. J. Comb. 30(2).

(2022). Subsequence Covers of Words. SPIRE pp:3-15.

(2022). Approximate Circular Pattern Matching. ESA pp:35:1-35:19.

(2022). Rectangular Tile Covers of 2D-Strings. CPM pp:23:1-23:14.

(2022). Linear-Time Computation of Shortest Covers of All Rotations of a String. CPM pp:22:1-22:15.

(2022). Efficient representation and counting of antipower factors in words. Inf. Comput. 286:104779.

(2022). A periodicity lemma for partial words. Inf. Comput. 283:104677.

(2021). String Covers of a Tree. SPIRE pp:68-82.

(2021). Hardness of Detecting Abelian and Additive Square Factors in Strings. ESA pp:77:1-77:19.

(2021). Internal Dictionary Matching. Algorithmica 83(7):2142-2169.

(2021). Computing Covers of 2D-Strings. CPM pp:12:1-12:20.

(2021). Shortest covers of all cyclic shifts of a string. Theoretical Computer Science 866:70-81.

(2020). Circular pattern matching with k mismatches. Journal of Computer and System Sciences 115:73-85.

(2020). Internal Quasiperiod Queries. SPIRE pp:60-75.

(2020). Efficient Enumeration of Distinct Factors Using Package Representations. SPIRE pp:247-261.

(2020). The Number of Repetitions in 2D-Strings. ESA pp:32:1-32:18.

(2020). Unary Words Have the Smallest Levenshtein k-Neighbourhoods. CPM pp:10:1-10:12.

(2020). Counting Distinct Patterns in Internal Dictionary Matching. CPM pp:8:1-8:15.

(2020). A Linear-Time Algorithm for Seeds Computation. ACM Trans. Algorithms 16(2):27:1-27:23.

(2020). Universal reconstruction of a string. Theoretical Computer Science 812:174-186.

(2020). Shortest Covers of All Cyclic Shifts of a String. WALCOM pp:69-80.

(2020). String periods in the order-preserving model. Inf. Comput. 270.

(2019). Internal Dictionary Matching. ISAAC pp:22:1-22:17.

(2019). Weighted Shortest Common Supersequence Problem Revisited. SPIRE pp:221-238.

(2019). Circular Pattern Matching with k Mismatches. FCT pp:213-228.

(2019). Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CPM pp:25:1-25:14.

(2019). Efficient Representation and Counting of Antipower Factors in Words. LATA pp:421-433.

(2019). Efficient enumeration of non-equivalent squares in partial words with few holes. Journal of Combinatorial Optimization 37(2):501-522.

(2018). Faster Recovery of Approximate Periods over Edit Distance. SPIRE pp:233-240.

(2018). Linear-Time Algorithm for Long LCF with k Mismatches. CPM pp:23:1-23:16.

(2018). How Much Different Are Two Words with Different Shortest Periods. AIAI (Workshops) pp:168-178.

(2018). On Periodicity Lemma for Partial Words. LATA pp:232-244.

(2018). String Periods in the Order-Preserving Model. STACS pp:38:1-38:16.

(2018). On the string consensus problem and the Manhattan sequence consensus problem. Theoretical Computer Science 710:126-138.

(2018). Efficient algorithms for shortest partial seeds in words. Theoretical Computer Science 710:139-147.

(2017). Covering problems for partial words and for indeterminate strings. Theoretical Computer Science 698:25-39.

(2017). String Powers in Trees. Algorithmica 79(3):814-834.

(2017). Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. COCOON pp:99-111.

(2017). On the String Consensus Problem and the Manhattan Sequence Consensus Problem. TCS.

(2016). Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. SPIRE pp:22-34.

(2016). Maximum number of distinct and nonequivalent nonstandard squares in a word. Theoretical Computer Science 648:84-95.

(2016). Faster Longest Common Extension Queries in Strings over General Alphabets. CPM pp:5:1-5:13.

(2016). Order-preserving indexing. Theoretical Computer Science 638:122-135.

(2016). Polynomial-time approximation algorithms for weighted LCS problem. Discrete Applied Mathematics 204:38-48.

(2015). On the greedy algorithm for the Shortest Common Superstring problem with reversals. Information Processing Letters 116(3):245-251.

(2015). Linear-time version of Holub's algorithm for morphic imprimitivity testing. Theoretical Computer Science 602:7-21.

(2015). Tight Bound for the Number of Distinct Palindromes in a Tree. SPIRE pp:270-276.

(2015). Efficient Algorithms for Longest Closed Factor Array. SPIRE pp:95-102.

(2015). A note on the longest common compatible prefix problem for partial words. Journal of Discrete Algorithms 34:49-53.

(2015). Universal Reconstruction of a String. WADS pp:386-397.

(2015). Fast Algorithm for Partial Covers in Words. Algorithmica 73(1):217-233.

(2015). String Powers in Trees. CPM pp:284-294.

(2015). Internal Pattern Matching Queries in a Text and Applications. SODA pp:532-551.

(2014). Covering Problems for Partial Words and for Indeterminate Strings. ISAAC pp:220-232.

(2014). On the String Consensus Problem and the Manhattan Sequence Consensus Problem. SPIRE pp:244-255.

(2014). Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. Developments in Language Theory pp:215-226.

(2014). New simple efficient algorithms computing powers and runs in strings. Discrete Applied Mathematics 163:258-267.

(2014). Efficient counting of square substrings in a tree. Theoretical Computer Science 544:60-73.

(2014). Efficient Algorithms for Shortest Partial Seeds in Words. CPM pp:192-201.

(2014). RNA Bricks - a database of RNA 3D motifs and their interactions. Nucleic Acids Research 42(Database-Issue):123-131.

(2014). Extracting powers and periods in a word from its runs structure. Theoretical Computer Science 521:29-41.

(2014). ClaRNA: a classifier of contacts in RNA 3D structures based on a comparative analysis of various classification schemes. Nucleic Acids Research (NAR).

(2013). Optimal Data Structure for Internal Pattern Matching Queries in a Text and Applications. arXiv CoRR abs/1311.6235.

(2013). Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. SPIRE pp:84-95.

(2013). A linear time algorithm for consecutive permutation pattern matching. Information Processing Letters 113(12):430-433.

(2013). Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing. LATA pp:383-394.

(2013). Fast Algorithm for Partial Covers in Words. CPM pp:177-188.

(2013). Efficient seed computation revisited. Theoretical Computer Science 483:171-181.

(2013). Efficient Counting of Square Substrings in a Tree. ISAAC pp:207-216.

(2013). A note on efficient computation of all Abelian periods in a string. Information Processing Letters 113(3):74-77.

(2012). A linear time algorithm for seeds computation. SODA pp:1095-1112.

(2012). Improved algorithms for the range next value problem and applications. Theoretical Computer Science 434:23-34.

(2012). The maximal number of cubic runs in a word. Journal of Computer and System Sciences 78(6):1828-1836.

(2012). On the maximum number of cubic subwords in a word. European Journal of Combinatorics 34(1):27-37.

(2012). Computing the Longest Previous Factor. European Journal of Combinatorics 34(1):15-26.

(2012). Efficient Data Structures for the Factor Periodicity Problem. SPIRE pp:284-294.

(2012). On the maximal sum of exponents of runs in a string. Journal of Discrete Algorithms 14:29-36.

(2012). The Maximum Number of Squares in a Tree. CPM pp:27-40.

(2012). Efficient algorithms for three variants of the LPF table. Journal of Discrete Algorithms 11:51-61.

(2011). Approximation of RNA multiple structural alignment. Journal of Discrete Algorithms 9(4):365-376.

(2011). Polynomial-Time Approximation Algorithms for Weighted LCS Problem. CPM pp:455-466.

(2011). Efficient Seeds Computation Revisited. CPM pp:350-363.

(2011). On the Maximal Sum of Exponents of Runs in a String. IWOCA pp:10-19.

(2010). Improved induced matchings in sparse graphs. Discrete Applied Mathematics 158(18):1994-2003.

(2010). Finding Patterns In Given Intervals. Fundamenta Informaticae 101(3):173-186.

(2010). Extracting Powers and Periods in a String from Its Runs Structure. SPIRE pp:258-269.

(2010). Algorithms for Three Versions of the Shortest Common Superstring Problem. CPM pp:299-309.

(2010). On the Maximal Number of Cubic Runs in a String. LATA pp:227-238.

(2010). New Simple Efficient Algorithms Computing Powers and Runs in Strings. Stringology pp:138-149.

(2010). Improved Algorithms for the Range Next Value Problem and Applications. STACS pp:205-216.

(2009). Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. SOFSEM pp:296-307.

(2009). Improved Induced Matchings in Sparse Graphs. IWPEC pp:134-148.

(2009). On the Maximal Number of Cubic Subwords in a String. IWOCA pp:345-355.

(2009). LPF Computation Revisited. IWOCA pp:158-169.

(2007). Algorithms for Computing the Longest Parameterized Common Subsequence. CPM pp:265-273.

(2007). Approximating reversal distance for strings with bounded number of duplicates. Discrete Applied Mathematics 155(3):327-336.

(2007). RNA multiple structural alignment with longest common subsequences. Journal of Combinatorial Optimization 13(2):179-188.

(2006). Approximation of RNA Multiple Structural Alignment. CPM pp:211-222.

(2004). New Course Registration Module for the University Study-Oriented System. The 10th International Conference of European University Information Systems, EUNIS.