Benjamin Doerr

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Nils Hebbinghaus

> Home > Persons > Benjamin Doerr

Publications

2007
[j36]
- view
  authority control:
- export record
  dblp key:
  - journals/ec/DoerrHN07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ec/DoerrHN07
Benjamin Doerr, Nils Hebbinghaus, Frank Neumann:
Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators. Evol. Comput. 15(4): 401-410 (2007)
[c29]
- view
  authority control:
- export record
  dblp key:
  - conf/cec/DoerrGHN07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cec/DoerrGHN07
Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, Frank Neumann:
A rigorous view on neutrality. IEEE Congress on Evolutionary Computation 2007: 2591-2597
2006
[j27]
- view
  authority control:
- export record
  dblp key:
  - journals/combinatorics/DoerrGH06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/DoerrGH06
Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus:
Discrepancy of Symmetric Products of Hypergraphs. Electron. J. Comb. 13(1) (2006)
[j20]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/DoerrHW06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/DoerrHW06
Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
Improved bounds and schemes for the declustering problem. Theor. Comput. Sci. 359(1-3): 123-132 (2006)
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/ppsn/DoerrHN06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ppsn/DoerrHN06
Benjamin Doerr, Nils Hebbinghaus, Frank Neumann:
Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators. PPSN 2006: 978-987
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-cs-0603012
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-cs-0603012
Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
Improved Bounds and Schemes for the Declustering Problem. CoRR abs/cs/0603012 (2006)
[i1]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - details & citations
- export record
  dblp key:
  - journals/eccc/HebbinghausDN06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/HebbinghausDN06
Nils Hebbinghaus, Benjamin Doerr, Frank Neumann:
Speeding up Evolutionary Algorithms by Restricted Mutation Operators. Electron. Colloquium Comput. Complex. TR06 (2006)
2004
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/endm/DoerrHW04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/DoerrHW04
Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
An Improved Discrepancy Approach to Declustering. Electron. Notes Discret. Math. 17: 129-133 (2004)
[c12]
- no documents available
  - details & citations
- export record
  dblp key:
  - conf/colognetwente/DoerrHW04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/colognetwente/DoerrHW04
Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
An Improved Discrepancy Approach to Declustering. CTW 2004: 114-118
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/mfcs/DoerrHW04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/DoerrHW04
Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
Improved Bounds and Schemes for the Declustering Problem. MFCS 2004: 760-771

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.