Daniel Johannsen

	2012
20		Daniel Johannsen, Michael Krivelevich, Wojciech Samotij: Expanders are universal for the class of all spanning trees. SODA 2012: 1539-1551
	2011
19		Benjamin Doerr, Daniel Johannsen, Martin Schmidt: Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets. FOGA 2011: 119-126
18		Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen: Faster black-box algorithms through higher arity operators. FOGA 2011: 163-172
17		Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Daniel Johannsen, Frank Neumann, Benjamin Doerr: Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting. SSVM 2011: 26-37
16		Benjamin Doerr, Daniel Johannsen, Carola Winzen: Multiplicative Drift Analysis CoRR abs/1101.0776: (2011)
	2010
15		Daniel Johannsen, Piyush P. Kurur, Johannes Lengler: Can quantum search accelerate evolutionary algorithms? GECCO 2010: 1433-1440
14		Benjamin Doerr, Daniel Johannsen, Carola Winzen: Multiplicative drift analysis. GECCO 2010: 1449-1456
13		Benjamin Doerr, Daniel Johannsen: Edge-based representation beats vertex-based representation in shortest path problems. GECCO 2010: 759-766
12		Benjamin Doerr, Daniel Johannsen, Carola Winzen: Drift analysis and linear functions revisited. IEEE Congress on Evolutionary Computation 2010: 1-8
11		Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile: More Effective Crossover Operators for the All-Pairs Shortest Path Problem. PPSN (1) 2010: 184-193
10		Daniel Johannsen, Konstantinos Panagiotou: Vertices of Degree k in Random Maps. SODA 2010: 1436-1447
9		Benjamin Doerr, Daniel Johannsen, Carola Winzen: Non-Existence of Linear Universal Drift Functions CoRR abs/1011.3466: (2010)
8		Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen: Faster Black-Box Algorithms Through Higher Arity Operators CoRR abs/1012.0952: (2010)
7		Daniel Johannsen: Random combinatorial structures and randomized search heuristics. Saarland University 2010
	2009
6		Daniel Johannsen, Igor Razgon, Magnus Wahlström: Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. SAT 2009: 80-85
	2008
5		Edda Happ, Daniel Johannsen, Christian Klein, Frank Neumann: Rigorous analyses of fitness-proportional selection for optimizing linear functions. GECCO 2008: 953-960
4		Benjamin Doerr, Daniel Johannsen, Ching Hoo Tang: How Single Ant ACO Systems Optimize Pseudo-Boolean Functions. PPSN 2008: 378-388
3		Peter J. Cameron, Daniel Johannsen, Thomas Prellberg, Pascal Schweitzer: Counting Defective Parking Functions. Electr. J. Comb. 15(1): (2008)
	2007
2		Benjamin Doerr, Daniel Johannsen: Adjacency list matchings: an ideal genotype for cycle covers. GECCO 2007: 1203-1210
1		Benjamin Doerr, Daniel Johannsen: Refined runtime analysis of a basic ant colony optimization algorithm. IEEE Congress on Evolutionary Computation 2007: 501-507

Coauthor Index

1	Peter J. Cameron	[3]
2	Benjamin Doerr	[1] [2] [4] [8] [9] [11] [12] [13] [14] [16] [17] [18] [19]
3	Edda Happ	[5]
4	Sebastian Hoffmann	[17]
5	Christian Klein	[5]
6	Timo Kötzing	[8] [11] [18]
7	Michael Krivelevich	[20]
8	Piyush P. Kurur	[15]
9	Per Kristian Lehre	[8] [18]
10	Johannes Lengler	[15]
11	Markus Mainberger	[17]
12	Frank Neumann	[5] [11] [17]
13	Konstantinos Panagiotou	[10]
14	Thomas Prellberg	[3]
15	Igor Razgon	[6]
16	Wojciech Samotij	[20]
17	Martin Schmidt	[19]
18	Pascal Schweitzer	[3]
19	Ching Hoo Tang	[4] [17]
20	Madeleine Theile	[11]
21	Markus Wagner	[8] [18]
22	Magnus Wahlström	[6]
23	Joachim Weickert	[17]
24	Carola Winzen	[8] [9] [12] [14] [16] [18]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page