default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnant P. Godbole
Person information
- affiliation: East Tennessee State University, Department of Mathematics and Statistics, Johnson City, TN, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j32]Amelia Cantwell, Juliann Geraci, Anant P. Godbole, Cristobal Padilla:
Graph universal cycles of combinatorial objects. Adv. Appl. Math. 127: 102166 (2021)
2010 – 2019
- 2018
- [j31]Anant P. Godbole, Zach Higgins, Zoe Koch:
Finite Representability of Integers as 2-Sums. Integers 18B: A3 (2018) - 2017
- [j30]Anant P. Godbole, Elizabeth Kelley, Emily Kurtz, Pawel Pralat, Yiguang Zhang:
The total acquisition number of the randomly weighted path. Discuss. Math. Graph Theory 37(4): 919-934 (2017) - 2016
- [j29]Yonah Biers-Ariel, Yiguang Zhang, Anant P. Godbole:
Some results on superpatterns for preferential arrangements. Adv. Appl. Math. 81: 202-211 (2016) - [j28]Patrick Bahls, Joshua Cooper, Anant P. Godbole, Svetlana Poznanovic:
The Twelfth International Conference on Permutation Patterns, 2014. Australas. J Comb. 64: 1-2 (2016) - [j27]Samuel Connolly, Zachary Gabor, Anant P. Godbole, Bill Kay
, Thomas Kelly:
Bounds on the maximum number of minimum dominating sets. Discret. Math. 339(5): 1537-1542 (2016) - [j26]Yonah Biers-Ariel, Anant P. Godbole, Yiguang Zhang:
Preferential Arrangement Superpatterns. Electron. Notes Discret. Math. 54: 9-14 (2016) - [j25]Adam King, Amanda Laubmeier, Kai Orans, Anant P. Godbole:
Universal and Overlap Cycles for Posets, Words, and Juggling Patterns. Graphs Comb. 32(3): 1013-1025 (2016) - [j24]Zachary Cohn, Anant P. Godbole, Elizabeth Wright Harkness, Yiguang Zhang:
The Number of Seymour Vertices in Random Tournaments and Digraphs. Graphs Comb. 32(5): 1805-1816 (2016) - 2015
- [j23]Zach Higgins, Elizabeth Kelley, Bertilla Sieben, Anant P. Godbole:
Universal and Near-Universal Cycles of Set Partitions. Electron. J. Comb. 22(4): 4 (2015) - [j22]Jessie D. Jamieson, Anant P. Godbole, William B. Jamieson, Lucia C. Petito:
Sharp Concentration of Hitting Size for Random Set Systems. Graphs Comb. 31(3): 639-648 (2015) - [j21]Samuel Connolly, Zachary Gabor, Anant P. Godbole:
The Location of the First Ascent in a 123-Avoiding Permutation. Integers 15: A13 (2015) - [j20]Anant P. Godbole, Samuel C. Gutekunst, Vince Lyzinski, Yan Zhuang:
Logarithmic Representability of Integers as k-Sums. Integers 15A: A5 (2015) - 2014
- [j19]Travis G. Buck, Anant P. Godbole:
Size-Maximal Symmetric Difference-Free Families of Subsets of [n]. Graphs Comb. 30(1): 101-108 (2014) - [j18]André Alexander Campbell, Anant P. Godbole, Bill Kay:
Contributions to the Theory of de Bruijn Cycle. Integers 14A: A2 (2014) - 2013
- [j17]Taylor F. Allison, Anant P. Godbole, Kathryn M. Hawley, Bill Kay:
Covering n-Permutations with (n+1)-Permutations. Electron. J. Comb. 20(1): 6 (2013) - [j16]Anant P. Godbole, Chang Mou Lim, Vince Lyzinski, Nicholas George Triantafillou:
Sharp Threshold Asymptotics for the Emergence of Additive Bases. Integers 13: A14 (2013) - 2011
- [j15]Antonio Blanca, Anant P. Godbole:
On Universal Cycles for new Classes of Combinatorial Structures. SIAM J. Discret. Math. 25(4): 1832-1842 (2011) - 2010
- [j14]Arielle Leitner, Anant P. Godbole:
Universal cycles of classes of restricted words. Discret. Math. 310(23): 3303-3309 (2010) - [i1]Michael S. Donders, Anant P. Godbole:
$t$-Covering Arrays Generated by a Tiling Probability Model. CoRR abs/1011.0351 (2010)
2000 – 2009
- 2009
- [j13]Anant P. Godbole, Nathaniel G. Watson, Carl R. Yerger:
Threshold and complexity results for the cover pebbling game. Discret. Math. 309(11): 3609-3624 (2009) - 2008
- [j12]Melody Chan, Anant P. Godbole:
Improved pebbling bounds. Discret. Math. 308(11): 2301-2306 (2008) - 2006
- [j11]Alberto M. Teguia, Anant P. Godbole:
Sierpiński gasket graphs and some of their properties. Australas. J Comb. 35: 181-192 (2006) - 2005
- [j10]Anant P. Godbole, Nathaniel G. Watson, Carl R. Yerger:
Cover Pebbling Thresholds for the Complete Graph. Electron. Notes Discret. Math. 22: 301-304 (2005) - 2004
- [j9]Adam Wierman, Julia Salzman, Michael Jablonski, Anant P. Godbole:
An improved upper bound for the pebbling threshold of the n-path. Discret. Math. 275(1-3): 367-373 (2004) - [j8]Anant P. Godbole, Joseph A. Johnson:
Even 2 × 2 Submatrices of a Random Zero-One Matrix. Graphs Comb. 20(4): 457-466 (2004) - 2001
- [j7]Ben Wieland, Anant P. Godbole:
On the Domination Number of a Random Graph. Electron. J. Comb. 8(1) (2001)
1990 – 1999
- 1998
- [j6]Anant P. Godbole, Laura K. Potter, Erik Jonathan Sandquist:
Sign-balanced covering matrices. Discret. Math. 190(1-3): 79-93 (1998) - 1997
- [j5]Anant P. Godbole, Ben Lamorte, Erik Jonathan Sandquist:
Threshold Functions for the Bipartite Tura'n property. Electron. J. Comb. 4(1) (1997) - [j4]Andrew D. Barbour, Anant P. Godbole, Jinghua Qian:
Imperfections in Random Tournaments. Comb. Probab. Comput. 6(1): 1-15 (1997) - [c1]Anant P. Godbole, Pawel Hitczenko:
Beyond the method of bounded differences. Microsurveys in Discrete Probability 1997: 43-58 - 1996
- [j3]Anant P. Godbole, Sandra E. Thompson, Eric Vigoda:
General upper bounds for covering numbers. Ars Comb. 42 (1996) - [j2]Anant P. Godbole, Daphne E. Skipper, Rachel A. Sunley:
t-Covering Arrays: Upper Bounds and Poisson Approximations. Comb. Probab. Comput. 5: 105-117 (1996) - [j1]Anant P. Godbole, Svante Janson:
Random Covering Designs. J. Comb. Theory A 75(1): 85-98 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
