Finite Representability of Integers as 2-Sums. | 0 | 0.34 | 2018 |
The Total Acquisition Number of the Randomly Weighted Path | 0 | 0.34 | 2017 |
Universal and Overlap Cycles for Posets, Words, and Juggling Patterns. | 0 | 0.34 | 2016 |
Preferential Arrangement Superpatterns | 0 | 0.34 | 2016 |
Some results on superpatterns for preferential arrangements | 0 | 0.34 | 2016 |
The Number of Seymour Vertices in Random Tournaments and Digraphs | 2 | 0.49 | 2016 |
Bounds on the maximum number of minimum dominating sets | 2 | 0.46 | 2016 |
The Twelfth International Conference on Permutation Patterns, 2014. | 0 | 0.34 | 2016 |
Universal and Near-Universal Cycles of Set Partitions | 0 | 0.34 | 2015 |
Sharp Concentration of Hitting Size for Random Set Systems | 0 | 0.34 | 2015 |
Size-Maximal Symmetric Difference-Free Families of Subsets of [n] | 1 | 0.63 | 2014 |
Sharp Threshold Asymptotics for the Emergence of Additive Bases. | 0 | 0.34 | 2013 |
Covering n-Permutations with (n+1)-Permutations. | 0 | 0.34 | 2013 |
On Universal Cycles for new Classes of Combinatorial Structures | 5 | 0.56 | 2011 |
$t$-Covering Arrays Generated by a Tiling Probability Model | 2 | 0.39 | 2010 |
Universal cycles of classes of restricted words | 5 | 0.55 | 2010 |
Threshold and complexity results for the cover pebbling game | 0 | 0.34 | 2009 |
Improved pebbling bounds | 2 | 0.37 | 2008 |
Sierpinski Gasket Graphs And Some Of Their Properties | 0 | 0.34 | 2006 |
Cover Pebbling Thresholds for the Complete Graph | 1 | 0.36 | 2005 |
Even 2 × 2 Submatrices of a Random Zero-One Matrix | 0 | 0.34 | 2004 |
An improved upper bound for the pebbling threshold of the n-path | 5 | 0.55 | 2004 |
On the Domination Number of a Random Graph | 32 | 2.10 | 2001 |
Sign-balanced covering matrices | 0 | 0.34 | 1998 |
Beyond the method of bounded differences. | 3 | 0.56 | 1997 |
Imperfections in Random Tournaments | 2 | 0.89 | 1997 |
Threshold Functions for the Bipartite Tura'n property | 6 | 0.70 | 1997 |
Random covering designs | 3 | 0.57 | 1996 |
General Upper Bounds For Covering Numbers | 1 | 0.40 | 1996 |
t-Covering Arrays: Upper Bounds and Poisson Approximations | 23 | 1.76 | 1996 |