Homepage
Nils Hebbinghaus
Max-Planck-Institut für Informatik
Department 1: Algorithms and Complexity
Building 46.1, Room 309
Stuhlsatzenhausweg 85
66123 Saarbrücken
Germany
Email:
Get my email address via email
Phone: +49 681 9325 109
Fax: +49 681 9325 199
- Discrepancy Theory
- Discrete Fourier Analysis
- Probabilistic Method
- B. Doerr, N. Hebbinghaus, F. Neumann.
Speeding up Evolutionary Algorithms Through Unsymmetric Mutation
Operators.
Evolutionary Computation, Special Issue "Bridging
Theory and Practice" (2007), accepted.
- D. Bundy, N. Hebbinghaus, B. Stellmacher.
The Local C(G,T) Theorem.
Journal of Algebra 300 (2006), 741-789.
- B. Doerr, N. Hebbinghaus, S. Werth.
Improved Bounds and Schemes for the Declustering Problem.
[pdf]
[ps]
Theoretical Computer Science, 359 (2006), 123-132.
- B. Doerr, M. Gnewuch, N. Hebbinghaus.
Discrepancy of Symmetric Products of Hypergraphs.
[pdf]
[ps]
The Electronic Journal of Combinatorics, 13 (2006), R40.
- T. Friedrich, N. Hebbinghaus, F. Neumann.
Rigorous Analyses of Simple Diversity Mechanisms.
Genetic and Evolutionary Computation Conference (GECCO)
2007, accepted.
- D. Brockhoff, T. Friedrich, N. Hebbinghaus, C. Klein, F. Neumann, E. Zitzler.
Do Additional Objectives Make a Problem Harder?
Genetic and Evolutionary Computation Conference (GECCO)
2007, accepted.
- T. Friedrich, J. He, N. Hebbinghaus, F. Neumann, C. Witt.
Approximating Covering Problems by Randomized Search Heuristics Using
Multi-Objective Models.
Genetic and Evolutionary Computation Conference (GECCO)
2007, accepted.
- B. Doerr, N. Hebbinghaus, F. Neumann.
Speeding up Evolutionary Algorithms Through Restricted Mutation
Operators. [pdf]
[poster]
In Proceedings of PPSN 2006, volume 4193 of Lecture Notes in Computer Science, pages 978-987, Heidelberg, 2006.
- B. Doerr, M. Gnewuch, N. Hebbinghaus.
Discrepancy of products of hypergraphs.
[Dmtcs-Site]
In S. Felsner (Ed.), European Conference on Combinatorics,
Graph Theory and Applications (EuroComb) 2005, volume AE of
Discrete Mathematics & Theoretical Computer Science, pages
323-328.
- B. Doerr, N. Hebbinghaus, S. Werth.
Improved Bounds and Schemes for the
Declustering Problem.
In J. Fiala, V. Koubek, J. Kratochvil (Eds.), Mathematical
Foundations of Computer Science 2004, volume 3153 of
Lecture Notes in Computer Science, pages 760-771, Heidelberg,
2004.
- B. Doerr, N. Hebbinghaus, S. Werth.
An Improved Discrepancy
Approach to Declustering.
In Electronic Notes in Discrete Mathematics 17C, pages
9-13, 2004.
Also in L. Liberti, F. Maffioli (Eds.), Proceedings of CTW
2004, pages 114-118, 2004.
- N. Hebbinghaus.
Discrepancy of Sums of Arithmetic Progressions.
In Electronic Notes in Discrete Mathematics 17C, pages
185-189, 2004.
Also in L. Liberti, F. Maffioli (Eds.), Proceedings of CTW
2004, pages 165-169, 2004.
- N. Hebbinghaus, T. Schoen, A. Srivastav.
Discrepancy of Linear Hyperplanes in F_{q}^{r}.
In J. Fiala (Ed.), Eurocomb '03, pages 196-201, Prague, 2003.
- N. Hebbinghaus.
Discrepancy of Sums of two Arithmetic Progressions.
In ArXiv Mathematics e-prints
, math/0703108, 2007.
- T. Friedrich, J. He, N. Hebbinghaus, F. Neumann, C. Witt.
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models.
In Technical Report, Reihe CI, No. CI-224/07, SFB 531, Universität Dortmund, Germany, 2007.
- B. Doerr, N. Hebbinghaus, S. Werth.
Improved
Bounds and Schemes for the Declustering Problem.
In Berichtsreihe des Mathematischen Seminars der Uni
Kiel, Germany, Bericht 05-1, 2005.
- N. Hebbinghaus.
Discrepancy of Sums of Arithmetic Progressions.
In Berichtsreihe des Mathematischen Seminars der Uni
Kiel, Bericht 05-5, 2005.
- N. Hebbinghaus, T. Schoen, A. Srivastav.
One-Sided Discrepancy of Linear Hyperplanes in Finite Vectorspaces.
In Berichtsreihe des Mathematischen Seminars der Uni
Kiel, Bericht 05-6, 2005.
- B. Doerr, M. Gnewuch, N. Hebbinghaus.
Discrepancy of Products of Hypergraphs.
In Berichtsreihe des Mathematischen Seminars der Uni
Kiel, Bericht 05-2, 2005.
- D. Bundy (joint work with N. Hebbinghaus and B. Stellmacher).
The Local C(G,T) Theorem.
In Oberwolfach Reports 12 (2005), pages 693-695.
- N. Hebbinghaus (joint work with B. Doerr and S. Werth).
Discrepancy and Declustering.
In Oberwolfach Reports 1 (2004), pages 690-694, ISSN 1660-8933.
- 09.07.-15.07.06, Sixth Czech-Slovak International
Symposium on Combinatorics, Graph Theory, Algorithms and
Applications, Prague.
"Discrepancy of Sums of Two Arithmetic
Progressions"
Slides,
Abstract
- 29.09.05 Defense of my doctoral dissertation
"Diskrepanz arithmetischer Strukturen" (german)
Slides
- 05.09.-09.09.05, EuroComb 2005, Berlin.
"Discrepancy of Products of Hypergraphs"
Slides,
Abstract
- 28.04.05, Erdős Magic for Algorithms and Games, Bertinoro
(Forlì), Italy
"Discrepancy of Arithmetic Structures"
Slides
- 02.01.-14.01.05, Research period at the Adama Mickiewicza
University in Poznan.
"One-Sided Discrepancy of Linear
Hyperplanes in Finite Vectorspaces"
[Blackboard talk]
- 20.09.-20.10.04, Research period at the Charles University
Prague (Prof. J. Matousek).
"Discrepancy and Declustering"
Slides
- 29.08.-03.09.04, Analysis of Combinatorial Algorithms and
Concentration of Measure, Dagstuhl.
"Two Quick Number Theoretical Applications for the
Probabilistic Method"
Slides
- 31.05.-02.06.04, Cologne-Twente Workshop on Graphs and
Combinatorial Optimization (CTW 2004), Loveno di Menaggio,
Italy.
"Discrepancy of Sums of Arithmetic Progressions"
Slides,
Abstract
- 07.03.-13.03.04, Discrepancy Theory and Its Applications,
Oberwolfach.
"Discrepancy and Declustering"
Slides,
Abstract
- 14.11.-15.11.03, Colloquium on Combinatorics,
Magdeburg.
"Discrepancy of Linear Hyperplanes in F_{q}^{r}"
Slides,
Abstract
- 14.09.-19.09.03, Jahrestagung der Deutschen
Mathematiker-Vereinigung (Studententagung), Rostock.
"Über die Strucktur minimal parabolischer Untergruppen
der Charackteristik p", (Anerkennungspreis)
Slides
- 08.09.-12.09.03, EuroComb, Prag.
"Discrepancy of Linear Hyperplanes in F_{q}^{r}"
Slides,
Abstract
- 09.08.-13.08.03, Random Strucktures and Algorithms, Poznan.
"Discrepancy of Hyperplanes in Vector Spaces"
Slides
Evolutionary Algorithms (2 hours lecture, 2 hours exercises) together with Benjamin Doerr and Frank Neumann.
Einführung in die Informatik für Hörer aller Fakultäten I (SS06)
Exercises in Discrepancy Theory (WS05/06)
My (good) old volleyball club
My new volleyball club