Timothy R. S. Walsh

Discret. Math., 2019

2018

Enumeration of hypermaps of a given genus.

[BibT_eX]

[DOI]

Alain Giorgetti

Ars Math. Contemp., 2018

2015

Space-Efficient Generation of Nonisomorphic Maps and Hypermaps.

[BibT_eX]

[DOI]

J. Integer Seq., 2015

2014

Efficient enumeration of rooted maps of a given orientable genus by number of faces and vertices.

[BibT_eX]

[DOI]

Alain Giorgetti

Ars Math. Contemp., 2014

2013

Counting maps on doughnuts.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

2012

Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices.

[BibT_eX]

[DOI]

Alain Giorgetti

Alexander D. Mednykh

Discret. Math., 2012

2009

Structure and enumeration of two-connected graphs with prescribed three-connected components.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2009

2007

Two-connected graphs with prescribed three-connected components.

[BibT_eX]

[DOI]

CoRR, 2007

2006

A loop-free two-close Gray-code algorithm for listing k-ary Dyck words.

[BibT_eX]

[DOI]

Vincent Vajnovszki

Timothy Walsh

J. Discrete Algorithms, 2006

Counting unrooted maps on the plane.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2006

2005

Counting unrooted loopless planar maps.

[BibT_eX]

[DOI]

Eur. J. Comb., 2005

Efficient enumeration of sensed planar maps.

[BibT_eX]

[DOI]

Discret. Math., 2005

2004

Enumeration of eulerian and unicursal planar maps.

[BibT_eX]

[DOI]

Discret. Math., 2004

2003

Generating Gray Codes in O(1) Worst-Case Time per Word.

[BibT_eX]

[DOI]

Timothy Walsh

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

1999

Total Vertex Enumeration in Rooted Planar Maps.

[BibT_eX]

Leonid M. Koganov

Ars Comb., 1999

1998

Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time.

[BibT_eX]

[DOI]

J. Algorithms, 1998

1997

Worst-Case Analysis of Read's Chromatic Polynomial Algorithm.

[BibT_eX]

Ars Comb., 1997

1993

Inversion of Cycle Index Sum Relations for 2- and 3-Connected Graphs.

[BibT_eX]

[DOI]

Robert W. Robinson

J. Comb. Theory, Ser. B, 1993

1988

Efficient axis-translation of binary digital pictures by blocks in linear quadtree representation.

[BibT_eX]

[DOI]

Comput. Vis. Graph. Image Process., 1988

1987

Enumeration and generation of a class of regular digraphs.

[BibT_eX]

[DOI]

M. V. S. Ramanath

J. Graph Theory, 1987

Triangular decomposition.

[BibT_eX]

[DOI]

Edward W. Elcock

Image Vis. Comput., 1987

1986

Filling by quadrants or octants.

[BibT_eX]

[DOI]

Harvey H. Atkinson

Comput. Vis. Graph. Image Process., 1986

Viewing Transformations of Voxel-Based Objects Via Linear Octrees.

[BibT_eX]

[DOI]

Oi-Lun Wu

IEEE Computer Graphics and Applications, 1986

1985

Counting regions, holes, and their nesting level in time proportional to the border.

[BibT_eX]

[DOI]

Harvey H. Atkinson

Comput. Vis. Graph. Image Process., 1985

1984

How Evenly Should One Divide to Conquer Quickly?

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

1983

Iteration Strikes Back - at the Cyclic Towers of Hanoi.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1983

1982

The busy beaver on a one-way infinite tape.

[BibT_eX]

[DOI]

SIGACT News, 1982

Counting non-isomorphic three-connected planar maps.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1982

Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1982

Counting labelled three-connected and homeomorphically irreducible two-connected graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1982

The Towers of Hanoi Revisited: Moving the Rings by Counting the Moves.

[BibT_eX]

[DOI]