Conference paper
Surface light-induced changes in thin polymer films
Andrew Skumanich
SPIE Optics Quebec 1993
Universal traversal sequences for d-regular n-vertex graphs require length Ω(d2n2 + dn2 log( n d)), for 3 ≤d≤ n 3 - 2. This is nearly tight for d = Θ(n). We also introduce and study several variations on the problem, e.g., edge-universal traversal sequences, showing how improved lower bounds on these would improve the bounds given above. © 1992.
Andrew Skumanich
SPIE Optics Quebec 1993
Naga Ayachitula, Melissa Buco, et al.
SCC 2007
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
A.R. Gourlay, G. Kaye, et al.
Proceedings of SPIE 1989