Yves F. Verhoeven

According to our database, Yves F. Verhoeven authored at least 4 papers between 2005 and 2006.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2006

A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem.

Yves F. Verhoeven

Theor. Comput. Sci., 2006

Enhanced algorithms for Local Search.

Yves F. Verhoeven

Inf. Process. Lett., 2006

Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes.

Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

On the Black-Box Complexity of Sperner's Lemma.

Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005