| |
| 2006 | ||
|---|---|---|
| 9 | EE | Oliver Giel, Ingo Wegener: Maximum cardinality matchings on trees by randomized local search. GECCO 2006: 539-546 |
| 8 | EE | Oliver Giel, Per Kristian Lehre: On the effect of populations in evolutionary multi-objective optimization. GECCO 2006: 651-658 |
| 2005 | ||
| 7 | EE | Oliver Giel: Runtime Analysis of a Simple Multi-Objective Evolutionary Algorithm. Practical Approaches to Multi-Objective Optimization 2005 |
| 6 | EE | Susanne Albers, Lene M. Favrholdt, Oliver Giel: On paging with locality of reference. J. Comput. Syst. Sci. 70(2): 145-175 (2005) |
| 2004 | ||
| 5 | EE | Oliver Giel, Ingo Wegener: Searching Randomly for Maximum Matchings Electronic Colloquium on Computational Complexity (ECCC)(076): (2004) |
| 2003 | ||
| 4 | EE | Oliver Giel, Ingo Wegener: Evolutionary Algorithms and the Maximum Matching Problem. STACS 2003: 415-426 |
| 2002 | ||
| 3 | EE | Susanne Albers, Lene M. Favrholdt, Oliver Giel: On paging with locality of reference. STOC 2002: 258-267 |
| 2001 | ||
| 2 | Oliver Giel: Branching Program Size Is Almost Linear in Formula Size. J. Comput. Syst. Sci. 63(2): 222-235 (2001) | |
| 2000 | ||
| 1 | EE | Oliver Giel: BP(L(f)1+epsilon). IEEE Conference on Computational Complexity 2000: 36-43 |
| 1 | Susanne Albers | [3] [6] |
| 2 | Lene M. Favrholdt | [3] [6] |
| 3 | Per Kristian Lehre | [8] |
| 4 | Ingo Wegener | [4] [5] [9] |