| Publication | Date of Publication | Type |
|---|
Counting subwords in circular words and their Parikh matrices
Theoretical Computer Science | 2024-01-08 | Paper |
| scientific article; zbMATH DE number 7283890 (Why is no real title available?) | 2020-12-10 | Paper |
| Permutations in which pairs of numbers are not simultaneously close in position and close in size | 2020-12-10 | Paper |
More properties of the Fibonacci word on an infinite alphabet
Theoretical Computer Science | 2019-10-18 | Paper |
More properties of the Fibonacci word on an infinite alphabet
Theoretical Computer Science | 2019-10-18 | Paper |
| A new approach to the Fraenkel conjecture for low \(n\) values | 2019-09-25 | Paper |
A new approach to the Fraenkel conjecture for low \(n\) values
(available as arXiv preprint) | 2019-09-25 | Paper |
| Palindromes in starlike trees | 2019-05-23 | Paper |
Palindromes in starlike trees
(available as arXiv preprint) | 2019-05-23 | Paper |
| Solved and unsolved problems about abelian squares | 2018-02-13 | Paper |
Counting Lyndon factors
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
Counting Lyndon factors
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
Enhanced covers of regular and indeterminate strings using prefix tables
(available as arXiv preprint) | 2017-06-13 | Paper |
An abelian periodicity lemma
Theoretical Computer Science | 2017-02-06 | Paper |
Symmetric difference-free and symmetric difference-closed collections of sets
Graphs and Combinatorics | 2015-01-20 | Paper |
Palindromes in circular words
Theoretical Computer Science | 2014-08-26 | Paper |
Corrigendum to: ``The exact number of squares in Fibonacci words
Theoretical Computer Science | 2014-07-25 | Paper |
The total run length of a word
Theoretical Computer Science | 2014-01-10 | Paper |
Intersecting rational Beatty sequences
Integers | 2013-10-25 | Paper |
More results on overlapping squares
Journal of Discrete Algorithms | 2013-06-24 | Paper |
A general two-term recurrence
European Journal of Combinatorics | 2013-03-06 | Paper |
| Minimizing the weight of the union-closure of families of two-sets | 2012-10-21 | Paper |
| A note on the union-closed sets conjecture | 2011-04-18 | Paper |
| scientific article; zbMATH DE number 5717191 (Why is no real title available?) | 2010-06-07 | Paper |
Incongruent restricted disjoint covering systems
Discrete Mathematics | 2009-12-10 | Paper |
Intersecting periodic words
Theoretical Computer Science | 2009-06-22 | Paper |
Words with simple Burrows-Wheeler transforms
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Words with simple Burrows-Wheeler transforms
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
| The expected number of runs in a word | 2009-01-15 | Paper |
How many runs can a string contain?
Theoretical Computer Science | 2008-07-31 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
| scientific article; zbMATH DE number 2186972 (Why is no real title available?) | 2005-07-13 | Paper |
An extension of the periodicity lemma to longer periods
Discrete Applied Mathematics | 2005-02-22 | Paper |
| scientific article; zbMATH DE number 2124084 (Why is no real title available?) | 2005-01-03 | Paper |
| scientific article; zbMATH DE number 2124084 (Why is no real title available?) | 2005-01-03 | Paper |
| scientific article; zbMATH DE number 1990002 (Why is no real title available?) | 2003-10-12 | Paper |
On disjoint covering systems with precisely one repeated modulus
Advances in Applied Mathematics | 2003-06-15 | Paper |
Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester
Proceedings of the American Mathematical Society | 2003-02-19 | Paper |
| scientific article; zbMATH DE number 1786449 (Why is no real title available?) | 2002-08-21 | Paper |
Non-repetitive tilings
The Electronic Journal of Combinatorics | 2002-07-25 | Paper |
Non-repetitive tilings
The Electronic Journal of Combinatorics | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1740162 (Why is no real title available?) | 2002-05-14 | Paper |
The subword complexity of a two-parameter family of sequences
The Electronic Journal of Combinatorics | 2001-10-16 | Paper |
The subword complexity of a two-parameter family of sequences
The Electronic Journal of Combinatorics | 2001-10-16 | Paper |
Aviezri Fraenkel's work in number theory
The Electronic Journal of Combinatorics | 2001-10-16 | Paper |
Aviezri Fraenkel's work in number theory
The Electronic Journal of Combinatorics | 2001-10-16 | Paper |
Covering systems of homogeneous congruences
Rocky Mountain Journal of Mathematics | 1999-09-14 | Paper |
The exact number of squares in Fibonacci words
Theoretical Computer Science | 1999-06-21 | Paper |
| scientific article; zbMATH DE number 1126974 (Why is no real title available?) | 1998-10-27 | Paper |
How many squares can a string contain?
Journal of Combinatorial Theory. Series A | 1998-10-18 | Paper |
Edge-disjoint maximal planar graphs
Discrete Mathematics | 1998-01-26 | Paper |
| scientific article; zbMATH DE number 1051275 (Why is no real title available?) | 1997-11-12 | Paper |
| scientific article; zbMATH DE number 812042 (Why is no real title available?) | 1995-11-02 | Paper |
How many squares must a binary sequence contain?
The Electronic Journal of Combinatorics | 1995-04-06 | Paper |
How many squares must a binary sequence contain?
The Electronic Journal of Combinatorics | 1995-04-06 | Paper |
| scientific article; zbMATH DE number 540111 (Why is no real title available?) | 1995-01-22 | Paper |
| scientific article; zbMATH DE number 653236 (Why is no real title available?) | 1994-10-12 | Paper |
Beatty sequences and Langford sequences
Discrete Mathematics | 1994-06-26 | Paper |
| On Infinite Disjoint Covering Systems | 1994-03-17 | Paper |
| scientific article; zbMATH DE number 469020 (Why is no real title available?) | 1994-01-26 | Paper |
Disjoint covering systems of rational Beatty sequences
Discrete Mathematics | 1992-06-28 | Paper |
Necessary conditions for distinct covering systems with square-free moduli
Acta Arithmetica | 1991-01-01 | Paper |
| Greedily Partitioning the Natural Numbers into Sets Free of Arithmetic Progressions | 1988-01-01 | Paper |
Exact coverings of the integers by arithmetic progressions
Discrete Mathematics | 1986-01-01 | Paper |
Regular coverings of the integers by arithmetic progressions
Acta Arithmetica | 1985-01-01 | Paper |
Covering the integers with arithmetic progressions
Bulletin of the Australian Mathematical Society | 1985-01-01 | Paper |
Palindromic Periodicities
(available as arXiv preprint) | N/A | Paper |
