The Towers of Hanoi Revisited: Moving the Rings by Counting the Moves. - Timothy R. Walsh (Inf. Process. Lett., 1982)

Counting labelled three-connected and homeomorphically irreducible two-connected graphs. - Timothy R. S. Walsh (J. Comb. Theory B, 1982)

Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs. - Timothy R. S. Walsh (J. Comb. Theory B, 1982)

Counting non-isomorphic three-connected planar maps. - Timothy R. S. Walsh (J. Comb. Theory B, 1982)

The busy beaver on a one-way infinite tape. - Timothy R. S. Walsh (SIGACT News, 1982)

Iteration Strikes Back - at the Cyclic Towers of Hanoi. - Timothy R. Walsh (Inf. Process. Lett., 1983)

How Evenly Should One Divide to Conquer Quickly? - Timothy R. Walsh (Inf. Process. Lett., 1984)

Counting regions, holes, and their nesting level in time proportional to the border. - Harvey H. Atkinson; Irene Gargantini; Timothy R. S. Walsh (Comput. Vis. Graph. Image Process., 1985)

Viewing Transformations of Voxel-Based Objects Via Linear Octrees. - Irene Gargantini; Timothy R. Walsh; Oi-Lun Wu (IEEE Computer Graphics and Applications, 1986)

Filling by quadrants or octants. - Harvey H. Atkinson; Irene Gargantini; Timothy R. S. Walsh (Comput. Vis. Graph. Image Process., 1986)

Triangular decomposition. - Edward W. Elcock; Irene Gargantini; Timothy R. Walsh (Image Vis. Comput., 1987)

Enumeration and generation of a class of regular digraphs. - M. V. S. Ramanath; Timothy R. Walsh (J. Graph Theory, 1987)

Efficient axis-translation of binary digital pictures by blocks in linear quadtree representation. - Timothy R. Walsh (Comput. Vis. Graph. Image Process., 1988)

Inversion of Cycle Index Sum Relations for 2- and 3-Connected Graphs. - Robert W. Robinson; Timothy R. S. Walsh (J. Comb. Theory B, 1993)

Worst-Case Analysis of Read's Chromatic Polynomial Algorithm. - Timothy R. Walsh (Ars Comb., 1997)

Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time. - Timothy R. Walsh (J. Algorithms, 1998)

Total Vertex Enumeration in Rooted Planar Maps. - Leonid M. Koganov; Valery A. Liskovets; Timothy R. S. Walsh (Ars Comb., 1999)

Generating Gray Codes in O(1) Worst-Case Time per Word. - Timothy Walsh 001 (DMTCS, 2003)

Enumeration of eulerian and unicursal planar maps. - Valery A. Liskovets; Timothy R. S. Walsh (Discret. Math., 2004)

Efficient enumeration of sensed planar maps. - Timothy R. Walsh (Discret. Math., 2005)

Counting unrooted loopless planar maps. - Valery A. Liskovets; Timothy R. S. Walsh (Eur. J. Comb., 2005)

Counting unrooted maps on the plane. - Valery A. Liskovets; Timothy R. Walsh (Adv. Appl. Math., 2006)

A loop-free two-close Gray-code algorithm for listing k-ary Dyck words. - Vincent Vajnovszki; Timothy Walsh 001 (J. Discrete Algorithms, 2006)

Two-connected graphs with prescribed three-connected components. - Andrei Gagarin; Gilbert Labelle; Pierre Leroux; Timothy Walsh 001 (CoRR, 2007)

Structure and enumeration of two-connected graphs with prescribed three-connected components. - Andrei Gagarin; Gilbert Labelle; Pierre Leroux; Timothy Walsh 001 (Adv. Appl. Math., 2009)

Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices. - Timothy R. S. Walsh; Alain Giorgetti; Alexander D. Mednykh (Discret. Math., 2012)

Counting maps on doughnuts. - Timothy R. Walsh (Theor. Comput. Sci., 2013)

Efficient enumeration of rooted maps of a given orientable genus by number of faces and vertices. - Timothy R. S. Walsh; Alain Giorgetti (Ars Math. Contemp., 2014)

Space-Efficient Generation of Nonisomorphic Maps and Hypermaps. - Timothy R. Walsh (J. Integer Seq., 2015)

Enumeration of hypermaps of a given genus. - Alain Giorgetti; Timothy R. S. Walsh (Ars Math. Contemp., 2018)

Corrigendum to "Enumeration of eulerian and unicursal planar maps" [Discrete Math. 282 (2004) 208-221]. - Valery A. Liskovets; Timothy R. S. Walsh (Discret. Math., 2019)

Genomic Shift in Population Dynamics of mcr-1-positive Escherichia coli in Human Carriage. - Yingbo Shen; Rong Zhang; Dongyan Shao; Lu Yang; Jiayue Lu; Congcong Liu; Xueyang Wang; Junyao Jiang; Boxuan Wang; Congming Wu; Julian Parkhill; Yang Wang; et al. (Genom. Proteom. Bioinform., 2022)