Timothy R. S. Walsh

Publication Activity (10 Years)

Years Active: 1982-2019
Publications (10 Years): 2

Top Topics

Computationally Expensive

Continuous Variables

Top Venues

Ars Math. Contemp.

Publications

Valery A. Liskovets, Timothy R. S. Walsh
Corrigendum to "Enumeration of eulerian and unicursal planar maps" [Discrete Math. 282 (2004) 208-221]. Discret. Math. 342 (7) (2019)
Alain Giorgetti, Timothy R. S. Walsh
Enumeration of hypermaps of a given genus. Ars Math. Contemp. 15 (1) (2018)
Timothy R. S. Walsh, Alain Giorgetti
Efficient enumeration of rooted maps of a given orientable genus by number of faces and vertices. Ars Math. Contemp. 7 (2) (2014)
Timothy R. S. Walsh, Alain Giorgetti, Alexander D. Mednykh
Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices. Discret. Math. 312 (17) (2012)
Valery A. Liskovets, Timothy R. S. Walsh
Counting unrooted loopless planar maps. Eur. J. Comb. 26 (5) (2005)
Valery A. Liskovets, Timothy R. S. Walsh
Enumeration of eulerian and unicursal planar maps. Discret. Math. 282 (1-3) (2004)
Leonid M. Koganov, Valery A. Liskovets, Timothy R. S. Walsh
Total Vertex Enumeration in Rooted Planar Maps. Ars Comb. 54 (1999)
Robert W. Robinson, Timothy R. S. Walsh
Inversion of Cycle Index Sum Relations for 2- and 3-Connected Graphs. J. Comb. Theory, Ser. B 57 (2) (1993)
Harvey H. Atkinson, Irene Gargantini, Timothy R. S. Walsh
Filling by quadrants or octants. Comput. Vis. Graph. Image Process. 33 (2) (1986)
Harvey H. Atkinson, Irene Gargantini, Timothy R. S. Walsh
Counting regions, holes, and their nesting level in time proportional to the border. Comput. Vis. Graph. Image Process. 29 (2) (1985)
Timothy R. S. Walsh
Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs. J. Comb. Theory, Ser. B 32 (1) (1982)
Timothy R. S. Walsh
The busy beaver on a one-way infinite tape. SIGACT News 14 (1) (1982)
Timothy R. S. Walsh
Counting non-isomorphic three-connected planar maps. J. Comb. Theory, Ser. B 32 (1) (1982)
Timothy R. S. Walsh
Counting labelled three-connected and homeomorphically irreducible two-connected graphs. J. Comb. Theory, Ser. B 32 (1) (1982)