Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. - Katalin Friedl; Gábor Ivanyos; Miklos Santha; Yves F. Verhoeven (CIAC, 2006)

Enhanced algorithms for Local Search. - Yves F. Verhoeven (Inf. Process. Lett., 2006)

A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem. - Yves F. Verhoeven (Theor. Comput. Sci., 2006)

On the Black-Box Complexity of Sperner's Lemma. - Katalin Friedl; Gábor Ivanyos; Miklos Santha; Yves F. Verhoeven (Theory Comput. Syst., 2009)