Books	3	Proceedings of the Workshop on Generalizations of de Bruijn Cycles and Gray Codes. Held at the Banff International Research Station, Banff, December 4--9, 2004. Edited by G. Hurlbert, B. Jackson, and B. Stevens, in preparation.
	2	Linear Optimization: the Simplex Workbook , Springer Verlag, in preparation.
	1	Universal cycles: on beyond De Bruijn, Ph.D. Thesis, Rutgers University (1990).
Papers	42	Pebbling graphs by their blocks (with D. Curtis, T. Hines and T. Moyer), in preparation.
	41	On $k$-pebbling graphs and graph products (with D. Herscovici and B. Hester), in preparation.
	40	A linear optimization proof of the KKM lemma, in preparation.
	39	On counting simplices of a polytope containing a given point, in preparation.
	38	Near-universal cycles for subsets exist (with D. Curtis, T. Hines and T. Moyer) , submitted.
	37	The equivalence of the auxiliary and shortcut methods for the Simplex algorithm , submitted.
	36	On universal cycles for multisets (with T. Johnson and J. Zahl), Discrete Math., to appear.
	35	Two new bijections on lattice paths (with V. Kamat), J. Combin. Math. Combin. Comput., to appear.
	34	The pebbling threshold of the square of cliques (with A. Bekmetjev), Discrete Math., 308 no. 19 (2008), 4306--4314.
	33	On the pebbling threshold of paths and the pebbling threshold spectrum (with A. Czygrinow), Discrete Math., 308 no. 15 (2008), 3297--3307.
	32	On encodings of spanning trees , Discrete Appl. Math., 155 (2007), 2594--2600.
	31	Cover pebbling hypercubes (with B. Munyan), Bull. Inst. Combin. Appl., 47 (2006), 71--76.
	30	Girth, pebbling, and grid thresholds (with A. Czygrinow), SIAM J. Discrete Math., 20 no. 1 (2006), 1--10.
	29	Recent progress in graph pebbling , Graph Theory Notes of New York, XLIX (2005), 25--37.
	28	On the number of ones in general binary Pascal triangles (with H. Harborth), J. Combin. Math. Combin. Comput., 54 (2005), 99--110.
	27	An application of graph pebbling to zero-sum sequences in abelian groups (with S. Elledge), Integers: Elec. J. Number Th., 5(1) (2005), #A17.
	26	The cover pebbling number of graphs (with B. Crull, T. Cundiff, P. Feltman, L. Pudwell, Z. Szaniszlo, Z. Tuza), Discrete Math. 296 (2005), 15--23.
	25	Pythagorean quadrilaterals (with R. Hochberg), Applications of Fibonacci numbers, Vol. 9 (Flagstaff, AZ, 2002), 109--119, Kluwer Acad. Publ., Dordrecht, 2004.
	24	Pebbling in dense graphs (with A. Czygrinow), Austral. J. Combin. 29 (2003), 201--208.
	23	Thresholds for families of multisets, with an application to graph pebbling (with A. Bekmetjev, G. Brightwell and A. Czygrinow), Discrete Math. 269 (2003), no. 1-3, 21--34. [This paper is included in the special volume Discrete Mathematics, Editor's Choice, Edition 2003, distinguished by the editors as among the 12 best of the 210 papers published that year.]
	22	On pebbling threshold functions for graph sequences (with A. Czygrinow, N. Eaton, and P. M. Kayll), Discrete Math. 247 (2002), no.1-3, 93--105.
	21	A note on graph pebbling (with A. Czygrinow, H. Kierstead, and W. T. Trotter), Graphs and Combinatorics 18 (2002), 219--225.
	20	On the pebbling threshold spectrum , Electron. Notes Discrete Math., 10, Elsevier, Amsterdam, 2001. Comb01---Euroconference on Combinatorics, Graph Theory and Applications, 5 pp. (electronic).
	19	Spanning trees of bounded degree (with A. Czygrinow, G. Fan, H. Kierstead, and W. T. Trotter), Elec. J. Comb. 8 (2001), no.1, Research Paper 33, 12 pages.
	18	On graph pebbling, threshold functions, and supernormal posets (with N. Eaton), unpublished.
	17	A survey of graph pebbling , Congressus Numerantium 139 (1999), 41--64.
	16	Two pebbling theorems , Congressus Numerantium 135 (1998), 55--63.
	15	On higher dimensional perfect factors (with G. Isaak), Ars Combinatoria 45 (1997), 229--239.
	14	Pebbling in diameter two graphs and products of paths (with T. Clarke and R. Hochberg), J. Graph Th. 25 (1997), no.2, 119--128.
	13	On the existence of De Bruijn tori with 2 x 2 windows (with C. Mitchell and K. Paterson), J. Comb. Th. (A) 76 (1996), no.2, 213--230.
	12	Equivalence class universal cycles for permutations (with G. Isaak), Discrete Math. 149 (1996), no.1-3, 123--129.
	11	New constructions for De Bruijn tori (with G. Isaak), Designs, Codes and Cryptography 6 (1995), no.1, 47--56.
	10	Multicover ucycles , Discrete Math. 137 (1995), no.1-3, 241--249.
	9	A meshing technique for De Bruijn tori (with G. Isaak), Contemporary Math. 178 (1994), 153--160.
	8	The dimension of interior levels of the boolean lattice (with A. Kostochka and L. Talysheva), Order 11 (1994), no.1, 29--40.
	7	On universal cycles for k-subsets of an n-set , SIAM J. Discrete Math. 7 (1994), no.4, 598--604.
	6	New results on dimension in the cube , unpublished (1994). [7th SIAM Conference on Discrete Mathematics, Albuquerque, NM.]
	5	The antipodal layers problem , Discrete Math. 128 (1994), no.1-3, 237--245.
	4	On spanning trees of certain graphs , unpublished (1993). [Colloquium, University of California, Santa Barbara, CA.]
	3	On the De Bruijn torus problem (with G. Isaak), J. Comb. Th. (A) 64 (1993), no.1, 50--62.
	2	On dimension in the cube , unpublished (1992). [872nd Meeting of the AMS, Special Session on Posets, Tuscaloosa, AL.]
	1	A short proof that N3 is not a circle containment order, Order 5 (1988), no.3, 235--237.