| Publication | Date of Publication | Type |
|---|
Reconstructing a string from its Lyndon arrays
Theoretical Computer Science | 2018-02-16 | Paper |
Bannai et al. method proves the \(d\)-step conjecture for strings
Discrete Applied Mathematics | 2017-03-15 | Paper |
Corrigendum to: ``On a lemma of Crochemore and Rytter''
Journal of Discrete Algorithms | 2016-12-09 | Paper |
The new periodicity lemma revisited
Discrete Applied Mathematics | 2016-09-12 | Paper |
A computational substantiation of the d-step approach to the number of distinct squares problem
Discrete Applied Mathematics | 2016-09-12 | Paper |
A d-step approach to the maximum number of distinct squares and runs in strings
Discrete Applied Mathematics | 2015-09-22 | Paper |
On a lemma of Crochemore and Rytter
Journal of Discrete Algorithms | 2015-08-24 | Paper |
How many double squares can a string contain?
Discrete Applied Mathematics | 2014-11-28 | Paper |
A computational framework for determining run-maximal strings
Journal of Discrete Algorithms | 2014-08-13 | Paper |
| scientific article; zbMATH DE number 6316138 (Why is no real title available?) | 2014-07-10 | Paper |
More results on overlapping squares
Journal of Discrete Algorithms | 2013-06-24 | Paper |
On a conjecture of Erdős for multiplicities of cliques
Journal of Discrete Algorithms | 2013-06-24 | Paper |
Crochemore's repetitions algorithm revisited: computing runs
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
On the structure of run-maximal strings
Journal of Discrete Algorithms | 2012-05-11 | Paper |
| scientific article; zbMATH DE number 5917757 (Why is no real title available?) | 2011-07-06 | Paper |
A d-step approach for distinct squares in strings
Combinatorial Pattern Matching | 2011-06-29 | Paper |
| A different proof of the Crochemore-Ilie lemma concerning microruns | 2011-03-25 | Paper |
Cliques in Steiner systems
Mathematica Slovaca | 2009-02-09 | Paper |
AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
International Journal of Foundations of Computer Science | 2008-11-03 | Paper |
A simple fast hybrid pattern-matching algorithm
Journal of Discrete Algorithms | 2008-05-29 | Paper |
Two-pattern strings. II: Frequency of occurrence and substring complexity
Journal of Discrete Algorithms | 2008-05-29 | Paper |
RECONSTRUCTING A SUFFIX ARRAY
International Journal of Foundations of Computer Science | 2007-02-08 | Paper |
SORTING SUFFIXES OF TWO-PATTERN STRINGS
International Journal of Foundations of Computer Science | 2005-12-15 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
| scientific article; zbMATH DE number 2148767 (Why is no real title available?) | 2005-03-21 | Paper |
| scientific article; zbMATH DE number 2105038 (Why is no real title available?) | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2105037 (Why is no real title available?) | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2087045 (Why is no real title available?) | 2004-08-11 | Paper |
Two-pattern strings. I: A recognition algorithm
Journal of Discrete Algorithms | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2052916 (Why is no real title available?) | 2004-03-08 | Paper |
On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6
Combinatorica | 2003-05-18 | Paper |
| scientific article; zbMATH DE number 1874382 (Why is no real title available?) | 2003-04-06 | Paper |
On large sets of v-1 L-intersecting Steiner triple systems of order v
Designs, Codes and Cryptography | 2002-08-21 | Paper |
Completing the spectrum of 2-chromatic \(S(2,4,v)\)
Discrete Mathematics | 2002-05-28 | Paper |
Imbalance in tournament designs
The Australasian Journal of Combinatorics | 2001-10-21 | Paper |
| scientific article; zbMATH DE number 1462936 (Why is no real title available?) | 2000-12-03 | Paper |
| scientific article; zbMATH DE number 1530996 (Why is no real title available?) | 2000-11-15 | Paper |
Two-factorizations of small complete graphs
Journal of Statistical Planning and Inference | 2000-07-09 | Paper |
Large sets of mutually almost disjoint Steiner triple systems not from Steiner quadruple systems
Designs, Codes and Cryptography | 1998-07-06 | Paper |
| scientific article; zbMATH DE number 1080948 (Why is no real title available?) | 1998-03-24 | Paper |
Structural properties of universal minimal dynamical systems for discrete semigroups
Transactions of the American Mathematical Society | 1997-05-13 | Paper |
A completion conjecture for Kirkman triple systems
Utilitas Mathematica | 1997-04-21 | Paper |
| scientific article; zbMATH DE number 734455 (Why is no real title available?) | 1995-07-13 | Paper |
| scientific article; zbMATH DE number 749264 (Why is no real title available?) | 1995-05-01 | Paper |
2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
Discrete Mathematics | 1993-10-24 | Paper |
Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
Graphs and Combinatorics | 1993-04-01 | Paper |
| scientific article; zbMATH DE number 89393 (Why is no real title available?) | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 21732 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 22643 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 3655 (Why is no real title available?) | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 4123721 (Why is no real title available?) | 1989-01-01 | Paper |
| Completion of Factor Algebras of Ideals | 1987-01-01 | Paper |
| Isomorphisms of Trees | 1985-01-01 | Paper |
Certain Values of Completeness and Saturatedness of a Uniform Ideal Rule out Certain Sizes of The Underlying Index Set
Canadian Mathematical Bulletin | 1985-01-01 | Paper |
| Independent Families in Complete Boolean Algebras | 1982-01-01 | Paper |
