Timothy R. S. Walsh

From MaRDI portal
Person:442385

Available identifiers

zbMath Open walsh.timothy-r-sMaRDI QIDQ442385

List of research outcomes

PublicationDate of PublicationType
Corrigendum to: ``Enumeration of Eulerian and unicursal planar maps2019-06-18Paper
Enumeration of hypermaps of a given genus2019-02-01Paper
https://portal.mardi4nfdi.de/entity/Q55021912015-08-18Paper
Efficient enumeration of rooted maps of a given orientable genus by number of faces and vertices2015-01-26Paper
Constructing large tables of numbers of maps by orientable genus2014-05-03Paper
Counting maps on doughnuts2014-01-10Paper
Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices2012-08-10Paper
Counting unrooted maps on the plane2007-01-16Paper
Efficient enumeration of sensed planar maps2005-06-01Paper
Counting unrooted loopless planar maps2005-05-04Paper
Enumeration of Eulerian and unicursal planar maps2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q45521562002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q45049092001-01-14Paper
https://portal.mardi4nfdi.de/entity/Q49344042000-05-01Paper
https://portal.mardi4nfdi.de/entity/Q49344052000-05-01Paper
https://portal.mardi4nfdi.de/entity/Q49400462000-03-01Paper
Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time1999-03-07Paper
https://portal.mardi4nfdi.de/entity/Q43906791998-11-01Paper
https://portal.mardi4nfdi.de/entity/Q43019061994-11-27Paper
Inversion of cycle index sum relations for 2- and 3-connected graphs1993-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37911721987-01-01Paper
Enumeration and generation of a class of regular digraphs1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37501291986-01-01Paper
On the size of quadtrees generalized to d-dimensional binary pictures1985-01-01Paper
Counting regions, holes, and their nesting level in time proportional to the border1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37617111985-01-01Paper
How evenly should one divide to conquer quickly?1984-01-01Paper
Iteration strikes back - at the cyclic Towers of Hanoi1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30423831983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33463521983-01-01Paper
The Enumeration of Non-Isomorphic 2-Connected Planar Maps1983-01-01Paper
Generating Nonisomorphic Maps without Storing Them1983-01-01Paper
Counting non-isomorphic three-connected planar maps1982-01-01Paper
Counting labelled three-connected and homeomorphically irreducible two- connected graphs1982-01-01Paper
Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs1982-01-01Paper
The towers of Hanoi revisited: Moving the rings by counting the moves1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36802811982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39297641980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38890881979-01-01Paper
The k -Connectedness of Unlabelled Graphs1978-01-01Paper
Counting rooted maps by genus. III: Nonseparable maps1975-01-01Paper
Hypermaps versus bipartite maps1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40491141975-01-01Paper
Counting rooted maps by genus. II. Erratum1973-01-01Paper
Counting rooted maps by genus. I1972-01-01Paper
Counting rooted maps by genus. II1972-01-01Paper
Characterizing the vertex neighbourhoods of semi-regular polyhedra1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38486631963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38461271962-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Timothy R. S. Walsh