| Publication | Date of Publication | Type |
|---|
Vertically constrained Motzkin-like paths inspired by bobbin lace
The Electronic Journal of Combinatorics | 2019-05-20 | Paper |
Vertically constrained Motzkin-like paths inspired by bobbin lace
The Electronic Journal of Combinatorics | 2019-05-20 | Paper |
| Minimum area polyomino Venn diagrams | 2017-03-09 | Paper |
On prefix normal words and prefix normal forms
Theoretical Computer Science | 2016-12-23 | Paper |
An Eades-McKay algorithm for well-formed parentheses strings
Information Processing Letters | 2016-06-09 | Paper |
Developing a mathematical model for bobbin lace
Journal of Mathematics and the Arts | 2015-12-01 | Paper |
| All Simple Venn Diagrams are Hamiltonian | 2015-04-24 | Paper |
An explicit universal cycle for the (n-1)-permutations of an n-set
ACM Transactions on Algorithms | 2014-11-18 | Paper |
New roses: simple symmetric Venn diagrams with 11 and 13 curves
Discrete & Computational Geometry | 2014-09-19 | Paper |
In-place permuting and perfect shuffling using involutions
Information Processing Letters | 2014-08-13 | Paper |
On combinatorial generation of prefix normal words
Combinatorial Pattern Matching | 2014-06-30 | Paper |
| Generating Tatami Coverings Efficiently | 2014-03-19 | Paper |
| Counting strings over \(\mathbb Z2^d\) with given elementary symmetric function evaluations | 2014-02-18 | Paper |
Domino tatami covering is NP-complete
Lecture Notes in Computer Science | 2014-01-17 | Paper |
| Towards a general solution to drawing area-proportional Euler diagrams | 2013-09-26 | Paper |
| Morphic Words and Nested Recurrence Relations | 2013-06-29 | Paper |
The first simple symmetric 11-Venn diagram
Graph Drawing | 2013-04-03 | Paper |
| Enumerating maximal tatami mat coverings of square grids with $v$ vertical dominoes | 2013-03-30 | Paper |
Cool-lex order and k-ary Catalan structures
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Generating simple convex Venn diagrams
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Counting and computing the Rand and block distances of pairs of set partitions
Journal of Discrete Algorithms | 2013-01-18 | Paper |
The feline Josephus problem
Theory of Computing Systems | 2012-12-06 | Paper |
Shorthand universal cycles for permutations
Algorithmica | 2012-11-21 | Paper |
| Isoperimetric Sequences for Infinite Complete Binary Trees, Meta-Fibonacci Sequences and Signed Almost Binary Partitions | 2012-10-01 | Paper |
De Bruijn sequences for fixed-weight binary strings
SIAM Journal on Discrete Mathematics | 2012-09-12 | Paper |
Nested recurrence relations with Conolly-like solutions
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
An undecidable nested recurrence relation
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams
Lecture Notes in Computer Science | 2012-01-13 | Paper |
The Rand and Block Distances of Pairs of Set Partitions
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Minimum Area Venn Diagrams Whose Curves Are Polyominoes
Mathematics Magazine | 2011-12-07 | Paper |
Binary bubble languages and cool-lex order
Journal of Combinatorial Theory. Series A | 2011-11-11 | Paper |
Spherical Venn diagrams with involutory isometries
The Electronic Journal of Combinatorics | 2011-10-18 | Paper |
| Fibonacci meets Hofstadter | 2011-08-16 | Paper |
Monomer-dimer tatami tilings of rectangular regions
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Monomer-dimer tatami tilings of rectangular regions
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Efficient coroutine generation of constrained Gray sequences
From Object-Orientation to Formal Methods | 2011-04-01 | Paper |
| Hamming distance from irreducible polynomials over \(\mathbb F_2\) | 2010-08-02 | Paper |
Faster generation of shorthand universal cycles for permutations
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Auspicious tatami mat arrangements
Lecture Notes in Computer Science | 2010-07-20 | Paper |
| Generalized meta-Fibonacci sequences | 2010-07-05 | Paper |
| scientific article; zbMATH DE number 5688289 (Why is no real title available?) | 2010-03-30 | Paper |
| scientific article; zbMATH DE number 5688289 (Why is no real title available?) | 2010-03-30 | Paper |
Counting fixed-height tatami tilings
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Counting fixed-height tatami tilings
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Gray codes for column-convex polyominoes and a new class of distributive lattices
Discrete Mathematics | 2009-12-15 | Paper |
The coolest way to generate combinations
Discrete Mathematics | 2009-12-15 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
| scientific article; zbMATH DE number 5577875 (Why is no real title available?) | 2009-07-13 | Paper |
| scientific article; zbMATH DE number 5577875 (Why is no real title available?) | 2009-07-13 | Paper |
A CAT algorithm for generating permutations with a fixed number of inversions
Information Processing Letters | 2009-03-23 | Paper |
| The search for simple symmetric Venn diagrams | 2008-03-19 | Paper |
Which \(n\)-Venn diagrams can be drawn with convex \(k\)-gons?
Discrete & Computational Geometry | 2007-06-21 | Paper |
More fun with symmetric Venn diagrams
Theory of Computing Systems | 2007-02-13 | Paper |
| Sequences that satisfy \(a(n-a(n))=0\) | 2006-10-30 | Paper |
| Sequences that satisfy \(a(n-a(n))=0\) | 2006-10-30 | Paper |
Meta-Fibonacci sequences, binary trees and extremal compact codes
The Electronic Journal of Combinatorics | 2006-03-22 | Paper |
Meta-Fibonacci sequences, binary trees and extremal compact codes
The Electronic Journal of Combinatorics | 2006-03-22 | Paper |
Meta-Fibonacci sequences, binary trees and extremal compact codes
The Electronic Journal of Combinatorics | 2006-03-22 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
| scientific article; zbMATH DE number 2226731 (Why is no real title available?) | 2005-11-08 | Paper |
Half-simple symmetric Venn diagrams
The Electronic Journal of Combinatorics | 2005-04-25 | Paper |
Half-simple symmetric Venn diagrams
The Electronic Journal of Combinatorics | 2005-04-25 | Paper |
Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Counting Strings with Given Elementary Symmetric Function Evaluations I: Strings over \boldmath$\mathbbZ_p$ with<i>p</i>Prime
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
| scientific article; zbMATH DE number 2061795 (Why is no real title available?) | 2004-03-25 | Paper |
| scientific article; zbMATH DE number 1974144 (Why is no real title available?) | 2003-09-03 | Paper |
Generating Lyndon brackets.
Journal of Algorithms | 2003-08-13 | Paper |
Bent Hamilton cycles in \(d\)-dimensional grid graphs
The Electronic Journal of Combinatorics | 2003-05-13 | Paper |
Bent Hamilton cycles in \(d\)-dimensional grid graphs
The Electronic Journal of Combinatorics | 2003-05-13 | Paper |
| scientific article; zbMATH DE number 1696649 (Why is no real title available?) | 2002-07-22 | Paper |
Ranking and unranking permutations in linear time
Information Processing Letters | 2002-07-14 | Paper |
The number of irreducible polynomials and Lyndon words with given trace
SIAM Journal on Discrete Mathematics | 2001-06-21 | Paper |
| scientific article; zbMATH DE number 1445312 (Why is no real title available?) | 2000-05-10 | Paper |
An Efficient Algorithm for Generating Necklaces with Fixed Density
SIAM Journal on Computing | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1305528 (Why is no real title available?) | 2000-01-25 | Paper |
Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
Journal of Algorithms | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 1354135 (Why is no real title available?) | 1999-10-31 | Paper |
| scientific article; zbMATH DE number 1305469 (Why is no real title available?) | 1999-06-17 | Paper |
Venn diagrams with few vertices
The Electronic Journal of Combinatorics | 1998-10-27 | Paper |
Venn diagrams with few vertices
The Electronic Journal of Combinatorics | 1998-10-27 | Paper |
Completely separating systems of k-sets
Discrete Mathematics | 1998-07-19 | Paper |
A survey of Venn diagrams
The Electronic Journal of Combinatorics | 1998-02-22 | Paper |
Three-dimensional graph drawing
Algorithmica | 1997-06-30 | Paper |
The Hamiltonicity of directed \(\sigma\)-\(\tau\) Cayley graphs (Or: A tale of backtracking)
Discrete Applied Mathematics | 1996-12-05 | Paper |
A Gray code for combinations of a multiset
European Journal of Combinatorics | 1996-09-30 | Paper |
Transition restricted Gray codes
The Electronic Journal of Combinatorics | 1996-07-21 | Paper |
Transition restricted Gray codes
The Electronic Journal of Combinatorics | 1996-07-21 | Paper |
| scientific article; zbMATH DE number 840688 (Why is no real title available?) | 1996-06-17 | Paper |
Determining the Hamilton-connectedness of certain vertex-transitive graphs
Discrete Mathematics | 1995-11-09 | Paper |
| scientific article; zbMATH DE number 731846 (Why is no real title available?) | 1995-07-09 | Paper |
The prism of the acyclic orientation graph is Hamiltonian
The Electronic Journal of Combinatorics | 1995-04-06 | Paper |
The prism of the acyclic orientation graph is Hamiltonian
The Electronic Journal of Combinatorics | 1995-04-06 | Paper |
Generating Linear Extensions Fast
SIAM Journal on Computing | 1995-01-22 | Paper |
Gray codes from antimatroids
Order | 1994-06-22 | Paper |
| scientific article; zbMATH DE number 553907 (Why is no real title available?) | 1994-04-21 | Paper |
A Gray Code for the Ideals of a Forest Poset
Journal of Algorithms | 1994-03-02 | Paper |
On Rotations and the Generation of Binary Trees
Journal of Algorithms | 1994-01-23 | Paper |
Generating linear extensions of posets by transpositions
Journal of Combinatorial Theory. Series B | 1993-08-18 | Paper |
Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
SIAM Journal on Discrete Mathematics | 1993-06-29 | Paper |
Generating permutations of a bag by interchanges
Information Processing Letters | 1993-01-16 | Paper |
Generating necklaces
Journal of Algorithms | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 65462 (Why is no real title available?) | 1992-09-27 | Paper |
Generating permutations with given ups and downs
Discrete Applied Mathematics | 1992-06-28 | Paper |
Generating the Linear Extensions of Certain Posets by Transpositions
SIAM Journal on Discrete Mathematics | 1992-06-28 | Paper |
Generating binary trees by transpositions
Journal of Algorithms | 1990-01-01 | Paper |
Generating alternating permutations lexicographically
BIT | 1990-01-01 | Paper |
Transposition generation of alternating permutations
Order | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4106841 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4062616 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4106894 (Why is no real title available?) | 1988-01-01 | Paper |
Generating t-ary trees in A-order
Information Processing Letters | 1988-01-01 | Paper |
Adjacent interchange generation of combinations
Journal of Algorithms | 1988-01-01 | Paper |
Solution of some multi-dimensional lattice path parity difference recurrence relations
Discrete Mathematics | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4055654 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4128814 (Why is no real title available?) | 1987-01-01 | Paper |
Binary tree gray codes
Journal of Algorithms | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3864523 (Why is no real title available?) | 1984-01-01 | Paper |
A simple proof of a formula of Dershowitz and Zaks
Discrete Mathematics | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3858431 (Why is no real title available?) | 1982-01-01 | Paper |
On unary stochastic Lindenmayer systems
Information and Control | 1981-01-01 | Paper |
Listing and Counting Subtrees of a Tree
SIAM Journal on Computing | 1981-01-01 | Paper |
On the Average Shape of Binary Trees
SIAM Journal on Algebraic Discrete Methods | 1980-01-01 | Paper |
An algorithm for the most economic link addition in a tree communications network
Information Processing Letters | 1979-01-01 | Paper |
Generating <i>t</i>-Ary Trees Lexicographically
SIAM Journal on Computing | 1978-01-01 | Paper |
