| Norm-graphs: variations and applications N Alon, L Rónyai, T Szabó Journal of Combinatorial Theory, Series B 76 (2), 280-290, 1999 | 232 | 1999 |
| Norm-graphs and bipartite Turán numbers J Kollár, L Rónyai, T Szabó Combinatorica 16 (3), 399-406, 1996 | 204 | 1996 |
| Positional games D Hefetz, M Krivelevich, M Stojaković, T Szabó Birkhäuser, 2014 | 162 | 2014 |
| Unique sink orientations of cubes T Szabó, E Welzl Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 547-555, 2001 | 115 | 2001 |
| Asymptotic random graph intuition for the biased connectivity game H Gebauer, T Szabó Random Structures & Algorithms 35 (4), 431-443, 2009 | 96 | 2009 |
| Positional games on random graphs M Stojaković, T Szabó Random Structures & Algorithms 26 (1‐2), 204-223, 2005 | 83 | 2005 |
| Fast winning strategies in Maker–Breaker games D Hefetz, M Krivelevich, M Stojaković, T Szabó Journal of Combinatorial Theory, Series B 99 (1), 39-47, 2009 | 78 | 2009 |
| The local lemma is asymptotically tight for SAT H Gebauer, T Szabó, G Tardos Journal of the ACM (JACM) 63 (5), 1-32, 2016 | 76 | 2016 |
| Extremal problems for transversals in graphs with bounded degree T Szabó*, G Tardos Combinatorica 26 (3), 333-351, 2006 | 72 | 2006 |
| Bounded size components—partitions and transversals P Haxell, T Szabó, G Tardos Journal of Combinatorial Theory, Series B 88 (2), 281-297, 2003 | 67 | 2003 |
| Turán’s theorem in the hypercube N Alon, A Krech, T Szabó SIAM Journal on Discrete Mathematics 21 (1), 66-72, 2007 | 65 | 2007 |
| Hamilton cycles in highly connected and expanding graphs D Hefetz, M Krivelevich, T Szabó Combinatorica 29 (5), 547-568, 2009 | 56 | 2009 |
| Avoider–enforcer games D Hefetz, M Krivelevich, T Szabó Journal of Combinatorial Theory, Series A 114 (5), 840-853, 2007 | 55 | 2007 |
| Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs L Babai, A Gál, J Kollár, L Rónyai, T Szabó, A Wigderson Proceedings of the twenty-eighth annual ACM symposium on Theory of computing …, 1996 | 49 | 1996 |
| Planarity, colorability, and minor games D Hefetz, M Krivelevich, M Stojaković, T Szabó SIAM Journal on Discrete Mathematics 22 (1), 194-212, 2008 | 48 | 2008 |
| RANDOM EDGE can be exponential on abstract cubes J Matoušek, T Szabó Advances in Mathematics 204 (1), 262-277, 2006 | 45 | 2006 |
| Biased positional games and small hypergraphs with large covers M Krivelevich, T Szabó the electronic journal of combinatorics, R70-R70, 2008 | 43 | 2008 |
| Avoider–Enforcer: The rules of the game D Hefetz, M Krivelevich, M Stojaković, T Szabó Journal of Combinatorial Theory, Series A 117 (2), 152-163, 2010 | 38 | 2010 |
| Vizing’s conjecture for chordal graphs R Aharoni, T Szabó Discrete Mathematics 309 (6), 1766-1768, 2009 | 38 | 2009 |
| Triangle factors in sparse pseudo-random graphs M Krivelevich*, B Sudakov, T Szabó Combinatorica 24 (3), 403-426, 2004 | 37 | 2004 |
