S. G. Williamson

15 papers Journal 14
YearRankTypeTitle / Venue / Authors
2004 J jnl
A Class Of Graphs Which Has Efficient Ranking And Unranking Algorithms For Spanning Trees And Forests.
Int. J. Found. Comput. Sci.
Ömer Egecioglu, Jeffrey B. Remmel, S. G. Williamson
2002 J jnl
Spanning Trees and Function Classes.
Electron. J. Comb.
Jeffrey B. Remmel, S. G. Williamson
1995 J jnl
Evolving Compare-Exchange Networks Using Grammars.
Artif. Life
Thomas E. Kammeyer, Richard K. Belew, S. G. Williamson
1991 — book
Foundations of applied combinatorics.
Edward A. Bender, S. G. Williamson
1984 J jnl
Depth-First Search and Kuratowski Subgraphs.
J. ACM
S. G. Williamson
1983 J jnl
Central and Local Limit Theorems Applied to Asymptotic Enumeration. III. Matrix Recursions.
J. Comb. Theory A
Edward A. Bender, L. Bruce Richmond, S. G. Williamson
1980 J jnl
Combinatorial Gray codes.
SIAM J. Comput.
James T. Joichi, Dennis E. White, S. G. Williamson
1977 J jnl
Recursive Matching Algorithms and Linear Orders on the Subset Lattice.
J. Comb. Theory A
Dennis E. White, S. G. Williamson
1976 J jnl
Ranking Algorithms for Lists of Partitions.
SIAM J. Comput.
S. G. Williamson
1976 J jnl
Ranking Algorithms: The Symmetries and Colorations of the n-Cube.
SIAM J. Comput.
Jay P. Fillmore, S. G. Williamson
1975 J jnl
Computational Algorithms for the Enumeration of Group Invariant Partitions.
SIAM J. Comput.
Dennis E. White, S. G. Williamson
1974 J jnl
On Backtracking: A Combinatorial Description of the Algorithm.
SIAM J. Comput.
Jay P. Fillmore, S. G. Williamson
1973 J jnl
Isomorph Rejection and a Theorem of De Bruijn.
SIAM J. Comput.
S. G. Williamson
1972 J jnl
The combinatorial analysis of patterns and the principle of inclusion-exclusion.
Discret. Math.
S. G. Williamson
1971 J jnl
Symmetry Operators of Kranz Products.
J. Comb. Theory A
S. G. Williamson