dblp.uni-trier.dewww.uni-trier.de

Nils Hebbinghaus

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

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

Coauthor Index

1Dimo Brockhoff [16]
2Benjamin Doerr [2] [3] [4] [5] [6] [7] [8] [9] [14]
3Tobias Friedrich [11] [12] [13] [15] [16] [17] [18]
4Michael Gnewuch [6] [14]
5Jun He [11] [13] [15]
6Christian Klein [16]
7Frank Neumann [5] [8] [9] [11] [12] [13] [14] [15] [16] [17]
8Sören Werth [2] [3] [4] [7]
9Carsten Witt [11] [13] [15]
10Eckart Zitzler [16]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)