General upper bounds for covering numbers. - Anant P. Godbole; Sandra E. Thompson; Eric Vigoda (Ars Comb., 1996)

t-Covering Arrays: Upper Bounds and Poisson Approximations. - Anant P. Godbole; Daphne E. Skipper; Rachel A. Sunley (Comb. Probab. Comput., 1996)

Random Covering Designs. - Anant P. Godbole; Svante Janson (J. Comb. Theory A, 1996)

Beyond the method of bounded differences. - Anant P. Godbole; Pawel Hitczenko (Microsurveys in Discrete Probability, 1997)

Threshold Functions for the Bipartite Tura'n property. - Anant P. Godbole; Ben Lamorte; Erik Jonathan Sandquist (Electron. J. Comb., 1997)

Imperfections in Random Tournaments. - Andrew D. Barbour; Anant P. Godbole; Jinghua Qian (Comb. Probab. Comput., 1997)

Sign-balanced covering matrices. - Anant P. Godbole; Laura K. Potter; Erik Jonathan Sandquist (Discret. Math., 1998)

On the Domination Number of a Random Graph. - Ben Wieland; Anant P. Godbole (Electron. J. Comb., 2001)

An improved upper bound for the pebbling threshold of the n-path. - Adam Wierman; Julia Salzman; Michael Jablonski; Anant P. Godbole (Discret. Math., 2004)

Even 2 × 2 Submatrices of a Random Zero-One Matrix. - Anant P. Godbole; Joseph A. Johnson (Graphs Comb., 2004)

Cover Pebbling Thresholds for the Complete Graph. - Anant P. Godbole; Nathaniel G. Watson; Carl R. Yerger (Electron. Notes Discret. Math., 2005)

Sierpiński gasket graphs and some of their properties. - Alberto M. Teguia; Anant P. Godbole (Australas. J Comb., 2006)

Improved pebbling bounds. - Melody Chan; Anant P. Godbole (Discret. Math., 2008)

Threshold and complexity results for the cover pebbling game. - Anant P. Godbole; Nathaniel G. Watson; Carl R. Yerger (Discret. Math., 2009)

$t$-Covering Arrays Generated by a Tiling Probability Model - Michael S. Donders; Anant P. Godbole (CoRR, 2010)

Universal cycles of classes of restricted words. - Arielle Leitner; Anant P. Godbole (Discret. Math., 2010)

On Universal Cycles for new Classes of Combinatorial Structures. - Antonio Blanca; Anant P. Godbole (SIAM J. Discret. Math., 2011)

Covering n-Permutations with (n+1)-Permutations. - Taylor F. Allison; Anant P. Godbole; Kathryn M. Hawley; Bill Kay (Electron. J. Comb., 2013)

Sharp Threshold Asymptotics for the Emergence of Additive Bases. - Anant P. Godbole; Chang Mou Lim; Vince Lyzinski; Nicholas George Triantafillou (Integers, 2013)

Size-Maximal Symmetric Difference-Free Families of Subsets of [n]. - Travis G. Buck; Anant P. Godbole (Graphs Comb., 2014)

Contributions to the Theory of de Bruijn Cycle. - André Alexander Campbell; Anant P. Godbole; Bill Kay (Integers, 2014)

Universal and Near-Universal Cycles of Set Partitions. - Zach Higgins; Elizabeth Kelley; Bertilla Sieben; Anant P. Godbole (Electron. J. Comb., 2015)

Sharp Concentration of Hitting Size for Random Set Systems. - Jessie D. Jamieson; Anant P. Godbole; William B. Jamieson; Lucia C. Petito (Graphs Comb., 2015)

The Location of the First Ascent in a 123-Avoiding Permutation. - Samuel Connolly; Zachary Gabor; Anant P. Godbole (Integers, 2015)

Logarithmic Representability of Integers as k-Sums. - Anant P. Godbole; Samuel C. Gutekunst; Vince Lyzinski; Yan Zhuang (Integers, 2015)

Some results on superpatterns for preferential arrangements. - Yonah Biers-Ariel; Yiguang Zhang; Anant P. Godbole (Adv. Appl. Math., 2016)

The Twelfth International Conference on Permutation Patterns, 2014. - Patrick Bahls; Joshua Cooper 002; Anant P. Godbole; Svetlana Poznanovic (Australas. J Comb., 2016)

Bounds on the maximum number of minimum dominating sets. - Samuel Connolly; Zachary Gabor; Anant P. Godbole; Bill Kay; Thomas Kelly 001 (Discret. Math., 2016)

Preferential Arrangement Superpatterns. - Yonah Biers-Ariel; Anant P. Godbole; Yiguang Zhang (Electron. Notes Discret. Math., 2016)

The Number of Seymour Vertices in Random Tournaments and Digraphs. - Zachary Cohn; Anant P. Godbole; Elizabeth Wright Harkness; Yiguang Zhang (Graphs Comb., 2016)

Universal and Overlap Cycles for Posets, Words, and Juggling Patterns. - Adam King; Amanda Laubmeier; Kai Orans; Anant P. Godbole (Graphs Comb., 2016)

The total acquisition number of the randomly weighted path. - Anant P. Godbole; Elizabeth Kelley; Emily Kurtz; Pawel Pralat; Yiguang Zhang (Discuss. Math. Graph Theory, 2017)

Finite Representability of Integers as 2-Sums. - Anant P. Godbole; Zach Higgins; Zoe Koch (Integers, 2018)

Graph universal cycles of combinatorial objects. - Amelia Cantwell; Juliann Geraci; Anant P. Godbole; Cristobal Padilla (Adv. Appl. Math., 2021)