On the de Bruijn Torus Problem. - Glenn Hurlbert; Garth Isaak (J. Comb. Theory A, 1993)

The antipodal layers problem. - Glenn Hurlbert (Discret. Math., 1994)

On Universal Cycles for k-Subsets of an n-Set. - Glenn Hurlbert (SIAM J. Discret. Math., 1994)

New Constructions for De Bruijn Tori. - Glenn Hurlbert; Garth Isaak (Des. Codes Cryptogr., 1995)

Multicover Ucycles. - Glenn Hurlbert (Discret. Math., 1995)

Equivalence class universal cycles for permutations. - Glenn Hurlbert; Garth Isaak (Discret. Math., 1996)

On the Existence of de Bruijn Tori with Two by Two Windows. - Glenn Hurlbert; Chris J. Mitchell; Kenneth G. Paterson (J. Comb. Theory A, 1996)

On Higher Dimensional Perfect Factors. - Glenn Hurlbert; Garth Isaak (Ars Comb., 1997)

Pebbling in diameter two graphs and products of paths. - T. A. Clarke; Robert A. Hochberg; Glenn H. Hurlbert (J. Graph Theory, 1997)

Spanning Trees of Bounded Degree. - Andrzej Czygrinow; Genghua Fan; Glenn Hurlbert; Henry A. Kierstead; William T. Trotter (Electron. J. Comb., 2001)

On the Pebbling Threshold Spectrum. - Glenn Hurlbert (Electron. Notes Discret. Math., 2001)

On pebbling threshold functions for graph sequences. - Andrzej Czygrinow; Nancy Eaton; Glenn H. Hurlbert; P. Mark Kayll (Discret. Math., 2002)

A Note on Graph Pebbling. - Andrzej Czygrinow; Glenn Hurlbert; Hal A. Kierstead; William T. Trotter (Graphs Comb., 2002)

Pebbling in dense graphs. - Andrzej Czygrinow; Glenn Hurlbert (Australas. J Comb., 2003)

Thresholds for families of multisets, with an application to graph pebbling. - Airat Bekmetjev; Graham R. Brightwell; Andrzej Czygrinow; Glenn Hurlbert (Discret. Math., 2003)

The cover pebbling number of graphs. - Betsy Crull; Tammy Cundiff; Paul Feltman; Glenn H. Hurlbert; Lara Pudwell; Zsuzsanna Szaniszló; Zsolt Tuza (Discret. Math., 2005)

Girth, Pebbling, and Grid Thresholds. - Andrzej Czygrinow; Glenn Hurlbert (SIAM J. Discret. Math., 2006)

On encodings of spanning trees. - Glenn H. Hurlbert (Discret. Appl. Math., 2007)

The pebbling threshold of the square of cliques. - Airat Bekmetjev; Glenn Hurlbert (Discret. Math., 2008)

On the pebbling threshold of paths and the pebbling threshold spectrum. - Andrzej Czygrinow; Glenn H. Hurlbert (Discret. Math., 2008)

On universal cycles for multisets. - Glenn Hurlbert; Tobias Johnson; Joshua Zahl (Discret. Math., 2009)

Research problems on Gray codes and universal cycles. - Brad Jackson; Brett Stevens; Glenn Hurlbert (Discret. Math., 2009)

Preface. - Brett Stevens; Glenn Hurlbert; Bradley Jackson (Discret. Math., 2009)

Near-Universal Cycles for Subsets Exist. - Dawn Curtis; Taylor Hines; Glenn Hurlbert; Tatiana Moyer (SIAM J. Discret. Math., 2009)

Optimal pebbling in products of graphs. - David S. Herscovici; Benjamin D. Hester; Glenn H. Hurlbert (Australas. J Comb., 2011)

Erdos-Ko-Rado theorems for chordal graphs and trees. - Glenn Hurlbert; Vikram Kamat (J. Comb. Theory A, 2011)

Generalizations of Graham's pebbling conjecture. - David S. Herscovici; Benjamin D. Hester; Glenn H. Hurlbert (Discret. Math., 2012)

General graph pebbling. - Glenn Hurlbert (Discret. Appl. Math., 2013)

t-Pebbling and Extensions. - David S. Herscovici; Benjamin D. Hester; Glenn H. Hurlbert (Graphs Comb., 2013)

Universal Cycles for Weak Orders. - Victoria Horan; Glenn Hurlbert (SIAM J. Discret. Math., 2013)

1-Overlap cycles for Steiner triple systems. - Victoria Horan; Glenn Hurlbert (Des. Codes Cryptogr., 2014)

Gray codes and overlap cycles for restricted weight words. - Victoria Horan; Glenn H. Hurlbert (Discret. Math. Algorithms Appl., 2014)

Pebbling in Split Graphs. - Liliana Alcón; Marisa Gutierrez; Glenn H. Hurlbert (SIAM J. Discret. Math., 2014)

Pebbling in 2-Paths. - Liliana Alcón; Marisa Gutierrez; Glenn Hurlbert (Electron. Notes Discret. Math., 2015)

Pebbling in semi-2-trees. - Liliana Alcón; Marisa Gutierrez; Glenn Hurlbert (Discret. Math., 2017)

The Weight Function Lemma for graph pebbling. - Glenn Hurlbert (J. Comb. Optim., 2017)

New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems. - Glenn Hurlbert; Vikram Kamat (Discret. Math., 2018)

Optimal pebbling number of graphs with given minimum degree. - Andrzej Czygrinow; Glenn Hurlbert; Gyula Y. Katona; László F. Papp (Discret. Appl. Math., 2019)

Erdős-Ko-Rado theorems on the weak Bruhat lattice. - Susanna Fishel; Glenn Hurlbert; Vikram Kamat; Karen Meagher (Discret. Appl. Math., 2019)

An Erdős-Ko-Rado theorem for unions of length 2 paths. - Carl Feghali; Glenn Hurlbert; Vikram Kamat (Discret. Math., 2020)

On intersecting families of independent sets in trees. - Glenn Hurlbert; Vikram Kamat (Discret. Appl. Math., 2022)

Cops and robbers pebbling in graphs. - Joshua Forkin; Glenn Hurlbert (CoRR, 2023)

Pebbling in powers of paths. - Liliana Alcón; Glenn Hurlbert (Discret. Math., 2023)

Pebbling in Kneser Graphs. - Matheus Adauto; Viktoriya Bardenova; Mariana da Cruz; Celina M. H. de Figueiredo; Glenn Hurlbert; Diana Sasaki (LATIN (2), 2024)

Cup stacking in graphs. - Paul Fay; Glenn Hurlbert; Maya Tennant (Discret. Math., 2024)

On the Holroyd-Talbot conjecture for sparse graphs. - Peter Frankl; Glenn Hurlbert (Discret. Math., 2024)

On the pebbling numbers of Flower, Blanuša and Watkins snarks. - Matheus Adauto; Celina M. H. de Figueiredo; Glenn Hurlbert; Diana Sasaki (Discret. Appl. Math., 2025)