Books	7	Graph Pebbling, chapter in Handbook of Discrete and Combinatorial Mathematics (2nd ed.), K. Rosen, J. Michaels, W. Goddard, J. Gross, J. Grossman and D. Shier, eds., CRC Press, Boca Raton, 2018.
	6	Connections in Discrete Mathematics: A Celebration of the Work of Ron Graham, S. Butler, J. Cooper, and G. Hurlbert, eds., Cambridge Univ. Press, Cambridge, 2018.
	5	Graph Pebbling, chapter in Handbook of Graph Theory (2nd ed.), Discrete Mathematics and its Applications, J. Gross, J. Yellen, and P. Zhang, eds., CRC Press, Boca Raton, 2014.
	4	Graph Pebbling, chapter in Modern Methods in Combinatorics 2nd Puntana School of Combinatorics, D. Jaume and S. Eliahou, eds., Centre International de Mathèmatiques Pures et Appliquèes, 2013.
	3	Linear Optimization: the Simplex Workbook, Springer, New York, 2010. [This book won the Textbook Excellence Award from the Text and Academic Authors Association in 2012.]
	2	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. Special volume of Discrete Math., 309 no. 17 (2009), 5255--5508, edited by G. Hurlbert, B. Jackson, and B. Stevens.
	1	Universal cycles: on beyond De Bruijn, Ph.D. Thesis, Rutgers University (1990).
