default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNils Hebbinghaus
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i4]Michael Gnewuch, Nils Hebbinghaus:
Discrepancy Bounds for a Class of Negatively Dependent Random Points Including Latin Hypercube Samples. CoRR abs/2102.04451 (2021)
2010 – 2019
- 2014
- [j15]Nils Hebbinghaus, Anand Srivastav:
Discrepancy of (centered) arithmetic progressions in ZpZp. Eur. J. Comb. 35: 324-334 (2014) - 2011
- [j14]Tobias Friedrich, Nils Hebbinghaus:
Average update times for fully-dynamic all-pairs shortest paths. Discret. Appl. Math. 159(16): 1751-1758 (2011) - [j13]Nils Hebbinghaus, Anand Srivastav:
Discrepancy of Centered Arithmetic Progressions in Zp (Extended Abstract). Electron. Notes Discret. Math. 38: 449-456 (2011) - 2010
- [j12]Tobias Friedrich, Jun He
, Nils Hebbinghaus, Frank Neumann, Carsten Witt:
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Evol. Comput. 18(4): 617-633 (2010) - [j11]Tobias Friedrich, Nils Hebbinghaus, Frank Neumann:
Plateaus can be harder in multi-objective optimization. Theor. Comput. Sci. 411(6): 854-864 (2010)
2000 – 2009
- 2009
- [j10]Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt:
Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. Evol. Comput. 17(1): 3-19 (2009) - [j9]Javier Cilleruelo, Nils Hebbinghaus:
Discrepancy in generalized arithmetic progressions. Eur. J. Comb. 30(7): 1607-1611 (2009) - [j8]Tobias Friedrich, Nils Hebbinghaus, Frank Neumann:
Comparison of simple diversity mechanisms on plateau functions. Theor. Comput. Sci. 410(26): 2455-2462 (2009) - [j7]Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler:
On the Effects of Adding Objectives to Plateau Functions. IEEE Trans. Evol. Comput. 13(3): 591-603 (2009) - 2008
- [c11]Tobias Friedrich, Nils Hebbinghaus:
Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. ISAAC 2008: 692-703 - 2007
- [j6]Benjamin Doerr, Nils Hebbinghaus, Frank Neumann:
Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators. Evol. Comput. 15(4): 401-410 (2007) - [j5]Nils Hebbinghaus:
Discrepancy of Sums of two Arithmetic Progressions. Electron. Notes Discret. Math. 29: 547-551 (2007) - [c10]Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, Frank Neumann:
A rigorous view on neutrality. IEEE Congress on Evolutionary Computation 2007: 2591-2597 - [c9]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 - [c8]Tobias Friedrich, Nils Hebbinghaus, Frank Neumann:
Plateaus can be harder in multi-objective optimization. IEEE Congress on Evolutionary Computation 2007: 2622-2629 - [c7]Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler:
Do additional objectives make a problem harder? GECCO 2007: 765-772 - [c6]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 - [c5]Tobias Friedrich, Nils Hebbinghaus, Frank Neumann:
Rigorous analyses of simple diversity mechanisms. GECCO 2007: 1219-1225 - [i3]Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt:
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j4]Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus:
Discrepancy of Symmetric Products of Hypergraphs. Electron. J. Comb. 13(1) (2006) - [j3]Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
Improved bounds and schemes for the declustering problem. Theor. Comput. Sci. 359(1-3): 123-132 (2006) - [c4]Benjamin Doerr, Nils Hebbinghaus, Frank Neumann:
Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators. PPSN 2006: 978-987 - [i2]Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
Improved Bounds and Schemes for the Declustering Problem. CoRR abs/cs/0603012 (2006) - [i1]Nils Hebbinghaus, Benjamin Doerr, Frank Neumann:
Speeding up Evolutionary Algorithms by Restricted Mutation Operators. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [b1]Nils Hebbinghaus:
Discrepancy of arithmetic structures. Kiel University, Germany, 2005 - 2004
- [j2]Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
An Improved Discrepancy Approach to Declustering. Electron. Notes Discret. Math. 17: 129-133 (2004) - [j1]Nils Hebbinghaus:
Discrepancy of Sums of Arithmetic Progressions. Electron. Notes Discret. Math. 17: 185-189 (2004) - [c3]Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
An Improved Discrepancy Approach to Declustering. CTW 2004: 114-118 - [c2]Nils Hebbinghaus:
Discrepancy of Sums of Arithmetic Progressions. CTW 2004: 165-169 - [c1]Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
Improved Bounds and Schemes for the Declustering Problem. MFCS 2004: 760-771
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
