Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization. - Christian Horoba; Frank Neumann 001 (GECCO, 2008)

Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization. - Tobias Friedrich 001; Christian Horoba; Frank Neumann 001 (PPSN, 2008)

Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem. - Christian Horoba (FOGA, 2009)

Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms. - Christian Horoba; Frank Neumann 001 (FOGA, 2009)

Multiplicative approximations and the hypervolume indicator. - Tobias Friedrich 001; Christian Horoba; Frank Neumann 001 (GECCO, 2009)

Maximal age in randomized search heuristics with aging. - Christian Horoba; Thomas Jansen 001; Christine Zarges (GECCO, 2009)

Running Time Analysis of ACO Systems for Shortest Path Problems. - Christian Horoba; Dirk Sudholt (SLS, 2009)

Ant colony optimization for stochastic shortest path problems. - Christian Horoba; Dirk Sudholt (GECCO, 2010)

Exploring the Runtime of an Evolutionary Algorithm for the Multi-Objective Shortest Path Problem. - Christian Horoba (Evol. Comput., 2010)

Zur Analyse der Optimierungszeit randomisierter Suchheuristiken für kombinatorische Probleme. - Christian Thyssen (2010)

Approximating Pareto-Optimal Sets Using Diversity Strategies in Evolutionary Multi-Objective Optimization. - Christian Horoba; Frank Neumann 001 (Advances in Multi-Objective Nature Inspired Computing, 2010)

Evolutionary algorithms and dynamic programming. - Benjamin Doerr; Anton V. Eremeev; Frank Neumann 001; Madeleine Theile; Christian Thyssen (Theor. Comput. Sci., 2011)

Illustration of fairness in evolutionary multi-objective optimization. - Tobias Friedrich 001; Christian Horoba; Frank Neumann 001 (Theor. Comput. Sci., 2011)

A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems. - Dirk Sudholt; Christian Thyssen (Algorithmica, 2012)

Running time analysis of Ant Colony Optimization for shortest path problems. - Dirk Sudholt; Christian Thyssen (J. Discrete Algorithms, 2012)

Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point. - Tobias Friedrich 001; Frank Neumann 001; Christian Thyssen (Evol. Comput., 2015)