H. Gebauer, T.Szabó: Asymptotic random graph intuition for the biased connectivity game. Random Structures and Algorithms , 35 (2009), 431-443.

D. Hefetz, M. Krivelevich, M. Stojaković, T.Szabó: A sharp threshold for the Hamilton cycle Maker-Breaker game. Random Structures and Algorithms, 34 (2009) 112-122.

R. Aharoni, T.Szabó: Vizing's Conjecture for chordal graphs. Discrete Mathematics, 309 (2009), 1766-1768.

D. Hefetz, M. Krivelevich, T.Szabó: Hamilton cycles in highly connected and expanding graphs. Combinatorica ,29 (2009), 547-568.

R. Berke, T.Szabó: Deciding relaxed two-colorability === a hardness jump. Combinatorics, Probability, and Computing, 18 (2009), 53-81.
An extended abstract appeared in Proc. 14th Annual European Symposium on Algorithms (ESA), (2006) 124-135.

D. Hefetz, M. Krivelevich, M. Stojaković, T.Szabó: Fast winning strategies in Maker-Breaker games. Journal of Combinatorial Theory (Series B), 99 (2009), 39-47.