| Publication | Date of Publication | Type |
|---|
| Subsequence matching and analysis problems for formal languages | 2026-06-08 | Paper |
| The edit distance to \(k\)-subsequence universality | 2026-04-21 | Paper |
| Efficiently testing Simon's congruence | 2026-04-21 | Paper |
| On the structure of solution sets to regular word equations | 2026-03-18 | Paper |
| Tight bounds for the number of absent subsequences | 2026-02-26 | Paper |
| Subsequence matching and analysis problems for automata with translucent letters | 2026-02-10 | Paper |
| On the decidability and expressive power of several theories based on string constraints | 2025-12-15 | Paper |
k-universality of regular languages
Information and Computation | 2025-12-15 | Paper |
| Subsequences with generalised gap constraints: upper and lower complexity bounds | 2025-12-02 | Paper |
| k-universality of regular languages revisited | 2025-11-20 | Paper |
| Semënov arithmetic, affine \{VASS\}, and string constraints | 2025-11-10 | Paper |
Novel tree-search method for synthesizing SMT strategies
Acta Informatica | 2025-08-22 | Paper |
The edit distance to k-subsequence universality
Journal of Computer and System Sciences | 2025-08-21 | Paper |
| \(k\)-universality of regular languages | 2025-07-24 | Paper |
Longest common subsequence with gap constraints
Theory of Computing Systems | 2025-07-18 | Paper |
| Matching patterns with variables under Simon's congruence | 2024-10-23 | Paper |
On the structure of solution-sets to regular word equations
Theory of Computing Systems | 2024-10-07 | Paper |
| Subsequences with gap constraints: complexity bounds for matching and analysis problems | 2024-09-11 | Paper |
A closer look at the expressive power of logics based on word equations
Theory of Computing Systems | 2024-07-29 | Paper |
| Enumerating \(m\)-length walks in directed graphs with constant delay | 2024-05-31 | Paper |
| On the number of factors in the LZ-End factorization | 2024-05-29 | Paper |
Combinatorial algorithms for subsequence matching: a survey
(available as arXiv preprint) | 2024-02-06 | Paper |
| Combinatorial algorithms for subsequence matching: a survey | 2024-02-06 | Paper |
| Formal languages via theories over strings: an overview of some recent results | 2024-02-06 | Paper |
Absent Subsequences in Words
Fundamenta Informaticae | 2023-11-23 | Paper |
Reconstructing Words from Right-Bounded-Block Words
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
scientific article; zbMATH DE number 7724221 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-08 | Paper |
Matching patterns with variables under edit distance
String Processing and Information Retrieval | 2023-08-04 | Paper |
Longest Common Subsequence with Gap Constraints
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Subsequences in bounded ranges: matching and analysis problems
Lecture Notes in Computer Science | 2023-07-21 | Paper |
Absent subsequences in words
(available as arXiv preprint) | 2023-03-31 | Paper |
Towards more efficient methods for solving regular-expression heavy string constraints
Theoretical Computer Science | 2023-01-05 | Paper |
Pattern matching with variables: efficient algorithms and complexity results
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
Reconstructing words from right-bounded-block words
Developments in Language Theory | 2022-10-13 | Paper |
Scattered Factor-Universality of Words
Developments in Language Theory | 2022-10-13 | Paper |
Graph and string parameters: connections between pathwidth, cutwidth and the locality number
(available as arXiv preprint) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7561688 (Why is no real title available?) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559139 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
String theories involving regular membership predicates: from practice to theory and back
(available as arXiv preprint) | 2022-05-20 | Paper |
An SMT solver for regular expressions and linear arithmetic over string length
(available as arXiv preprint) | 2022-03-25 | Paper |
Blocksequences of \(k\)-local words
(available as arXiv preprint) | 2022-03-24 | Paper |
Fast and longest rollercoasters
Algorithmica | 2022-03-22 | Paper |
Rollercoasters and caterpillars
(available as arXiv preprint) | 2021-07-28 | Paper |
| Accepting hybrid networks of evolutionary processors with special topologies and small communication | 2021-02-24 | Paper |
Accepting hybrid networks of evolutionary processors with special topologies and small communication
(available as arXiv preprint) | 2021-02-24 | Paper |
Detecting one-variable patterns
String Processing and Information Retrieval | 2021-02-16 | Paper |
| Small universal accepting networks of evolutionary processors with filtered connections | 2021-01-26 | Paper |
| scientific article; zbMATH DE number 7278096 (Why is no real title available?) | 2020-11-25 | Paper |
Equations enforcing repetitions under permutations
Discrete Applied Mathematics | 2020-08-31 | Paper |
The hardness of solving simple word equations
(available as arXiv preprint) | 2020-05-26 | Paper |
Matching patterns with variables
(available as arXiv preprint) | 2019-11-06 | Paper |
On solving word equations using SAT
(available as arXiv preprint) | 2019-10-22 | Paper |
\(k\)-spectra of weakly-\(c\)-balanced words
(available as arXiv preprint) | 2019-10-15 | Paper |
Rollercoasters: Long Sequences without Short Runs
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
k-Spectra of weakly-c-Balanced Words
(available as arXiv preprint) | 2019-04-19 | Paper |
Hide and seek with repetitions
Journal of Computer and System Sciences | 2019-01-25 | Paper |
Longest gapped repeats and palindromes
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2018-12-10 | Paper |
| On matching generalised repetitive patterns | 2018-11-22 | Paper |
| The satisfiability of word equations: decidable and undecidable theories | 2018-10-23 | Paper |
On the complexity of solving restricted word equations
International Journal of Foundations of Computer Science | 2018-09-20 | Paper |
Unary patterns under permutations
Theoretical Computer Science | 2018-08-23 | Paper |
Revisiting Shinohara's algorithm for computing descriptive patterns
Theoretical Computer Science | 2018-06-05 | Paper |
Tighter bounds and optimal algorithms for all maximal -gapped repeats and palindromes. Finding all maximal -gapped repeats and palindromes in optimal worst case time on integer alphabets
Theory of Computing Systems | 2018-03-01 | Paper |
Efficiently finding all maximal -gapped repeats
(available as arXiv preprint) | 2018-01-24 | Paper |
Equations enforcing repetitions under permutations
Lecture Notes in Computer Science | 2017-11-15 | Paper |
| Factorizing a String into Squares in Linear Time | 2017-10-17 | Paper |
| Testing generalised freeness of words | 2017-03-03 | Paper |
| On the pseudoperiodic extension of \(u^\ell = v^m w^n\) | 2017-02-21 | Paper |
| Finding pseudo-repetitions | 2017-01-30 | Paper |
| Pattern matching with variables: fast algorithms and new hardness results | 2017-01-24 | Paper |
The extended equation of Lyndon and Schützenberger
Journal of Computer and System Sciences | 2016-12-28 | Paper |
Small universal accepting networks of evolutionary processors with filtered connections
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
On the Solvability Problem for Restricted Classes of Word Equations
Developments in Language Theory | 2016-08-30 | Paper |
| Accepting networks of evolutionary processors with subregular filters | 2016-07-26 | Paper |
Regular languages of partial words
Information Sciences | 2016-07-08 | Paper |
On the power of accepting networks of evolutionary processors with special topologies and random context filters
Fundamenta Informaticae | 2016-05-11 | Paper |
Networks of evolutionary processors: computationally complete normal forms
Natural Computing | 2016-03-09 | Paper |
Bounded prefix-suffix duplication: language theoretic and algorithmic results
International Journal of Foundations of Computer Science | 2016-02-17 | Paper |
Hairpin lengthening: language theoretic and algorithmic results
Journal Of Logic And Computation | 2016-01-28 | Paper |
Unary patterns with permutations
Developments in Language Theory | 2015-11-10 | Paper |
Square-density increasing mappings
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Prefix-suffix square completion
Lecture Notes in Computer Science | 2015-11-04 | Paper |
On prefix/suffix-square free words
String Processing and Information Retrieval | 2015-10-02 | Paper |
Longest -gapped repeat and palindrome
Fundamentals of Computation Theory | 2015-09-29 | Paper |
Longest gapped repeats and palindromes
Lecture Notes in Computer Science | 2015-09-16 | Paper |
\(k\)-abelian pattern matching
Journal of Discrete Algorithms | 2015-08-24 | Paper |
Cubic patterns with permutations
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Inner palindromic closure
International Journal of Foundations of Computer Science | 2015-04-23 | Paper |
| On subregular selection languages in internal contextual grammars | 2015-03-16 | Paper |
Accepting networks of evolutionary processors with subregular filters
Theory of Computing Systems | 2015-02-05 | Paper |
A stronger square conjecture on binary words
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
An algorithmic toolbox for periodic partial words
Discrete Applied Mathematics | 2014-12-03 | Paper |
The pseudopalindromic completion of regular languages
Information and Computation | 2014-11-28 | Paper |
k-Abelian Pattern Matching
Developments in Language Theory | 2014-10-14 | Paper |
Generalised Lyndon-Schützenberger Equations
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Bounded prefix-suffix duplication
Implementation and Application of Automata | 2014-09-26 | Paper |
Prefix-suffix duplication
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Syllabic languages and go-through automata
Fundamenta Informaticae | 2014-05-12 | Paper |
| A universal accepting hybrid network of evolutionary processors | 2013-10-02 | Paper |
Discovering hidden repetitions in words
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Inner palindromic closure
Developments in Language Theory | 2013-06-28 | Paper |
Networks of evolutionary processors: the power of subregular filters
Acta Informatica | 2013-06-26 | Paper |
The hardness of counting full words compatible with partial words
Journal of Computer and System Sciences | 2013-02-21 | Paper |
Generating networks of splicing processors
RAIRO - Theoretical Informatics and Applications | 2012-11-22 | Paper |
String matching with involutions
Unconventional Computation and Natural Computation | 2012-11-08 | Paper |
The avoidability of cubes under permutations
Developments in Language Theory | 2012-11-02 | Paper |
On Internal Contextual Grammars with Subregular Selection Languages
Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
Hairpin Lengthening and Shortening of Regular Languages
Lecture Notes in Computer Science | 2012-11-01 | Paper |
Complexity results for deciding networks of evolutionary processors
Theoretical Computer Science | 2012-10-11 | Paper |
Fine and Wilf's theorem and pseudo-repetitions
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Connecting partial words and regular languages
Lecture Notes in Computer Science | 2012-08-14 | Paper |
On external contextual grammars with subregular selection languages
Theoretical Computer Science | 2012-08-13 | Paper |
Language classes generated by tree controlled grammars with bounded nonterminal complexity
Theoretical Computer Science | 2012-08-13 | Paper |
Deciding according to the shortest computations
Models of Computation in Context | 2011-09-09 | Paper |
Periodicity algorithms for partial words
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Deciding networks of evolutionary processors
Developments in Language Theory | 2011-07-29 | Paper |
On contextual grammars with subregular selection languages
Descriptional Complexity of Formal Systems | 2011-07-29 | Paper |
k-Local Internal Contextual Grammars
Descriptional Complexity of Formal Systems | 2011-07-29 | Paper |
| Accepting networks of evolutionary word and picture processors: a survey | 2011-07-27 | Paper |
Bounded hairpin completion
Information and Computation | 2011-07-27 | Paper |
Context insertions
Computation, Cooperation, and Life | 2011-06-24 | Paper |
On normal forms for networks of evolutionary processors
Lecture Notes in Computer Science | 2011-06-17 | Paper |
Networks of evolutionary processors with subregular filters
Language and Automata Theory and Applications | 2011-06-03 | Paper |
Complexity-preserving simulations among three variants of accepting networks of evolutionary processors
Natural Computing | 2011-05-23 | Paper |
A series of algorithmic results related to the iterated hairpin completion
Theoretical Computer Science | 2010-11-19 | Paper |
Some remarks on the hairpin completion
International Journal of Foundations of Computer Science | 2010-11-11 | Paper |
Hairpin Lengthening
Programs, Proofs, Processes | 2010-07-29 | Paper |
Hard counting problems for partial words
Language and Automata Theory and Applications | 2010-05-26 | Paper |
A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors
Theory of Computing Systems | 2010-05-10 | Paper |
Small universal accepting hybrid networks of evolutionary processors
Acta Informatica | 2010-05-05 | Paper |
All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
Information Processing Letters | 2010-03-24 | Paper |
Filter position in networks of evolutionary processors does not matter: a direct proof
Lecture Notes in Computer Science | 2010-01-07 | Paper |
Networks of Evolutionary Picture Processors with Filtered Connections
Lecture Notes in Computer Science | 2009-10-22 | Paper |
Combinatorial Queries and Updates on Partial Words
Fundamentals of Computation Theory | 2009-10-20 | Paper |
Some Remarks on Superposition Based on Watson-Crick-Like Complementarity
Developments in Language Theory | 2009-07-07 | Paper |
On some algorithmic problems regarding the hairpin completion
Discrete Applied Mathematics | 2009-06-24 | Paper |
Accepting Networks of Splicing Processors with Filtered Connections
Lecture Notes in Computer Science | 2009-03-05 | Paper |
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
Theoretical Computer Science | 2009-03-02 | Paper |
On small, reduced, and fast universal accepting networks of splicing processors
Theoretical Computer Science | 2009-03-02 | Paper |
ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS
International Journal of Foundations of Computer Science | 2008-12-01 | Paper |
| Accepting networks of evolutionary processors with filtered connections | 2008-08-07 | Paper |
All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
DNA Computing | 2008-04-04 | Paper |
| A generalization of the assignment problem, and its application to the rank aggregation problem | 2008-03-03 | Paper |
Freeness of partial words
Theoretical Computer Science | 2008-01-07 | Paper |
Hairpin Completion Versus Hairpin Reduction
Lecture Notes in Computer Science | 2007-11-13 | Paper |
On the size complexity of universal accepting hybrid networks of evolutionary processors
Mathematical Structures in Computer Science | 2007-09-06 | Paper |
On the recognition of context-free languages using accepting hybrid networks of evolutionary processors
International Journal of Computer Mathematics | 2007-06-19 | Paper |
On Some Algorithmic Problems Regarding the Hairpin Completion
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Accepting networks of splicing processors: complexity results
Theoretical Computer Science | 2007-03-12 | Paper |
| Synchronized shuffle on backbones | 2006-11-21 | Paper |
An efficient approach for the rank aggregation problem
Theoretical Computer Science | 2006-09-14 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Machines, Computations, and Universality
Lecture Notes in Computer Science | 2005-12-08 | Paper |
| scientific article; zbMATH DE number 2182427 (Why is no real title available?) | 2005-06-23 | Paper |
Solving a combinatorial problem with network flows
Journal of Applied Mathematics and Computing | 2005-03-10 | Paper |
