H. Gebauer, G. Tardos, T. Szabó: The Local Lemma is tight for SAT. 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2011), to appear.
L. Gugelmann, Y. Person, A. Steger and H. Thomas: A randomized version of Ramsey's theorem. Proceedings of EuroComb 11, Electronic Notes in Discrete Mathematics, 38 (2011) 431==436.
H. Hàn, Y. Person and M. Schacht: Note on forcing pairs. Proceedings of EuroComb 11, Electronic Notes in Discrete Mathematics, 38 (2011), 437==442.
D. Hefetz, M. Krivelevich, M. Stojaković, T.Szabó: Global Maker-Breaker games on sparse graphs. European Journal of Combinatorics, to appear.
Y. Person and M. Schacht: An expected polynomial time algorithm for coloring 2-colorable 3-graphs. Discrete Mathematics and Theoretical Computer Science, 13(2) (2011), 1==18.