Papers	91	Pebbling in $k$-paths (with L. Alcón), in preparation.
	90	On EKR and HK trees (with E. Estrugo, V. Kamat, and A. Pastine), in preparation.
	89	A Kruskal-Katona theorem on graphs (with G. O. H. Katona), in preparation.
	88	Graham's conjecture for Petersen graph powers (with S. Fiscus and E. Myzelev), in preparation.
	87	Optimal pebbling density of grid strips (with Z. Hefty and C. Muir), in preparation.
	86	On pebbling games (with S. Fiscus and E. Myzelev), in preparation.
	85	Characterizing pyramid-free chordal graphs (with L. Alcón), M. Milanic, and J. Szwarcfiter) in preparation.
	84	Optimal pebbling in Kneser graphs (with C. Bujtas, G. Y. Katona, and Z. Tuza), in preparation.
	83	Target pebbling in trees (with M. Adauto, Y. Bidav, and V. Bardenova), in preparation.
	82	EKR problems for paths in graphs (with N. Bushaw and J. Danielsson), in preparation.
	81	On the pebbling numbers of Flower, Blanuša, and Watkins snarks (with M. Adauto, C. de Figueiredo, and D. Sasaki), submitted.
	80	Pebbling in Kneser graphs (with M. Adauto, V. Bardenova, M. da Cruz, C. de Figueiredo, and D. Sasaki), submitted.
	79	Cup stacking in graphs (with P. Fay and M. Tennant), submitted.
	78	Thresholds for 0-sums with small cross numbers in abelian groups (with N. Bushaw), submitted.
	77	Cops and robbers pebbling in graphs (with N. Clarke and J. Forkin), submitted.
	76	On the target pebbling conjecture (with E. Seddiq), to appear.
	75	On the pebbling numbers of some snarks (with M. Adauto, M. da Cruz, C. de Figueiredo, and D. Sasaki), Matemática Contemporânea 55 (2023), 86--95.
	74	On the secure vertex cover pebbling number (with L. Matthew, J. Quadras, and S. Surya), Asian-Eur. J. Math. 16 (2023), no. 10, 2350182, 19pp.
	73	On the Holroyd-Talbot conjecture for sparse graphs (with P. Frankl), Discrete Math. 347 (2023), no. 1, 113742, 8pp.
	72	Pebbling in powers of paths (with L. Alcón), Discrete Math. 346 (2023), no. 5, 113315, 20pp.
	71	Graph Pebbling: A blend of graph theory, number theory, and optimization (Chinese translation) (with F. Kenter), Mathematical Advances in Translation, Academy of Mathematics and Systems Science (Chinese Academy of Sciences) 41 (2022), no. 3, 216--234.
	70	On intersecting families of independent sets in trees (with V. Kamat), Discrete Appl. Math. 321 (2022), 4--9.
	69	Forward (Ron Graham Memorial Volume) (with S. Butler), Integers, 21A (2021), 2pp.
	68	Ronald Lewis Graham (1935--2020), Notices Amer. Math. Soc., 68 (2021), no. 11, 1931--1950.
	67	Graph Pebbling: A blend of graph theory, number theory, and optimization (with F. Kenter), Notices Amer. Math. Soc., 68 (2021), no. 11, 1900--1913.
	66	An Erdős-Ko-Rado theorem for unions of length 2 paths (with C. Feghali and V. Kamat), Discrete Math. 343 (2020), no. 12, 112121, 6pp.
	65	Erdős-Ko-Rado theorems on the weak Bruhat lattice (with S. Fishel, V. Kamat and K. Meagher), Discrete Appl. Math. 266 (2019), 65--75.
	64	Optimal pebbling number of graphs with given minimum degree (with A. Czygrinow, G.Y. Katona, and L.F. Papp), Discrete Appl. Math., 260 (2019), 117--130.
	63	t-Pebbling in k-connected graphs with a universal vertex (with L. Alcón and M. Gutierrez), Matemática Contemporânea 46 (2018), 38--46.
	62	Pebbling on graph products and other binary graph constructions (with J. Asplund and F. Kenter), Australas. J. Combin., 71 no.2 (2018), 246--260.
	61	New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems (with V. Kamat), Discrete Math., 341 no. 6 (2018), 1749--1754.
	60	Pebbling in semi-2-trees (with L. Alcón and M. Gutierrez), Discrete Math., 340 no. 7 (2017), 1467--1480.
	59	The weight function lemma for graph pebbling, J. Combin. Opt., 34 no. 2 (2017), 343--361.
	58	The composer, in G4G12 Exchange Book (v. 1), 129--132, Gathering for Gardner, Inc., Atlanta, GA, 2017.
	57	Storming the castle (with C. Hurlbert), in G4G12 Exchange Book (v. 1), 233--237, Gathering for Gardner, Inc., Atlanta, GA, 2017.
	56	Chvátal's conjecture for downsets of small rank (with E. Czabarka and V. Kamat), arXiv.org:1703.00494 (2016). [IntersectionFest, Virginia Commonwealth University, Richmond, VA.]
	55	Pebbling in 2-paths (with L. Alcón and M. Gutierrez), Elec. Notes Discrete Math., 150 (2015), 145--150.
	54	Gray codes and overlap cycles for restricted weight words (with V. Horan), Discrete Math. Algorithms Appl., 6 no. 4 (2014), 1450062, 12pp.
	53	1-Overlap cycles for Steiner triple systems (with V. Horan), Des. Codes Cryptogr. 72 no. 3 (2014), 637--651.
	52	Pebbling in split graphs (with L. Alcón and M. Gutierrez), SIAM J. Discrete Math. 28 no. 3 (2014), 1449--1466.
	51	Overlap cycles for Steiner quadruple systems (with V. Horan), J. Combin. Des. 22 no. 2 (2014), 53--70.
	50	s-Overlap cycles for permutations (with V. Horan), Bull. Inst. Combin. Appl. 69 (2013), 60--67.
	49	Universal cycles for weak orders (with V. Horan), SIAM J. Discrete Math. 27 no. 3 (2013), 1360--1371.
	48	t-Pebbling and extensions (with D. Herscovici and B. Hester), Graphs and Combin. 29 no. 4 (2013), 955--975.
	47	General graph pebbling, Discrete Appl. Math. 161 no. 9 (2013), 1221--1231.
	46	Generalizations of Graham's pebbling conjecture (with D. Herscovici and B. Hester), Discrete Math. 312 no. 15 (2012), 2286--2293.
	45	Linear optimization techniques for graph pebbling, http://arxiv.org/abs/1101.5641, (2011).
	44	Optimal pebbling in products of graphs (with D. Herscovici and B. Hester), Australas. J. Combin. 50 (2011), 3--24.
	43	Erdős-Ko-Rado theorems for chordal graphs and trees (with V. Kamat), J. Combin. Th. (A) 118 no. 3 (2011), 829--841.
	42	Near-universal cycles for subsets exist (with D. Curtis, T. Hines and T. Moyer), SIAM J. Discrete Math. 23 no. 3 (2009), 1441--1449.
	41	Pebbling graphs by their blocks (with D. Curtis, T. Hines and T. Moyer), Integers: Elec. J. Combin. Number Th. 9 (2009), #G2, 411--422.
	40	Research problems on Gray codes and universal cycles (with B. Jackson and B. Stevens), Discrete Math. 309 no. 17 (2009), 5341--5348.
	39	Preface to Proceedings of the Workshop on Generalizations of de Bruijn Cycles and Gray Codes (with B. Jackson and B. Stevens), Discrete Math. 309 no. 17 (2009), 5255--5258.
	38	On universal cycles for multisets (with B. Johnson and J. Zahl), Discrete Math. 309 no. 17 (2009), 5321--5327.
	37	Two new bijections on lattice paths (with V. Kamat), J. Combin. Math. Combin. Comput. 68 (2009), 215--223.
	36	A short proof of the Birkhoff-von Neumann theorem, unpublished (2009). [Appears in Book 3.]
	35	The pebbling threshold of the square of cliques (with A. Bekmetjev), Discrete Math. 308 no. 19 (2008), 4306--4314.
	34	On the pebbling threshold of paths and the pebbling threshold spectrum (with A. Czygrinow), Discrete Math. 308 no. 15 (2008), 3297--3307.
	33	On encodings of spanning trees, Discrete Appl. Math. 155 (2007), 2594--2600.
	32	The equivalence of the auxiliary and shortcut methods for the Simplex algorithm, unpublished (2007). [Appears in Book 3.]
	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. Combin. Number Th. 5 no. 1 (2005), #A17. [This paper won the Best Undergraduate Research Award from the Mathematical Association of America in 2004.]
	26	The cover pebbling number of graphs (with B. Crull, T. Cundiff, P. Feltman, L. Pudwell, Z. Szaniszlo, Z. Tuza), Discrete Math. 296 no. 1 (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), Australas. 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 Combin. 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. Combin. 8 (2001), no.1, Research Paper 33, 12 pages.
	18	On graph pebbling, threshold functions, and supernormal posets (with N. Eaton), unpublished, (2000). [17th British Combinatorial Conference, University of Kent, Canterbury, UK]
	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. Combin. 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), Des. Codes Cryptogr. 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. Combin. 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.