On the structure of run-maximal strings
to appear in Journal of Discrete algorithms
Crochemore's repetitions algorithm revisited - computing runs
to appear in International Journal of Foundations in Computer Science
Solutions to the Oberwolfach problem for orders 18 to 40
Journal of Combinatorial Math. and Combinatorial Computing, 74 (2010), 95-102 [pdf]
A different proof of Crochemore-Ilie lemma concerning microruns
London Algorithmics 2008: Theory and Practice, College Publications, pp. 1-9, 2009, [pdf]
Cliques in Steiner Systems, Mathematica Slovaka, Volume 59
(2009), Number 1, pp 109-120, [pdf]
An asymprotic lower bound for the maximal number of runs in a string
International Journal of Foundations in Computer Science, Volume 19 (2008),
Number 1, pp195-203, [pdf]
A simple fast hybrid Pattern-Matching Algorithm
Journal of Discrete Algorithms, 5 (2007), pp. 682-695, [pdf]
Reconstructing a suffix array
International Journal of Foundations in Computer Science
Volume 17 (2006), Number 6, pp. 1281-1295, [ps] or [pdf]
Two-Pattern Strings II -- Frequency of Occurrence and Substring Complexity
Journal of Discrete Algorithms 5 (2007), pp. 739-748, [ps] or [pdf]
Sorting suffixes of two-pattern strings
International Journal of Foundations in Computer Science, Volume 16 (2006),
Number 6, pp. 1135-1144, [ps] or [pdf]
Two-factorizations of small complete graphs II: the case of 13 vertices
Journal of Combinatorial Mathematics and Combinatorial Computing 51
(2004), pp. 89-94, [ps] or [pdf]
A Prototype for an Intelligent Tutoring System for Students Learning to Program in Java
International Journal of Computers and Applications. Vol 1, (2004), pp. 35-43 [pdf]
Computing all repeats using suffix arrays
Journal of Automata, Languages and Combinatorics 8 (2003) 4, 579–591.
Computing quasi suffix arrays
Journal of Automata, Languages and Combinatorics 8 (2003) 4, 593–606.
Two-Pattern Strings I - A Recognition Algorithm
Journal of Discrete Algorithms 1 (2003), pp 445-460 [ps] or [pdf]
A note on Crochemore's repetitions algorithms -- a fast space-efficient approach
Nordic Journal of Computing 10 (2003), pp. 21-28, [ps] or [pdf]
Verifying a border array in linear time
J. Combinatorial Math. and Combinatorial Computing, 42 (2002), pp. 223-236. [ps] or [pdf]
A Note on Erdö's conjecture on multiplicities of complete subgraphs, Lower upper bound
for cliques of size 6
Combinatorica, No. 3, Vol. 22 (2002), pp. 451-454, [ps] or [pdf]
Completing the spectrum of 2-chromatic S(2,4,v)
Discrete Mathematics, 247 (2002), pp. 225-228, [ps] or [pdf]
Repetitions in Sturmian Strings
Theoretical Computer Science, 249 (2002), pp. 289-303, [ps] or [pdf]
On Large Sets of v-1 L-intersecting Steiner Triple Systems of Order v
Designs, Codes, and Cryptography, 26 (2002), pp. 243-256, [ps] or [pdf]
Imbalance in tournament designs
Australasian Journal of Combinatorics, 23 (2001), pp. 237-251, [ps] or [pdf]
Two-factorizations of small complete graphs
Journal of Statistical Planning and Inference, 86 (2000), pp. 435-442, [ps] or [pdf]
On cliques in spanning graphs of projective Steiner triple systems
Journal of Combinatorial Designs, 8 (2000), pp. 157-165, [ps] or [pdf]
Exhaustive zero-convergence structures on Boolean Algebras
Acta Universitatis Carolinae - Matematica et Physica, Charles University, Prague, Czech Republic,
No. 2, Vol. 40 (1999), pp. 27-41, [ps] or [pdf]
Structural Properties of Universal Minimal Dynamical Systems for Discrete Semigroups
Transactions of the American Mathematical Society, No. 5, Vol. 349 (1997), pp. 1697-1727
[ps] or [pdf]
Triangles in 2-Factorizations
Journal of Graph Theory, 26 (1997), pp. 83-94, [ps] or [pdf]
Large Sets of Mutually Almost Disjoint Steiner Triple Systems Not From Steiner
Quadruple Systems
Designs, codes and cryptography, 12 (1997), pp. 59-67, [ps] or [pdf]
Comparison of various routines for unknown attribute value processing:
the covering paradigm
International Journal of Pattern Recognition and Artificial Intelligence, No. 8. Vol. 10 (1996),
pp. 939-955, [ps] or [pdf]
A completion conjecture for Kirkman triple systems
Utilitas Mathematica, 50 (1996), pp. 97-102, [ps] or [pdf]
Maximal Sets of Triangle-Factors in K15
Journal of Combinatorial Mathematics and Combinatorial Computing, 17 (1995), pp. 111-124
Isomorphisms of Infinite Steiner Triple Systems
Ars Combinatoria, 38 (1994), pp. 7-25, [ps] or [pdf]
2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs
Discrete Mathematics, 114 (1993), pp. 199-203, [ps] or [pdf]
Ramsey Problem on Multiplicities of Complete Subgraphs in Nearly Quasirandom Graphs
Graphs and Combinatorics, 8 (1992), pp. 299-308, [ps] or [pdf]
Maximal Partial Triple Systems of Order 13 With a Quadratic Leave: The Case of Nine Edges
Journal of Combinatorial Mathematics and Combinatorial Computing, 11 (1992), pp. 55-60
On a class of linear spaces with 16 points
Ars Combinatorica, 31 (1991), pp. 97-104, [ps] or [pdf]
Journal of Combinatorial Mathematics and Combinatorial Computing, 8 (1990), pp. 89-96
Maximal Partial Triple Systems With Hexagonal Leave
Journal of Combinatorial Mathematics and Combinatorial Computing, 5 (1989), pp. 105-118
Saturated Ideals Obtained via Restricted Iterated Collapse of Huge Cardinals
in Set Theory and its Applications (ed. J. Steprans, S. Watson), Lecture Notes in Mathematics,
No. 1401, Springer-Verlag, 1989, pp. 73-96, [ps] or [pdf]
Completion of Factor Algebras of Ideals
Proceedings of American Mathematical Society, 100 (1987), pp. 205-212
fast view by pages or download (slow) zipped pdf file [ideals.pdf.zip]
Isomorphisms of Trees
Proceedings of American Mathematical Society, 95 (1985), pp. 95-100
fast view by pages or download (slow) zipped pdf file [trees.pdf.zip]
Certain Values of Completeness and Saturatedness of a Uniform Ideal Rule out
Certain Sizes of the Underlying Index Set
Canadian Mathematical Bulletin, 28 (1985), pp. 501-504
fast view by pages or download (slow) zipped pdf file [certain.pdf.zip]
Independent families in complete Boolean algebras
Transactions of the American Mathematical Society, No. 2, Vol. 274 (1982), pp. 607-618
fast view by pages or download (slow) zipped pdf file [semifree.pdf.zip]