| Harnessing the Power of Smart and Connected Health to Tackle COVID-19: IoT, AI, Robotics, and Blockchain for a Better World | 0 | 0.34 | 2021 |
| Minimizing the numbers of cliques and cycles of fixed size in an F-saturated graph | 0 | 0.34 | 2020 |
| Extremal graphs with local covering conditions | 0 | 0.34 | 2020 |
| Induced Turán Numbers. | 0 | 0.34 | 2018 |
| The random k-matching-free process. | 0 | 0.34 | 2018 |
| Packing Hamilton Cycles Online. | 1 | 0.39 | 2018 |
| Cops and Robbers on Planar-Directed Graphs. | 0 | 0.34 | 2017 |
| Judicious partitions of directed graphs. | 3 | 0.41 | 2016 |
| Increasing Hamiltonian paths in random edge orderings. | 0 | 0.34 | 2016 |
| Diameter critical graphs | 0 | 0.34 | 2016 |
| Maximizing the Number of Independent Sets of a Fixed Size. | 3 | 0.50 | 2015 |
| Packing Tree Factors in Random and Pseudo-random Graphs. | 0 | 0.34 | 2014 |
| Thresholds for Extreme Orientability | 1 | 0.35 | 2014 |
| Rainbow hamilton cycles in random graphs | 10 | 0.92 | 2014 |
| Self-Similarity of Graphs. | 7 | 0.74 | 2013 |
| Anarchy is free in network creation. | 3 | 0.40 | 2013 |
| Computing with Voting Trees. | 0 | 0.34 | 2012 |
| Variations on Cops and Robbers | 11 | 0.91 | 2012 |
| Packing tight Hamilton cycles in 3-uniform hypergraphs | 11 | 0.95 | 2012 |
| Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs. | 10 | 0.69 | 2012 |
| On a problem of Erdös and Rothschild on edges in triangles. | 0 | 0.34 | 2012 |
| Stochastic coalescence in logarithmic time | 0 | 0.34 | 2012 |
| The size of a hypergraph and its matching number | 23 | 2.10 | 2012 |
| Bisections of graphs | 7 | 0.60 | 2011 |
| Ramsey games with giants | 3 | 0.42 | 2011 |
| A note on embedding hypertrees | 3 | 0.48 | 2009 |
| Constrained ramsey numbers | 0 | 0.34 | 2009 |
| Large induced trees in Kr -free graphs | 5 | 0.63 | 2009 |
| Avoiding small subgraphs in Achlioptas processes | 14 | 0.81 | 2009 |
| On the strong chromatic number of random graphs | 2 | 0.39 | 2008 |
| Constrained Ramsey Numbers | 0 | 0.34 | 2007 |
| Independent transversals in locally sparse graphs | 5 | 0.51 | 2007 |
| Bounding the Number of Edges in Permutation Graphs | 1 | 0.37 | 2006 |
| Improved Expansion Of Random Cayley Graphs | 10 | 1.04 | 2004 |
| Finding Shortest Paths With Computational Geometry | 0 | 0.34 | 2003 |
