Anant P. Godbole

Affiliations:
  • East Tennessee State University, Department of Mathematics and Statistics, Johnson City, TN, USA


According to our database1, Anant P. Godbole authored at least 34 papers between 1996 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Graph universal cycles of combinatorial objects.
Adv. Appl. Math., 2021

2018
Finite Representability of Integers as 2-Sums.
Integers, 2018

2017
The total acquisition number of the randomly weighted path.
Discuss. Math. Graph Theory, 2017

2016
Universal and Overlap Cycles for Posets, Words, and Juggling Patterns.
Graphs Comb., 2016

The Number of Seymour Vertices in Random Tournaments and Digraphs.
Graphs Comb., 2016

Preferential Arrangement Superpatterns.
Electron. Notes Discret. Math., 2016

Bounds on the maximum number of minimum dominating sets.
Discret. Math., 2016

The Twelfth International Conference on Permutation Patterns, 2014.
Australas. J Comb., 2016

Some results on superpatterns for preferential arrangements.
Adv. Appl. Math., 2016

2015
Logarithmic Representability of Integers as k-Sums.
Integers, 2015

The Location of the First Ascent in a 123-Avoiding Permutation.
Integers, 2015

Sharp Concentration of Hitting Size for Random Set Systems.
Graphs Comb., 2015

Universal and Near-Universal Cycles of Set Partitions.
Electron. J. Comb., 2015

2014
Contributions to the Theory of de Bruijn Cycle.
Integers, 2014

Size-Maximal Symmetric Difference-Free Families of Subsets of [n].
Graphs Comb., 2014

2013
Sharp Threshold Asymptotics for the Emergence of Additive Bases.
Integers, 2013

Covering n-Permutations with (n+1)-Permutations.
Electron. J. Comb., 2013

2011
On Universal Cycles for new Classes of Combinatorial Structures.
SIAM J. Discret. Math., 2011

2010
Universal cycles of classes of restricted words.
Discret. Math., 2010

$t$-Covering Arrays Generated by a Tiling Probability Model
CoRR, 2010

2009
Threshold and complexity results for the cover pebbling game.
Discret. Math., 2009

2008
Improved pebbling bounds.
Discret. Math., 2008

2006
Sierpiński gasket graphs and some of their properties.
Australas. J Comb., 2006

2005
Cover Pebbling Thresholds for the Complete Graph.
Electron. Notes Discret. Math., 2005

2004
Even 2 × 2 Submatrices of a Random Zero-One Matrix.
Graphs Comb., 2004

An improved upper bound for the pebbling threshold of the <i>n</i>-path.
Discret. Math., 2004

2001
On the Domination Number of a Random Graph.
Electron. J. Comb., 2001

1998
Sign-balanced covering matrices.
Discret. Math., 1998

1997
Imperfections in Random Tournaments.
Comb. Probab. Comput., 1997

Threshold Functions for the Bipartite Tura'n property.
Electron. J. Comb., 1997

Beyond the method of bounded differences.
Proceedings of the Microsurveys in Discrete Probability, 1997

1996
Random Covering Designs.
J. Comb. Theory A, 1996

t-Covering Arrays: Upper Bounds and Poisson Approximations.
Comb. Probab. Comput., 1996

General upper bounds for covering numbers.
Ars Comb., 1996


  Loading...