Timothy R. S. Walsh

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