The average distance between nodes in the cyclic Tower of Hanoi
digraph, in Combinatorics, Graph Theory, and Algorithms, Vol. II
(Proceedings of the Eighth Quadrennial International
Conference on Graph Theory, Combinatorics, Algorithms, and
Applications), Y. Alavi, D. R. Lick, and A. Schwenk, ed., pp.
799--808. New Issues Press, Kalamazoo, 1999.
(with several co-authors) Exchanging disks in the Tower of Hanoi,
International Journal of Computer Mathematics59 (1995),
37-47.
Variations on the four-post Tower of Hanoi puzzle, Congressus
Numerantium102 (1994), 3-12.
Reconstruction of Graphical Structures
(with B. Manvel, A. Meyerowitz, A. Schwenk, and K. Smith),
Reconstruction of Sequences, Discrete Mathematics94
(1991) 209-219.
The quest for non-reconstructable graphs, Congressus
Numerantium63 (1988), 188-200.
Which reconstruction results are significant?, in The Theory and
Applications of Graphs (G. Chartrand et al., eds), John Wiley &
Sons, New York, 1981, 543-555.
A census of non-reconstructable digraphs, I: Six related families,
J. Combinatorial Theory, Series B31 (1981),
232-239.
The falsity of the reconstruction conjecture for tournaments,
Journal of Graph Theory1 (1977), 19-25.
The reconstruction conjecture for tournaments, Congressus
Numerantium14, (1975), 561-566.
(with Bennet Manvel), On reconstruction of matrices, Mathematics
Magazine44 (1971), 218-221.
Other Graph Theory
Who is the best doubles tennis player?: An introduction to
k-tournaments, in Graph Theory, Combinatorics, and
Applications, Vol. 2 (Y. Alavi et al., eds.), John Wiley &
Sons, New York, 1991, 1083-1091.
(with Robert J. Kimble and Allen J. Schwenk), Pseudosimilar vertices
in a graph, Journal of Graph Theory5 (1981),
171-181.
(with Frank Harary), Planar composite graphs, An. Acad. Brazil.
Ciec.43 (1971), 325-329.
(with Bennet Manvel and D. J. A. Welsh), On removing a point of a
digraph, Studia Sci. Math. Hungar.5 (1970), 299-301.
Bandwidth Reduction of Sparse Matrices
(with H. L. Crane, Jr., N. E. Gibbs, and W. G. Poole, Jr.),
Algorithm 508: Matrix bandwidth and profile reduction, ACM Trans. on
Math. Software2 (1976), 375-377.
(with N. E. Gibbs and W. G. Poole, Jr.), A comparison of several
bandwidth and profile reduction algorithms, ACM Trans. on Math.
Software2 (1976), 322-330.
(with N. E. Gibbs and W. G. Poole, Jr.), An algorithm for reducing
the bandwidth and profile of a sparse matrix, SIAM J. Numer.
Anal.13 (1976), 236-250.
Miscellaneous
(with Frances Yao), On the optimality of linear merge, SIAM J.
Computing9 (1980), 85-90.
The charm bracelet problem and its applications, in Graphs and
Combinatorics (R. Bari and F. Harary, eds.), Springer-Verlag,
Berlin, 1975, 339-349.
This page is maintained by Paul
K. Stockmeyer. Select my name to see my home page.
The URL for this page is
http://www.cs.wm.edu/~pkstoc/papers.html
Last updated 27 August 1998