Timothy R. S. Walsh

Affiliations:
  • Université du Québec à Montréal, QC, Canada


According to our database1, Timothy R. S. Walsh authored at least 32 papers between 1982 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Genomic Shift in Population Dynamics of <i>mcr</i>-<i>1</i>-positive <i>Escherichia coli</i> in Human Carriage.
Genom. Proteom. Bioinform., December, 2022

2019
Corrigendum to "Enumeration of eulerian and unicursal planar maps" [Discrete Math. 282 (2004) 208-221].
Discret. Math., 2019

2018
Enumeration of hypermaps of a given genus.
Ars Math. Contemp., 2018

2015
Space-Efficient Generation of Nonisomorphic Maps and Hypermaps.
J. Integer Seq., 2015

2014
Efficient enumeration of rooted maps of a given orientable genus by number of faces and vertices.
Ars Math. Contemp., 2014

2013
Counting maps on doughnuts.
Theor. Comput. Sci., 2013

2012
Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices.
Discret. Math., 2012

2009
Structure and enumeration of two-connected graphs with prescribed three-connected components.
Adv. Appl. Math., 2009

2007
Two-connected graphs with prescribed three-connected components.
CoRR, 2007

2006
A loop-free two-close Gray-code algorithm for listing <i>k</i>-ary Dyck words.
J. Discrete Algorithms, 2006

Counting unrooted maps on the plane.
Adv. Appl. Math., 2006

2005
Counting unrooted loopless planar maps.
Eur. J. Comb., 2005

Efficient enumeration of sensed planar maps.
Discret. Math., 2005

2004
Enumeration of eulerian and unicursal planar maps.
Discret. Math., 2004

2003
Generating Gray Codes in O(1) Worst-Case Time per Word.
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

1999
Total Vertex Enumeration in Rooted Planar Maps.
Ars Comb., 1999

1998
Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time.
J. Algorithms, 1998

1997
Worst-Case Analysis of Read's Chromatic Polynomial Algorithm.
Ars Comb., 1997

1993
Inversion of Cycle Index Sum Relations for 2- and 3-Connected Graphs.
J. Comb. Theory B, 1993

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

1987
Enumeration and generation of a class of regular digraphs.
J. Graph Theory, 1987

Triangular decomposition.
Image Vis. Comput., 1987

1986
Filling by quadrants or octants.
Comput. Vis. Graph. Image Process., 1986

Viewing Transformations of Voxel-Based Objects Via Linear Octrees.
IEEE Computer Graphics and Applications, 1986

1985
Counting regions, holes, and their nesting level in time proportional to the border.
Comput. Vis. Graph. Image Process., 1985

1984
How Evenly Should One Divide to Conquer Quickly?
Inf. Process. Lett., 1984

1983
Iteration Strikes Back - at the Cyclic Towers of Hanoi.
Inf. Process. Lett., 1983

1982
The busy beaver on a one-way infinite tape.
SIGACT News, 1982

Counting non-isomorphic three-connected planar maps.
J. Comb. Theory B, 1982

Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs.
J. Comb. Theory B, 1982

Counting labelled three-connected and homeomorphically irreducible two-connected graphs.
J. Comb. Theory B, 1982

The Towers of Hanoi Revisited: Moving the Rings by Counting the Moves.
Inf. Process. Lett., 1982


  Loading...