| Publication | Date of Publication | Type |
|---|
| Corrigendum to: ``Enumeration of Eulerian and unicursal planar maps | 2019-06-18 | Paper |
| Enumeration of hypermaps of a given genus | 2019-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5502191 | 2015-08-18 | Paper |
| Efficient enumeration of rooted maps of a given orientable genus by number of faces and vertices | 2015-01-26 | Paper |
| Constructing large tables of numbers of maps by orientable genus | 2014-05-03 | Paper |
| Counting maps on doughnuts | 2014-01-10 | Paper |
| Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices | 2012-08-10 | Paper |
| Counting unrooted maps on the plane | 2007-01-16 | Paper |
| Efficient enumeration of sensed planar maps | 2005-06-01 | Paper |
| Counting unrooted loopless planar maps | 2005-05-04 | Paper |
| Enumeration of Eulerian and unicursal planar maps | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552156 | 2002-08-29 | Paper |
| Gray codes for involutions | 2002-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504909 | 2001-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934405 | 2000-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934404 | 2000-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940046 | 2000-03-01 | Paper |
| Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time | 1999-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390679 | 1998-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4301906 | 1994-11-27 | Paper |
| Inversion of cycle index sum relations for 2- and 3-connected graphs | 1993-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3791172 | 1987-01-01 | Paper |
| Enumeration and generation of a class of regular digraphs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3750129 | 1986-01-01 | Paper |
| On the size of quadtrees generalized to d-dimensional binary pictures | 1985-01-01 | Paper |
| Counting regions, holes, and their nesting level in time proportional to the border | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3761711 | 1985-01-01 | Paper |
| How evenly should one divide to conquer quickly? | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3346352 | 1983-01-01 | Paper |
| Generating Nonisomorphic Maps without Storing Them | 1983-01-01 | Paper |
| Iteration strikes back - at the cyclic Towers of Hanoi | 1983-01-01 | Paper |
| The Enumeration of Non-Isomorphic 2-Connected Planar Maps | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3042383 | 1983-01-01 | Paper |
| Counting labelled three-connected and homeomorphically irreducible two- connected graphs | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680281 | 1982-01-01 | Paper |
| The towers of Hanoi revisited: Moving the rings by counting the moves | 1982-01-01 | Paper |
| Counting non-isomorphic three-connected planar maps | 1982-01-01 | Paper |
| Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929764 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3889088 | 1979-01-01 | Paper |
| The k -Connectedness of Unlabelled Graphs | 1978-01-01 | Paper |
| Hypermaps versus bipartite maps | 1975-01-01 | Paper |
| Counting rooted maps by genus. III: Nonseparable maps | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4049114 | 1975-01-01 | Paper |
| Counting rooted maps by genus. II. Erratum | 1973-01-01 | Paper |
| Characterizing the vertex neighbourhoods of semi-regular polyhedra | 1972-01-01 | Paper |
| Counting rooted maps by genus. I | 1972-01-01 | Paper |
| Counting rooted maps by genus. II | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3848663 | 1963-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3846127 | 1962-01-01 | Paper |
