| Publication | Date of Publication | Type |
|---|
Internal pattern matching queries in a text and applications
SIAM Journal on Computing | 2024-10-21 | Paper |
| Linear-time computation of cyclic roots and cyclic covers of a string | 2024-10-21 | Paper |
| Linear-time computation of shortest covers of all rotations of a string | 2024-05-06 | Paper |
| Rectangular tile covers of 2D-strings | 2024-05-06 | Paper |
| Weighted shortest common supersequence problem revisited | 2024-04-19 | Paper |
scientific article; zbMATH DE number 7740932 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
Subsequence covers of words
String Processing and Information Retrieval | 2023-08-04 | Paper |
Faster recovery of approximate periods over edit distance
String Processing and Information Retrieval | 2023-07-28 | Paper |
| scientific article; zbMATH DE number 7695998 (Why is no real title available?) | 2023-06-14 | Paper |
Tight bound for the number of distinct palindromes in a tree
The Electronic Journal of Combinatorics | 2023-05-16 | Paper |
| Unary Words Have the Smallest Levenshtein k-Neighbourhoods | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7651099 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7651171 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| Internal dictionary matching | 2023-02-03 | Paper |
Internal Quasiperiod Queries
1511.681 | 2022-12-22 | Paper |
Efficient Enumeration of Distinct Factors Using Package Representations
1511.68098 | 2022-12-22 | Paper |
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
(available as arXiv preprint) | 2022-07-18 | Paper |
| String covers of a tree | 2022-06-15 | Paper |
Efficient representation and counting of antipower factors in words
Information and Computation | 2022-06-13 | Paper |
A periodicity lemma for partial words
Information and Computation | 2022-03-14 | Paper |
Internal dictionary matching
Algorithmica | 2021-06-30 | Paper |
Internal dictionary matching
Algorithmica | 2021-06-30 | Paper |
A linear-time algorithm for seeds computation
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Shortest covers of all cyclic shifts of a string
Theoretical Computer Science | 2021-04-14 | Paper |
Linear-time algorithm for long LCF with \(k\) mismatches
(available as arXiv preprint) | 2020-12-16 | Paper |
Circular pattern matching with \(k\) mismatches
Journal of Computer and System Sciences | 2020-10-23 | Paper |
String Periods in the Order-Preserving Model
(available as arXiv preprint) | 2020-08-05 | Paper |
Shortest covers of all cyclic shifts of a string
WALCOM: Algorithms and Computation | 2020-07-22 | Paper |
Universal reconstruction of a string
Theoretical Computer Science | 2020-02-20 | Paper |
Circular pattern matching with \(k\) mismatches
Fundamentals of Computation Theory | 2020-01-30 | Paper |
String periods in the order-preserving model
Information and Computation | 2020-01-17 | Paper |
Efficient representation and counting of antipower factors in words
Lecture Notes in Computer Science | 2019-12-04 | Paper |
Efficient enumeration of non-equivalent squares in partial words with few holes
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
| A linear time algorithm for seeds computation | 2019-05-10 | Paper |
Near-optimal computation of runs over general alphabet via non-crossing LCE queries
(available as arXiv preprint) | 2018-10-17 | Paper |
On periodicity lemma for partial words
(available as arXiv preprint) | 2018-06-26 | Paper |
Efficient algorithms for shortest partial seeds in words
Theoretical Computer Science | 2018-02-16 | Paper |
On the string consensus problem and the Manhattan sequence consensus problem
Theoretical Computer Science | 2018-02-16 | Paper |
String powers in trees
Algorithmica | 2017-11-09 | Paper |
Covering problems for partial words and for indeterminate strings
Theoretical Computer Science | 2017-11-06 | Paper |
Efficient enumeration of non-equivalent squares in partial words with few holes
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Faster longest common extension queries in strings over general alphabets
(available as arXiv preprint) | 2017-10-17 | Paper |
Internal pattern matching queries in a text and applications
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Maximum number of distinct and nonequivalent nonstandard squares in a word
Theoretical Computer Science | 2016-09-12 | Paper |
Order-preserving indexing
Theoretical Computer Science | 2016-06-16 | Paper |
Polynomial-time approximation algorithms for weighted LCS problem
Discrete Applied Mathematics | 2016-04-07 | Paper |
On the greedy algorithm for the shortest common superstring problem with reversals
Information Processing Letters | 2016-01-05 | Paper |
Universal reconstruction of a string
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Linear-time version of Holub's algorithm for morphic imprimitivity testing
Theoretical Computer Science | 2015-09-25 | Paper |
New simple efficient algorithms computing powers and runs in strings
Discrete Applied Mathematics | 2015-09-22 | Paper |
Covering problems for partial words and for indeterminate strings
Lecture Notes in Computer Science | 2015-09-11 | Paper |
Fast algorithm for partial covers in words
Algorithmica | 2015-09-03 | Paper |
A note on the longest common compatible prefix problem for partial words
Journal of Discrete Algorithms | 2015-08-24 | Paper |
String Powers in Trees
Combinatorial Pattern Matching | 2015-08-20 | Paper |
On the string consensus problem and the Manhattan sequence consensus problem
String Processing and Information Retrieval | 2015-02-10 | Paper |
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
Developments in Language Theory | 2014-10-14 | Paper |
A linear time algorithm for consecutive permutation pattern matching
Information Processing Letters | 2014-08-13 | Paper |
Efficient counting of square substrings in a tree
Theoretical Computer Science | 2014-07-07 | Paper |
Efficient Algorithms for Shortest Partial Seeds in Words
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Extracting powers and periods in a word from its runs structure
Theoretical Computer Science | 2014-01-22 | Paper |
Efficient seed computation revisited
Theoretical Computer Science | 2014-01-09 | Paper |
Fast Algorithm for Partial Covers in Words
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Efficient counting of square substrings in a tree
Algorithms and Computation | 2013-03-21 | Paper |
A note on efficient computation of all abelian periods in a string
Information Processing Letters | 2013-03-20 | Paper |
| scientific article; zbMATH DE number 6146456 (Why is no real title available?) | 2013-03-19 | Paper |
Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Computing the longest previous factor
European Journal of Combinatorics | 2012-11-15 | Paper |
On the maximum number of cubic subwords in a word
European Journal of Combinatorics | 2012-11-15 | Paper |
The maximal number of cubic runs in a word
Journal of Computer and System Sciences | 2012-11-06 | Paper |
On the maximal sum of exponents of runs in a string
Journal of Discrete Algorithms | 2012-09-13 | Paper |
The maximum number of squares in a tree
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Improved algorithms for the range next value problem and applications
Theoretical Computer Science | 2012-06-25 | Paper |
Efficient algorithms for three variants of the LPF table
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Approximation of RNA multiple structural alignment
Journal of Discrete Algorithms | 2012-01-04 | Paper |
Polynomial-time approximation algorithms for weighted LCS problem
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Efficient seeds computation revisited
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Finding patterns in given intervals
Fundamenta Informaticae | 2011-06-14 | Paper |
On the Maximal Sum of Exponents of Runsin a String
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Improved induced matchings in sparse graphs
Discrete Applied Mathematics | 2010-11-25 | Paper |
Algorithms for Three Versions of the Shortest Common Superstring Problem
Combinatorial Pattern Matching | 2010-07-26 | Paper |
On the maximal number of cubic runs in a string
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Improved induced matchings in sparse graphs
Parameterized and Exact Computation | 2010-01-14 | Paper |
On the maximal number of cubic subwords in a string
Lecture Notes in Computer Science | 2009-12-11 | Paper |
LPF computation revisited
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Reversal distance for strings with duplicates: linear time approximation using hitting set
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Reversal distance for strings with duplicates: linear time approximation using hitting set
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Algorithms for Computing the Longest Parameterized Common Subsequence
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
Approximation and Online Algorithms | 2008-02-21 | Paper |
RNA multiple structural alignment with longest common subsequences
Journal of Combinatorial Optimization | 2007-10-12 | Paper |
Approximation of RNA Multiple Structural Alignment
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Approximating reversal distance for strings with bounded number of duplicates
Discrete Applied Mathematics | 2007-03-02 | Paper |
