Edda Happ

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2012
j2		Benjamin Doerr, Edda Happ, Christian Klein: Crossover can provably be useful in evolutionary computation. Theor. Comput. Sci. 425: 17-33 (2012)
	2011
j1		Benjamin Doerr, Edda Happ, Christian Klein: Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem. Evolutionary Computation 19(4): 673-691 (2011)
	2009
b1		Edda Happ: Analyses of evolutionary algorithms. Saarland University 2009
	2008
c5		Benjamin Doerr, Edda Happ: Directed trees: A powerful representation for sorting and ordering problems. IEEE Congress on Evolutionary Computation 2008: 3606-3613
c4		Benjamin Doerr, Edda Happ, Christian Klein: Crossover can provably be useful in evolutionary computation. GECCO 2008: 539-546
c3		Edda Happ, Daniel Johannsen, Christian Klein, Frank Neumann: Rigorous analyses of fitness-proportional selection for optimizing linear functions. GECCO 2008: 953-960
	2007
c2		Benjamin Doerr, Edda Happ, Christian Klein: A tight analysis of the (1 + 1)-EA for the single source shortest path problem. IEEE Congress on Evolutionary Computation 2007: 1890-1895
	2006
c1		Friedrich Eisenbrand, Edda Happ: Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups. CIAC 2006: 105-114

Coauthor Index

Last update Mon May 20 08:38:44 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page