| The Local Lemma Is Asymptotically Tight for SAT. | 2 | 0.36 | 2016 |
| The Random Graph Intuition for the Tournament Game. | 1 | 0.39 | 2016 |
| On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. | 6 | 0.45 | 2014 |
| Size Ramsey Number of Bounded Degree Graphs for Games. | 0 | 0.34 | 2013 |
| On the construction of 3-chromatic hypergraphs with few edges. | 6 | 0.75 | 2013 |
| On the clique-game | 3 | 0.55 | 2012 |
| On Rainbow Cycles and Paths | 2 | 0.48 | 2012 |
| Enumerating all Hamilton Cycles and Bounding the Number of Hamilton Cycles in 3-Regular Graphs. | 6 | 0.68 | 2011 |
| Not All Saturated 3-Forests Are Tight | 0 | 0.34 | 2011 |
| A Doubly Exponentially Crumbled Cake | 2 | 0.39 | 2011 |
| Finding and enumerating Hamilton cycles in 4-regular graphs | 8 | 0.67 | 2011 |
| Maker Can Construct a Sparse Graph on a Small Board | 0 | 0.34 | 2010 |
| Fast Exponential-Time Algorithms For The Forest Counting And The Tutte Polynomial Computation In Graph Classes | 0 | 0.34 | 2009 |
| Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges | 0 | 0.34 | 2009 |
| Asymptotic random graph intuition for the biased connectivity game | 20 | 1.32 | 2009 |
| Disproof of the neighborhood conjecture with implications to SAT | 8 | 0.51 | 2009 |
| The Lovász Local Lemma and Satisfiability | 7 | 0.48 | 2009 |
| A Strategy for Maker in the Clique Game which Helps to Tackle some Open Problems by Beck | 0 | 0.34 | 2009 |
| Disproving the Neighborhood Conjecture | 0 | 0.34 | 2008 |
| Unsatisfiable (k,(4*2^k/k))-CNF formulas | 0 | 0.34 | 2008 |
| On the Number of Hamilton Cycles in Bounded Degree Graphs. | 10 | 0.93 | 2008 |
| Fast exponential-time algorithms for the forest counting in graph classes | 2 | 0.39 | 2007 |
