| Publication | Date of Publication | Type |
|---|
| Matching patterns with variables under Simon's congruence | 2024-10-23 | Paper |
| On the structure of solution-sets to regular word equations | 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 | 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 |
| https://portal.mardi4nfdi.de/entity/Q6190431 | 2024-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6190877 | 2024-02-06 | Paper |
| Absent Subsequences in Words | 2023-11-23 | Paper |
| Reconstructing Words from Right-Bounded-Block Words | 2023-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168464 | 2023-08-08 | Paper |
| Matching patterns with variables under edit distance | 2023-08-04 | Paper |
| Longest Common Subsequence with Gap Constraints | 2023-07-25 | Paper |
| Subsequences in bounded ranges: matching and analysis problems | 2023-07-21 | Paper |
| Absent subsequences in words | 2023-03-31 | Paper |
| Towards more efficient methods for solving regular-expression heavy string constraints | 2023-01-05 | Paper |
| Pattern Matching with Variables | 2022-12-05 | Paper |
| Reconstructing Words from Right-Bounded-Block Words | 2022-10-13 | Paper |
| Scattered Factor-Universality of Words | 2022-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092406 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091271 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090479 | 2022-07-18 | Paper |
| String theories involving regular membership predicates: from practice to theory and back | 2022-05-20 | Paper |
| An SMT solver for regular expressions and linear arithmetic over string length | 2022-03-25 | Paper |
| Blocksequences of \(k\)-local words | 2022-03-24 | Paper |
| Fast and longest rollercoasters | 2022-03-22 | Paper |
| Rollercoasters and Caterpillars | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4964011 | 2021-02-24 | Paper |
| Detecting One-Variable Patterns | 2021-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146527 | 2021-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136316 | 2020-11-25 | Paper |
| Equations enforcing repetitions under permutations | 2020-08-31 | Paper |
| The hardness of solving simple word equations | 2020-05-26 | Paper |
| Matching patterns with variables | 2019-11-06 | Paper |
| On solving word equations using SAT | 2019-10-22 | Paper |
| \(k\)-spectra of weakly-\(c\)-balanced words | 2019-10-15 | Paper |
| Rollercoasters: Long Sequences without Short Runs | 2019-08-29 | Paper |
| k-Spectra of weakly-c-Balanced Words | 2019-04-19 | Paper |
| Hide and seek with repetitions | 2019-01-25 | Paper |
| Longest Gapped Repeats and Palindromes | 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 | 2018-09-20 | Paper |
| Unary patterns under permutations | 2018-08-23 | Paper |
| Revisiting Shinohara's algorithm for computing descriptive patterns | 2018-06-05 | Paper |
| Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets | 2018-03-01 | Paper |
| Efficiently Finding All Maximal alpha-gapped Repeats | 2018-01-24 | Paper |
| Equations enforcing repetitions under permutations | 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^l = v^m w^n | 2017-02-21 | Paper |
| Finding Pseudo-Repetitions | 2017-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2955004 | 2017-01-24 | Paper |
| The extended equation of Lyndon and Schützenberger | 2016-12-28 | Paper |
| Small universal accepting networks of evolutionary processors with filtered connections | 2016-09-29 | Paper |
| On the Solvability Problem for Restricted Classes of Word Equations | 2016-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740429 | 2016-07-26 | Paper |
| Regular languages of partial words | 2016-07-08 | Paper |
| On the power of accepting networks of evolutionary processors with special topologies and random context filters | 2016-05-11 | Paper |
| Networks of evolutionary processors: computationally complete normal forms | 2016-03-09 | Paper |
| Bounded Prefix-Suffix Duplication: Language Theoretic and Algorithmic Results | 2016-02-17 | Paper |
| Hairpin lengthening: language theoretic and algorithmic results | 2016-01-28 | Paper |
| Unary Patterns with Permutations | 2015-11-10 | Paper |
| Prefix-Suffix Square Completion | 2015-11-04 | Paper |
| Square-Density Increasing Mappings | 2015-11-04 | Paper |
| On Prefix/Suffix-Square Free Words | 2015-10-02 | Paper |
| Longest $$\alpha $$-Gapped Repeat and Palindrome | 2015-09-29 | Paper |
| Longest Gapped Repeats and Palindromes | 2015-09-16 | Paper |
| \(k\)-abelian pattern matching | 2015-08-24 | Paper |
| Cubic patterns with permutations | 2015-07-13 | Paper |
| INNER PALINDROMIC CLOSURE | 2015-04-23 | Paper |
| On Subregular Selection Languages in Internal Contextual Grammars. | 2015-03-16 | Paper |
| Accepting networks of evolutionary processors with subregular filters | 2015-02-05 | Paper |
| A Stronger Square Conjecture on Binary Words | 2015-01-13 | Paper |
| An algorithmic toolbox for periodic partial words | 2014-12-03 | Paper |
| The pseudopalindromic completion of regular languages | 2014-11-28 | Paper |
| k-Abelian Pattern Matching | 2014-10-14 | Paper |
| Generalised Lyndon-Schützenberger Equations | 2014-10-14 | Paper |
| Bounded Prefix-Suffix Duplication | 2014-09-26 | Paper |
| Prefix-suffix duplication | 2014-06-10 | Paper |
| Syllabic Languages and Go-through Automata | 2014-05-12 | Paper |
| A universal accepting hybrid network of evolutionary processors | 2013-10-02 | Paper |
| Discovering Hidden Repetitions in Words | 2013-08-05 | Paper |
| Inner Palindromic Closure | 2013-06-28 | Paper |
| Networks of evolutionary processors: the power of subregular filters | 2013-06-26 | Paper |
| The hardness of counting full words compatible with partial words | 2013-02-21 | Paper |
| Generating Networks of Splicing Processors | 2012-11-22 | Paper |
| String Matching with Involutions | 2012-11-08 | Paper |
| The Avoidability of Cubes under Permutations | 2012-11-02 | Paper |
| On Internal Contextual Grammars with Subregular Selection Languages | 2012-11-02 | Paper |
| Hairpin Lengthening and Shortening of Regular Languages | 2012-11-01 | Paper |
| Complexity results for deciding networks of evolutionary processors | 2012-10-11 | Paper |
| Fine and Wilf’s Theorem and Pseudo-repetitions | 2012-09-25 | Paper |
| Connecting Partial Words and Regular Languages | 2012-08-14 | Paper |
| On external contextual grammars with subregular selection languages | 2012-08-13 | Paper |
| Language classes generated by tree controlled grammars with bounded nonterminal complexity | 2012-08-13 | Paper |
| Deciding According to the Shortest Computations | 2011-09-09 | Paper |
| Periodicity Algorithms for Partial Words | 2011-08-17 | Paper |
| k-Local Internal Contextual Grammars | 2011-07-29 | Paper |
| Deciding Networks of Evolutionary Processors | 2011-07-29 | Paper |
| On Contextual Grammars with Subregular Selection Languages | 2011-07-29 | Paper |
| Bounded hairpin completion | 2011-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3018967 | 2011-07-27 | Paper |
| Context Insertions | 2011-06-24 | Paper |
| On Normal Forms for Networks of Evolutionary Processors | 2011-06-17 | Paper |
| Networks of Evolutionary Processors with Subregular Filters | 2011-06-03 | Paper |
| Complexity-preserving simulations among three variants of accepting networks of evolutionary processors | 2011-05-23 | Paper |
| A series of algorithmic results related to the iterated hairpin completion | 2010-11-19 | Paper |
| SOME REMARKS ON THE HAIRPIN COMPLETION | 2010-11-11 | Paper |
| Hairpin Lengthening | 2010-07-29 | Paper |
| Hard Counting Problems for Partial Words | 2010-05-26 | Paper |
| A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors | 2010-05-10 | Paper |
| Small universal accepting hybrid networks of evolutionary processors | 2010-05-05 | Paper |
| All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size | 2010-03-24 | Paper |
| Filter position in networks of evolutionary processors does not matter: a direct proof | 2010-01-07 | Paper |
| Networks of Evolutionary Picture Processors with Filtered Connections | 2009-10-22 | Paper |
| Combinatorial Queries and Updates on Partial Words | 2009-10-20 | Paper |
| Some Remarks on Superposition Based on Watson-Crick-Like Complementarity | 2009-07-07 | Paper |
| On some algorithmic problems regarding the hairpin completion | 2009-06-24 | Paper |
| Accepting Networks of Splicing Processors with Filtered Connections | 2009-03-05 | Paper |
| Two complementary operations inspired by the DNA hairpin formation: Completion and reduction | 2009-03-02 | Paper |
| On small, reduced, and fast universal accepting networks of splicing processors | 2009-03-02 | Paper |
| ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS | 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 | 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 | 2008-01-07 | Paper |
| Hairpin Completion Versus Hairpin Reduction | 2007-11-13 | Paper |
| On the size complexity of universal accepting hybrid networks of evolutionary processors | 2007-09-06 | Paper |
| On the recognition of context-free languages using accepting hybrid networks of evolutionary processors | 2007-06-19 | Paper |
| On Some Algorithmic Problems Regarding the Hairpin Completion | 2007-05-29 | Paper |
| Accepting networks of splicing processors: complexity results | 2007-03-12 | Paper |
| Synchronized shuffle on backbones | 2006-11-21 | Paper |
| An efficient approach for the rank aggregation problem | 2006-09-14 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| Machines, Computations, and Universality | 2005-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3022294 | 2005-06-23 | Paper |
| Solving a combinatorial problem with network flows | 2005-03-10 | Paper |
