| Independent sets in hypergraphs omitting an intersection | 0 | 0.34 | 2022 |
| Dynamic Concentration Of The Triangle-Free Process | 0 | 0.34 | 2021 |
| A natural barrier in random greedy hypergraph matching. | 0 | 0.34 | 2019 |
| Large girth approximate Steiner triple systems | 0 | 0.34 | 2019 |
| A note on the random greedy independent set algorithm. | 3 | 0.41 | 2016 |
| Bipartite decomposition of random graphs | 1 | 0.39 | 2015 |
| On the Independence Numbers of the Cubes of Odd Cycles. | 2 | 0.48 | 2013 |
| Turán Densities of Some Hypergraphs Related to Kk+1k. | 0 | 0.34 | 2012 |
| SIR epidemics on random graphs with a fixed degree sequence | 5 | 0.68 | 2012 |
| A greedy algorithm for finding a large 2-matching on a random cubic graph | 1 | 0.36 | 2012 |
| Karp-sipser on random graphs with a fixed degree sequence | 6 | 0.60 | 2011 |
| Ramsey games with giants | 3 | 0.42 | 2011 |
| Random greedy triangle-packing beyond the 7/4 barrier | 2 | 0.40 | 2011 |
| Coloring H-free hypergraphs | 8 | 0.64 | 2010 |
| Anti-Ramsey properties of random graphs | 3 | 0.42 | 2010 |
| Hypergraphs with independent neighborhoods | 4 | 0.86 | 2010 |
| Flips in Graphs | 1 | 0.63 | 2010 |
| Hamilton cycles in 3-out | 11 | 0.81 | 2009 |
| Memoryless Rules for Achlioptas Processes | 2 | 0.43 | 2009 |
| Maximum Independent Sets in Certain Powers of Odd Cycles | 1 | 0.36 | 2009 |
| Erdős–ko–rado in random hypergraphs | 5 | 0.67 | 2009 |
| The game chromatic number of random graphs | 7 | 0.65 | 2008 |
| Game chromatic index of graphs with given restrictions on degrees | 3 | 0.63 | 2008 |
| Randomly generated intersecting hypergraphs II | 4 | 0.77 | 2007 |
| First-Order Definability of Trees and Sparse Random Graphs | 2 | 0.39 | 2007 |
| A phase transition for avoiding a giant component | 9 | 0.84 | 2006 |
| Creating a Giant Component | 13 | 1.01 | 2006 |
| Avoidance of a giant component in half the edge set of a random graph | 19 | 1.72 | 2004 |
| Adding random edges to dense graphs | 12 | 1.14 | 2004 |
| Linear Versus Hereditary Discrepancy. | 2 | 0.46 | 2004 |
| On the irregularity strength of trees | 30 | 1.77 | 2004 |
| On Randomly Generated Intersecting Hypergraphs | 3 | 0.82 | 2003 |
| A note on G-intersecting families | 1 | 0.48 | 2003 |
| A nontrivial lower bound on the Shannon capacities of the complements of odd cycles | 5 | 0.63 | 2003 |
| How many random edges make a dense graph Hamiltonian? | 16 | 1.19 | 2003 |
| On a list coloring conjecture of Reed | 7 | 0.66 | 2002 |
| On partitions of discrete boxes | 7 | 0.89 | 2002 |
| Addendum to "avoiding a giant component" | 1 | 0.82 | 2002 |
| Vertex Covers By Edge Disjoint Cliques | 0 | 0.34 | 2001 |
| Six Lonely Runners | 7 | 0.86 | 2001 |
| Arc-Disjoint Paths in Expander Digraphs | 2 | 0.45 | 2001 |
| G-Intersecting Families | 4 | 1.20 | 2001 |
| Avoiding a giant component | 26 | 3.16 | 2001 |
| Note on Sparse Random Graphs and Cover Graphs | 3 | 0.41 | 2000 |
| Min-Wise Independent Linear Permutations | 7 | 0.67 | 2000 |
| Random threshold growth dynamics | 0 | 0.34 | 1999 |
| a construction for sets of integers with distinct subset sums | 2 | 0.46 | 1998 |
