Dr. Oliver Giel

Address: Informatik 2, Universität Dortmund, D-44221 Dortmund, Germany E-mail: oliver.gielcs.uni-dortmund.de

Publications

Journal papers, conference papers and technical reports

• Oliver Giel and Per Kristian Lehre (2006):
  On The Effect of Populations in Evolutionary Multi-objective Optimization.
  In Proceedings of the 8th AnnualGenetic and Evolutionary Computation Conference (GECCO 2006),
  ACM Press, New York, NY, Vol. 1, pp. 651-658,
  Best Paper Award.

  Oliver Giel and Per Kristian Lehre (2006):
  On The Effect of Populations in Evolutionary Multi-objective Optimization.
  Technical Report CI-202/06, Universität Dortmund.

• Oliver Giel (2003):
  Expected Runtimes of a Simple Multi-objective Evolutionary Algorithm.
  In Proceedings of the 2003 Congress on Evolutionary Computation (CEC 2003),
  IEEE Press, Piscataway, NJ, Vol. 3, pp. 1918-1925.

  Oliver Giel (2003):
  Runtime Analyses for a Simple Multi-objective Evolutionary Algorithm.
  Technical Report CI-155/03, Universität Dortmund.

• Oliver Giel and Ingo Wegener (2006):
  Maximum Cardinality Matchings on Trees by Randomized Local Search.
  In Proceedings of the 8th AnnualGenetic and Evolutionary Computation Conference (GECCO 2006),
  ACM Press, New York, NY, Vol. 1, pp. 539-546.

  Oliver Giel and Ingo Wegener (2004):
  Searching Randomly for Maximum Matchings.
  Electronic Colloquium on Computational Complexity (ECCC),
  Report No. 76(2004).

  Oliver Giel and Ingo Wegener (2003):
  Evolutionary Algorithms and the Maximum Matching Problem.
  In Proc. of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003),
  Springer, Lecture Notes in Computer Science (LNCS), Vol. 2607, pp. 415-426.

• Susanne Albers, Lene M. Favrholdt, and Oliver Giel (2005):
  On paging with locality of reference.
  Journal of Computer and System Sciences,
  Vol. 70, No. 2, March 2005, pp. 145-175.

  Susanne Albers, Lene M. Favrholdt, and Oliver Giel (2002):
  On Paging with Locality of Reference.
  In Proc. of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002),
  ACM Press, New York, NY, pp. 258-267.

• Oliver Giel (2001):
  Branching Program Size Is Almost Linear in Formula Size.
  Journal of Computer and System Sciences,
  Vol. 63, No. 2, September 2001, pp. 222-235.

  Oliver Giel (2000):
  BP(f)=O(L(f)^1+ε).
  In Proc. of the 15th Annual IEEE Conference on Computational Complexity (CCC 2000),
  IEEE, pp. 36-43.

Theses

• Oliver Giel (2005):
  Zur Analyse von randomisierten Suchheuristiken und Online-Heuristiken.
  Dissertation, Universität Dortmund.

• Oliver Giel (2000):
  Beziehungen zwischen Branchingprogrammgröße und Formelgröße boolescher Funktionen.
  Diploma Thesis, Universität Dortmund.