BP(L(f)1+epsilon). - Oliver Giel (CCC, 2000)

Branching Program Size Is Almost Linear in Formula Size. - Oliver Giel (J. Comput. Syst. Sci., 2001)

Expected runtimes of a simple multi-objective evolutionary algorithm. - Oliver Giel (IEEE Congress on Evolutionary Computation, 2003)

Evolutionary Algorithms and the Maximum Matching Problem. - Oliver Giel; Ingo Wegener (STACS, 2003)

Searching Randomly for Maximum Matchings - Oliver Giel; Ingo Wegener (Electron. Colloquium Comput. Complex., 2004)

Runtime Analysis of a Simple Multi-Objective Evolutionary Algorithm. - Oliver Giel (Practical Approaches to Multi-Objective Optimization, 2005)

On paging with locality of reference. - Susanne Albers; Lene M. Favrholdt; Oliver Giel (J. Comput. Syst. Sci., 2005)

Zur Analyse von randomisierten Suchheuristiken und Online-Heuristiken - Oliver Giel (2005)

On the effect of populations in evolutionary multi-objective optimization. - Oliver Giel; Per Kristian Lehre (GECCO, 2006)

Maximum cardinality matchings on trees by randomized local search. - Oliver Giel; Ingo Wegener (GECCO, 2006)

On the Effect of Populations in Evolutionary Multi-Objective Optimisation. - Oliver Giel; Per Kristian Lehre (Evol. Comput., 2010)