| Publication | Date of Publication | Type |
|---|
| On the Number of Distinct Squares in Finite Sequences: Some Old and New Results | 2023-07-25 | Paper |
| On the number of squares in a finite word | 2022-04-21 | Paper |
| Burrows-Wheeler transform of words defined by morphisms | 2020-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4591318 | 2017-11-14 | Paper |
| Reconstructing binary matrices with timetabling constraints | 2016-12-09 | Paper |
| A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences | 2016-07-15 | Paper |
| Efficient operations on discrete paths | 2016-04-01 | Paper |
| Interactions between Digital Geometry and Combinatorics on Words | 2016-03-01 | Paper |
| Palindromic Complexity of Trees | 2015-11-10 | Paper |
| Reconstructing Words from a σ-palindromic Language | 2015-06-26 | Paper |
| Efficient Computation of the Outer Hull of a Discrete Path | 2014-09-15 | Paper |
| Exhaustive generation of atomic combinatorial differential operators | 2014-05-06 | Paper |
| Codings of rotations on two intervals are full | 2013-10-10 | Paper |
| COMPLEXITY OF THE FIBONACCI SNOWFLAKE | 2013-07-03 | Paper |
| A parallelogram tile fills the plane by translation in at most two distinct ways | 2012-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2888159 | 2012-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2883386 | 2012-05-10 | Paper |
| Combinatorial variations on Cantor's diagonal | 2012-02-11 | Paper |
| Palindromic complexity of codings of rotations | 2011-12-07 | Paper |
| Two infinite families of polyominoes that tile the plane by translation in two distinct ways | 2011-09-12 | Paper |
| A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) | 2011-09-12 | Paper |
| Equations on palindromes and circular words | 2011-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3077342 | 2011-02-22 | Paper |
| Complexity and palindromic defect of infinite words | 2011-02-02 | Paper |
| Discrete Geometry for Computer Imagery | 2010-01-05 | Paper |
| PCIF: An Algorithm for Lossless True Color Image Compression | 2009-12-11 | Paper |
| Christoffel and Fibonacci Tiles | 2009-12-01 | Paper |
| A Linear Time and Space Algorithm for Detecting Path Intersection | 2009-12-01 | Paper |
| Lyndon + Christoffel = digitally convex | 2009-08-19 | Paper |
| On the tiling by translation problem | 2009-03-04 | Paper |
| Discrete sets with minimal moment of inertia | 2008-11-12 | Paper |
| On the critical exponent of generalized Thue-Morse words | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387710 | 2008-05-27 | Paper |
| Combinatorial View of Digital Convexity | 2008-04-24 | Paper |
| On Minimal Moment of Inertia Polyominoes | 2008-04-24 | Paper |
| An Optimal Algorithm for Detecting Pseudo-squares | 2008-04-17 | Paper |
| Smooth words on 2-letter alphabets having same parity | 2008-04-15 | Paper |
| Shuffle operations on discrete paths | 2008-03-05 | Paper |
| PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS | 2006-08-14 | Paper |
| Developments in Language Theory | 2006-06-23 | Paper |
| Non-uniform random generation of generalized Motzkin paths | 2006-05-26 | Paper |
| Combinatorial properties of smooth infinite words | 2006-03-24 | Paper |
| Tilings by translation: enumeration by a rational language approach | 2006-02-16 | Paper |
| The discrete Green theorem and some applications in discrete geometry | 2006-01-10 | Paper |
| Cantorian tableaux and permanents | 2005-09-28 | Paper |
| Smooth words over arbitrary alphabets | 2005-09-22 | Paper |
| On the equivalence problem for succession rules | 2005-09-22 | Paper |
| Algorithms for polyominoes based on the discrete Green theorem | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4663912 | 2005-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453472 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428901 | 2003-09-22 | Paper |
| A note on differentiable palindromes. | 2003-08-17 | Paper |
| On a valuation of rational subsets of \(Z^{k}\) | 2003-01-22 | Paper |
| A relative of the Thue-Morse sequence | 1996-06-19 | Paper |
| On-line evaluation of powers using Euclid's algorithm | 1996-02-01 | Paper |
| Efficient computation of addition chains | 1995-05-15 | Paper |
| Optimal word chains for the Thue-Morse word | 1989-01-01 | Paper |
| Enumeration of factors in the Thue-Morse word | 1989-01-01 | Paper |
| Addition chains using continued fractions | 1989-01-01 | Paper |
| On the length of word chains | 1987-01-01 | Paper |
