Homepage
- Random Combinatorial Structures and Enumerative Combinatorics
- Search Heuristics and Randomized Algorithms
- Discrete Mathematics and Graph Theory
- Advisor of the bachelor student Martin Schmidt
- Advisor of the bachelor and master student Ching Hoo Tang
-
Vertices of Degree k in Random Maps
[ PDF | bibtex ]
Daniel Johannsen and Konstantinos Panagiotou
To appear: Symposium on Discrete Algorithms (SODA), Austin, USA, 2010.
-
Solving SAT for CNF formulas with a one-sided variable occurrence restriction
[ PDF | bibtex ]
Daniel Johannsen, Igor Razgon, and Magnus Wahlström
In: Conference on Theory and Applications of Satisfiability Testing (SAT), Wales, UK, 2009.
-
Counting Defective Parking Functions
[ PDF | bibtex ]
Peter J. Cameron, Daniel Johannsen, Thomas Prellberg, and Pascal Schweitzer
Electronic Journal of Combinatorics 15 (1): R92, 2008.
-
Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
[ PDF | bibtex ]
Edda Happ, Daniel Johannsen, Christian Klein, and Frank Neumann
In: Genetic and Evolutionary Computation Conference 2008 (GECCO), Atlanta, USA, 2008,
(nominated for Best Paper Award).
-
How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
[ PDF | bibtex ]
Daniel Johannsen, Benjamin Doerr, and Ching Hoo Tang
In: Parallel Problem Solving from Nature — PPSN X (PPSN), Dortmund, Germany, 2008.
-
Refined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
[ PDF | bibtex ]
Benjamin Doerr and Daniel Johannsen
In: IEEE Congress on Evolutionary Computation 2007 (CEC), Singapore, 2007.
-
Adjacency List Matchings — An Ideal Genotype for Cycle Covers
[ PDF | bibtex ]
Benjamin Doerr and Daniel Johannsen
In: Genetic and Evolutionary Computation Conference 2007 (GECCO), London, UK, 2007,
(nominated for Best Paper Award).
-
A Direct Decomposition of 3-connected Planar Graphs
[ PDF | bibtex ]
Manuel Bodirsky, Clemens Gröpl, Daniel Johannsen, and Mihyun Kang
Séminaire Lotharingien de Combinatoire B54Ak, 2007.
-
Sampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time
[ PDF | bibtex ]
Daniel Johannsen
Masters thesis, Humboldt-Universität zu Berlin, 2006.
My and my future clones' Johannsen Number is zero. This is exceptional,
as even famous mathematicians like Paul Erdős only have a Johannsen Number of two.
He was fortunate to collaborate with Peter J. Cameron who again is a co-author of mine. However,
it is my sad obligation to inform poor Paul Erdős that he will most likely not be able to improve on
his Johannsen Number again.
Since the group of my co-authors is rather selected, low Johannsen Numbers are exceptionally rare.
This is supported by the observation that many authors' Johannsen Numbers even exceed their
Erdős Number by two, a comparison which stresses the exclusiveness of low Johannsen Numbers.
Still, there is no reason to despair. By coincident and the triangle inequality your personal
Johannsen Number is actually bounded by two plus your current Erdős Number. Even better,
if you did not understand the previous sentence, your Johannsen Number is likely to be equal to your Erdős number.
