selected publications

academic article
 Why almost all kcolorable graphs are easy to color. Theory of Computing Systems. 46:523565. 2010
 On the random satisfiable process. Combinatorics, Probability and Computing. 18:775801. 2009
 Why almost all kCNF formulas are easy. Proc. 13th Internat. Conf. on Analysis of Algorithms (AofA’07). 89102. 2007
 Why almost all kcolorable graphs are easy. STACS 2007. 121132. 2007
 Why almost all satisfiable $ k $CNF formulas are easy. Discrete Mathematics & Theoretical Computer Science. 2007

conference paper
 Solving random satisfiable 3CNF formulas in expected polynomial time. Proceedings of the seventeenth annual ACMSIAM symposium on Discrete algorithm. 454463. 2006
 Semirandom models as benchmarks for coloring algorithms. Proceedings of the Meeting on Analytic Algorithmics and Combinatorics. 211221. 2006