| Counting independent sets in regular hypergraphs | 0 | 0.34 | 2021 |
| Sentry Selection In Sensor Networks: Theory And Algorithms | 1 | 0.36 | 2017 |
| Counting Connected Hypergraphs via the Probabilistic Method. | 2 | 0.44 | 2016 |
| An old approach to the giant component problem | 2 | 0.39 | 2015 |
| Partial Shadows of Set Systems. | 0 | 0.34 | 2015 |
| Monotone Cellular Automata in a Random Environment. | 5 | 1.05 | 2015 |
| Interference percolation. | 0 | 0.34 | 2014 |
| Cover-decomposition and polychromatic numbers | 3 | 0.53 | 2013 |
| Union-closed families of sets | 5 | 0.50 | 2013 |
| A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method. | 4 | 0.97 | 2013 |
| Repeated Degrees in Random Uniform Hypergraphs. | 3 | 0.51 | 2013 |
| Metric Dimension for Random Graphs. | 9 | 0.79 | 2013 |
| Turán Densities of Some Hypergraphs Related to Kk+1k. | 0 | 0.34 | 2012 |
| Graph bootstrap percolation | 3 | 0.52 | 2012 |
| Degree powers in graphs: The erdős-stone theorem | 4 | 0.53 | 2012 |
| Asymptotic normality of the size of the giant component via a random walk | 6 | 0.55 | 2012 |
| The structure of almost all graphs in a hereditary property | 23 | 1.29 | 2011 |
| On covering by translates of a set | 2 | 0.72 | 2011 |
| Energy-Latency Tradeoff For In-Network Function Computation In Random Networks | 4 | 0.40 | 2011 |
| Shadows of ordered graphs | 0 | 0.34 | 2011 |
| Large joints in graphs | 0 | 0.34 | 2011 |
| Bootstrap percolation in high dimensions | 9 | 0.97 | 2010 |
| The unlabelled speed of a hereditary graph property | 6 | 0.54 | 2009 |
| The distribution of the root degree of a random permutation | 2 | 0.65 | 2009 |
| Majority bootstrap percolation on the hypercube | 19 | 2.60 | 2009 |
| Eliminating Cycles in the Discrete Torus | 3 | 0.58 | 2008 |
| Packing d-degenerate graphs | 11 | 0.90 | 2008 |
| Joints in graphs | 7 | 1.06 | 2008 |
| Pentagons vs. triangles | 8 | 1.14 | 2008 |
| Graphs and Hermitian matrices: eigenvalue interlacing | 6 | 1.38 | 2008 |
| Highly connected monochromatic subgraphs | 13 | 1.54 | 2008 |
| On separating systems | 16 | 0.82 | 2007 |
| Note: Cliques and the spectral radius | 1 | 0.41 | 2007 |
| Hereditary properties of combinatorial structures: Posets and oriented graphs | 4 | 0.49 | 2007 |
| Degree distribution of the FKP network model | 19 | 1.49 | 2007 |
| Spread-out percolation in Rd | 5 | 1.08 | 2007 |
| Maximum directed cuts in acyclic digraphs | 16 | 1.14 | 2007 |
| Set colourings of graphs | 12 | 1.73 | 2006 |
| Hereditary properties of partitions, ordered graphs and ordered hypergraphs | 10 | 0.74 | 2006 |
| How many graphs are unions of k-cliques? | 1 | 0.39 | 2006 |
| Proving Integrality Gaps without Knowing the Linear Program | 38 | 1.73 | 2006 |
| A jump to the bell number for hereditary graph properties | 14 | 0.97 | 2005 |
| The phase transition in the uniformly grown random graph has infinite order | 5 | 0.78 | 2005 |
| Isoperimetric Problems for r-sets | 2 | 0.39 | 2004 |
| Hermitian matrices and graphs: singular values and discrepancy | 13 | 1.06 | 2004 |
| The interlace polynomial of a graph | 47 | 2.21 | 2004 |
| Multicoloured extremal problems | 2 | 0.57 | 2004 |
| On the Value of a Random Minimum Weight Steiner Tree | 9 | 0.78 | 2004 |
| The number of graphs without forbidden subgraphs | 22 | 1.79 | 2004 |
| A Two-Variable Interlace Polynomial | 31 | 1.32 | 2004 |
