| |
| 2006 | ||
|---|---|---|
| 4 | EE | Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven: Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. CIAC 2006: 380-391 |
| 3 | EE | Yves F. Verhoeven: Enhanced algorithms for Local Search. Inf. Process. Lett. 97(5): 171-176 (2006) |
| 2 | EE | Yves F. Verhoeven: A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem. Theor. Comput. Sci. 359(1-3): 58-68 (2006) |
| 2005 | ||
| 1 | EE | Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven: On the Black-Box Complexity of Sperner's Lemma. FCT 2005: 245-257 |
| 1 | Katalin Friedl | [1] [4] |
| 2 | Gábor Ivanyos | [1] [4] |
| 3 | Miklos Santha | [1] [4] |