| Publication | Date of Publication | Type |
|---|
| Vertically constrained Motzkin-like paths inspired by bobbin lace | 2019-05-20 | Paper |
| Minimum area polyomino Venn diagrams | 2017-03-09 | Paper |
| On prefix normal words and prefix normal forms | 2016-12-23 | Paper |
| An Eades-McKay algorithm for well-formed parentheses strings | 2016-06-09 | Paper |
| Developing a mathematical model for bobbin lace | 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 | 2014-11-18 | Paper |
| An explicit universal cycle for the \((n-1)\)-permutations of an \(n\)-set | 2014-11-18 | Paper |
| New roses: simple symmetric Venn diagrams with 11 and 13 curves | 2014-09-19 | Paper |
| In-place permuting and perfect shuffling using involutions | 2014-08-13 | Paper |
| On Combinatorial Generation of Prefix Normal Words | 2014-06-30 | Paper |
| Generating Tatami Coverings Efficiently | 2014-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5746186 | 2014-02-18 | Paper |
| Domino Tatami Covering Is NP-Complete | 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 | 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 | 2013-01-18 | Paper |
| Generating simple convex Venn diagrams | 2013-01-18 | Paper |
| Counting and computing the Rand and block distances of pairs of set partitions | 2013-01-18 | Paper |
| The feline Josephus problem | 2012-12-06 | Paper |
| Shorthand universal cycles for permutations | 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 | 2012-09-12 | Paper |
| Nested recurrence relations with Conolly-like solutions | 2012-08-22 | Paper |
| An Undecidable Nested Recurrence Relation | 2012-08-14 | Paper |
| Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams | 2012-01-13 | Paper |
| The Rand and Block Distances of Pairs of Set Partitions | 2012-01-13 | Paper |
| Minimum Area Venn Diagrams Whose Curves Are Polyominoes | 2011-12-07 | Paper |
| Binary bubble languages and cool-lex order | 2011-11-11 | Paper |
| Spherical Venn diagrams with involutory isometries | 2011-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3087635 | 2011-08-16 | Paper |
| Monomer-dimer tatami tilings of rectangular regions | 2011-06-01 | Paper |
| Efficient Coroutine Generation of Constrained Gray Sequences | 2011-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576763 | 2010-08-02 | Paper |
| Faster Generation of Shorthand Universal Cycles for Permutations | 2010-07-20 | Paper |
| Auspicious Tatami Mat Arrangements | 2010-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3574993 | 2010-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3550078 | 2010-03-30 | Paper |
| Counting fixed-height tatami tilings | 2010-03-26 | Paper |
| Gray codes for column-convex polyominoes and a new class of distributive lattices | 2009-12-15 | Paper |
| The coolest way to generate combinations | 2009-12-15 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3637684 | 2009-07-13 | Paper |
| A CAT algorithm for generating permutations with a fixed number of inversions | 2009-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5450058 | 2008-03-19 | Paper |
| Which \(n\)-Venn diagrams can be drawn with convex \(k\)-gons? | 2007-06-21 | Paper |
| More fun with symmetric Venn diagrams | 2007-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5395424 | 2006-10-30 | Paper |
| Meta-Fibonacci sequences, binary trees and extremal compact codes | 2006-03-22 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5703680 | 2005-11-08 | Paper |
| Half-simple symmetric Venn diagrams | 2005-04-25 | Paper |
| Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings | 2005-02-28 | Paper |
| Counting Strings with Given Elementary Symmetric Function Evaluations I: Strings over \boldmath$\mathbbZ_p$ withpPrime | 2005-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4457543 | 2004-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422310 | 2003-09-03 | Paper |
| Generating Lyndon brackets. | 2003-08-13 | Paper |
| Bent Hamilton cycles in \(d\)-dimensional grid graphs | 2003-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766842 | 2002-07-22 | Paper |
| Ranking and unranking permutations in linear time | 2002-07-14 | Paper |
| The number of irreducible polynomials and Lyndon words with given trace | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952625 | 2000-05-10 | Paper |
| An Efficient Algorithm for Generating Necklaces with Fixed Density | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252420 | 2000-01-25 | Paper |
| Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2) | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268449 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252356 | 1999-06-17 | Paper |
| Venn diagrams with few vertices | 1998-10-27 | Paper |
| Completely separating systems of \(k\)-sets | 1998-07-19 | Paper |
| A survey of Venn diagrams | 1998-02-22 | Paper |
| Three-dimensional graph drawing | 1997-06-30 | Paper |
| The Hamiltonicity of directed \(\sigma\)-\(\tau\) Cayley graphs (Or: A tale of backtracking) | 1996-12-05 | Paper |
| A Gray code for combinations of a multiset | 1996-09-30 | Paper |
| Transition restricted Gray codes | 1996-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4862896 | 1996-06-17 | Paper |
| Determining the Hamilton-connectedness of certain vertex-transitive graphs | 1995-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4325282 | 1995-07-09 | Paper |
| The prism of the acyclic orientation graph is Hamiltonian | 1995-04-06 | Paper |
| Generating Linear Extensions Fast | 1995-01-22 | Paper |
| Gray codes from antimatroids | 1994-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288077 | 1994-04-21 | Paper |
| A Gray Code for the Ideals of a Forest Poset | 1994-03-02 | Paper |
| On Rotations and the Generation of Binary Trees | 1994-01-23 | Paper |
| Generating linear extensions of posets by transpositions | 1993-08-18 | Paper |
| Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $ | 1993-06-29 | Paper |
| Generating permutations of a bag by interchanges | 1993-01-16 | Paper |
| Generating necklaces | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4012810 | 1992-09-27 | Paper |
| Generating permutations with given ups and downs | 1992-06-28 | Paper |
| Generating the Linear Extensions of Certain Posets by Transpositions | 1992-06-28 | Paper |
| Generating binary trees by transpositions | 1990-01-01 | Paper |
| Generating alternating permutations lexicographically | 1990-01-01 | Paper |
| Transposition generation of alternating permutations | 1989-01-01 | Paper |
| Generating t-ary trees in A-order | 1988-01-01 | Paper |
| Adjacent interchange generation of combinations | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3831003 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796773 | 1988-01-01 | Paper |
| Solution of some multi-dimensional lattice path parity difference recurrence relations | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3831043 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3791180 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4207901 | 1987-01-01 | Paper |
| Binary tree gray codes | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3332267 | 1984-01-01 | Paper |
| A simple proof of a formula of Dershowitz and Zaks | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3326855 | 1982-01-01 | Paper |
| On unary stochastic Lindenmayer systems | 1981-01-01 | Paper |
| Listing and Counting Subtrees of a Tree | 1981-01-01 | Paper |
| On the Average Shape of Binary Trees | 1980-01-01 | Paper |
| An algorithm for the most economic link addition in a tree communications network | 1979-01-01 | Paper |
| Generating t-Ary Trees Lexicographically | 1978-01-01 | Paper |
