- CSB - MetaPress - Google - Bing - Yahoo
 | 2009 | |
|---|---|---|
| 5 |      | 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 | ||
| 4 | | Edda Happ, Daniel Johannsen, Christian Klein, Frank Neumann: Rigorous analyses of fitness-proportional selection for optimizing linear functions. GECCO 2008: 953-960 |
| 3 | | Benjamin Doerr, Daniel Johannsen, Ching Hoo Tang: How Single Ant ACO Systems Optimize Pseudo-Boolean Functions. PPSN 2008: 378-388 |
| 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 |
| 1 | Benjamin Doerr | [1] [2] [3] |
| 2 | Edda Happ | [4] |
| 3 | Christian Klein | [4] |
| 4 | Frank Neumann | [4] |
| 5 | Igor Razgon | [5] |
| 6 | Ching Hoo Tang | [3] |
| 7 | Magnus Wahlström | [5] |