Name
Papers
Collaborators
ANANT P. GODBOLE
30
55
Citations 
PageRank 
Referers 
95
16.08
186
Referees 
References 
124
98
Search Limit
100186
Title
Citations
PageRank
Year
Finite Representability of Integers as 2-Sums.00.342018
The Total Acquisition Number of the Randomly Weighted Path00.342017
Universal and Overlap Cycles for Posets, Words, and Juggling Patterns.00.342016
Preferential Arrangement Superpatterns00.342016
Some results on superpatterns for preferential arrangements00.342016
The Number of Seymour Vertices in Random Tournaments and Digraphs20.492016
Bounds on the maximum number of minimum dominating sets20.462016
The Twelfth International Conference on Permutation Patterns, 2014.00.342016
Universal and Near-Universal Cycles of Set Partitions00.342015
Sharp Concentration of Hitting Size for Random Set Systems00.342015
Size-Maximal Symmetric Difference-Free Families of Subsets of [n]10.632014
Sharp Threshold Asymptotics for the Emergence of Additive Bases.00.342013
Covering n-Permutations with (n+1)-Permutations.00.342013
On Universal Cycles for new Classes of Combinatorial Structures50.562011
$t$-Covering Arrays Generated by a Tiling Probability Model20.392010
Universal cycles of classes of restricted words50.552010
Threshold and complexity results for the cover pebbling game00.342009
Improved pebbling bounds20.372008
Sierpinski Gasket Graphs And Some Of Their Properties00.342006
Cover Pebbling Thresholds for the Complete Graph10.362005
Even 2 × 2 Submatrices of a Random Zero-One Matrix00.342004
An improved upper bound for the pebbling threshold of the n-path50.552004
On the Domination Number of a Random Graph322.102001
Sign-balanced covering matrices00.341998
Beyond the method of bounded differences.30.561997
Imperfections in Random Tournaments20.891997
Threshold Functions for the Bipartite Tura'n property60.701997
Random covering designs30.571996
General Upper Bounds For Covering Numbers10.401996
t-Covering Arrays: Upper Bounds and Poisson Approximations231.761996