Nils Hebbinghaus

According to our database, Nils Hebbinghaus authored at least 23 papers between 2004 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Discrepancy Bounds for a Class of Negatively Dependent Random Points Including Latin Hypercube Samples.

Michael Gnewuch, Nils Hebbinghaus

CoRR, 2021

2014

Discrepancy of (centered) arithmetic progressions in <i>Z</i>_<i>p</i>Zp.

Nils Hebbinghaus, Anand Srivastav

Eur. J. Comb., 2014

2011

Discrepancy of Centered Arithmetic Progressions in Zp (Extended Abstract).

Nils Hebbinghaus, Anand Srivastav

Electron. Notes Discret. Math., 2011

Average update times for fully-dynamic all-pairs shortest paths.

Tobias Friedrich, Nils Hebbinghaus

Discret. Appl. Math., 2011

2010

Plateaus can be harder in multi-objective optimization.

Tobias Friedrich, Nils Hebbinghaus, Frank Neumann

Theor. Comput. Sci., 2010

Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models.

Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt

Evol. Comput., 2010

2009

On the Effects of Adding Objectives to Plateau Functions.

Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler

IEEE Trans. Evol. Comput., 2009

Comparison of simple diversity mechanisms on plateau functions.

Tobias Friedrich, Nils Hebbinghaus, Frank Neumann

Theor. Comput. Sci., 2009

Discrepancy in generalized arithmetic progressions.

Javier Cilleruelo, Nils Hebbinghaus

Eur. J. Comb., 2009

Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem.

Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt

Evol. Comput., 2009

2007

Discrepancy of Sums of two Arithmetic Progressions.

Nils Hebbinghaus

Electron. Notes Discret. Math., 2007

Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators.

Benjamin Doerr, Nils Hebbinghaus, Frank Neumann

Evol. Comput., 2007

Rigorous analyses of simple diversity mechanisms.

Tobias Friedrich, Nils Hebbinghaus, Frank Neumann

Proceedings of the Genetic and Evolutionary Computation Conference, 2007

Do additional objectives make a problem harder?

Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler

Proceedings of the Genetic and Evolutionary Computation Conference, 2007

On improving approximate solutions by evolutionary algorithms.

Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt

Proceedings of the IEEE Congress on Evolutionary Computation, 2007

A rigorous view on neutrality.

Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, Frank Neumann

Proceedings of the IEEE Congress on Evolutionary Computation, 2007

2006

Improved bounds and schemes for the declustering problem.

Benjamin Doerr, Nils Hebbinghaus, Sören Werth

Theor. Comput. Sci., 2006

Speeding up Evolutionary Algorithms by Restricted Mutation Operators.

Nils Hebbinghaus, Benjamin Doerr, Frank Neumann

Electron. Colloquium Comput. Complex., 2006

Discrepancy of Symmetric Products of Hypergraphs.

Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus

Electron. J. Comb., 2006

Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators.

Benjamin Doerr, Nils Hebbinghaus, Frank Neumann

Proceedings of the Parallel Problem Solving from Nature, 2006

2005

Discrepancy of arithmetic structures

Nils Hebbinghaus

PhD thesis, 2005

2004

Discrepancy of Sums of Arithmetic Progressions.

Nils Hebbinghaus

Electron. Notes Discret. Math., 2004

An Improved Discrepancy Approach to Declustering.

Benjamin Doerr, Nils Hebbinghaus, Sören Werth

Electron. Notes Discret. Math., 2004