2008 |
18 | EE | Tobias Friedrich,
Nils Hebbinghaus:
Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
ISAAC 2008: 692-703 |
2007 |
17 | EE | Tobias Friedrich,
Nils Hebbinghaus,
Frank Neumann:
Rigorous analyses of simple diversity mechanisms.
GECCO 2007: 1219-1225 |
16 | EE | Dimo Brockhoff,
Tobias Friedrich,
Nils Hebbinghaus,
Christian Klein,
Frank Neumann,
Eckart Zitzler:
Do additional objectives make a problem harder?
GECCO 2007: 765-772 |
15 | EE | Tobias Friedrich,
Nils Hebbinghaus,
Frank Neumann,
Jun He,
Carsten Witt:
Approximating covering problems by randomized search heuristics using multi-objective models.
GECCO 2007: 797-804 |
14 | EE | Benjamin Doerr,
Michael Gnewuch,
Nils Hebbinghaus,
Frank Neumann:
A rigorous view on neutrality.
IEEE Congress on Evolutionary Computation 2007: 2591-2597 |
13 | EE | Tobias Friedrich,
Jun He,
Nils Hebbinghaus,
Frank Neumann,
Carsten Witt:
On improving approximate solutions by evolutionary algorithms.
IEEE Congress on Evolutionary Computation 2007: 2614-2621 |
12 | EE | Tobias Friedrich,
Nils Hebbinghaus,
Frank Neumann:
Plateaus can be harder in multi-objective optimization.
IEEE Congress on Evolutionary Computation 2007: 2622-2629 |
11 | EE | Tobias Friedrich,
Jun He,
Nils Hebbinghaus,
Frank Neumann,
Carsten Witt:
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models.
Electronic Colloquium on Computational Complexity (ECCC) 14(027): (2007) |
10 | EE | Nils Hebbinghaus:
Discrepancy of Sums of two Arithmetic Progressions.
Electronic Notes in Discrete Mathematics 29: 547-551 (2007) |
9 | EE | Benjamin Doerr,
Nils Hebbinghaus,
Frank Neumann:
Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators.
Evolutionary Computation 15(4): 401-410 (2007) |
2006 |
8 | EE | Benjamin Doerr,
Nils Hebbinghaus,
Frank Neumann:
Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators.
PPSN 2006: 978-987 |
7 | EE | Benjamin Doerr,
Nils Hebbinghaus,
Sören Werth:
Improved Bounds and Schemes for the Declustering Problem
CoRR abs/cs/0603012: (2006) |
6 | EE | Benjamin Doerr,
Michael Gnewuch,
Nils Hebbinghaus:
Discrepancy of Symmetric Products of Hypergraphs.
Electr. J. Comb. 13(1): (2006) |
5 | EE | Nils Hebbinghaus,
Benjamin Doerr,
Frank Neumann:
Speeding up Evolutionary Algorithms by Restricted Mutation Operators.
Electronic Colloquium on Computational Complexity (ECCC) 13(083): (2006) |
4 | EE | Benjamin Doerr,
Nils Hebbinghaus,
Sören Werth:
Improved bounds and schemes for the declustering problem.
Theor. Comput. Sci. 359(1-3): 123-132 (2006) |
2004 |
3 | EE | Benjamin Doerr,
Nils Hebbinghaus,
Sören Werth:
Improved Bounds and Schemes for the Declustering Problem.
MFCS 2004: 760-771 |
2 | EE | Benjamin Doerr,
Nils Hebbinghaus,
Sören Werth:
An Improved Discrepancy Approach to Declustering.
Electronic Notes in Discrete Mathematics 17: 129-133 (2004) |
1 | EE | Nils Hebbinghaus:
Discrepancy of Sums of Arithmetic Progressions.
Electronic Notes in Discrete Mathematics 17: 185-189 (2004) |