Daniel Johannsen

29 papers A* 2A 9B 3Journal 11Unranked 2
YearRankTypeTitle / Venue / Authors
2016 B conf
An SQL-Based Query Language and Engine for Graph Pattern Matching.
ICGT
Christian Krause, Daniel Johannsen, Radwan Deeb, Kai-Uwe Sattler, David Knacker, Anton Niadzelka
2015 J jnl
Optimising Spatial and Tonal Data for PDE-based Inpainting.
CoRR
Laurent Hoeltgen, Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Simon Setzer, Daniel Johannsen, Frank Neumann, Benjamin Doerr
2014 J jnl
Evolutionary Algorithms for Quantum Computers.
Algorithmica
Daniel Johannsen, Piyush P. Kurur, Johannes Lengler
2013 J jnl
Expanders Are Universal for the Class of All Spanning Trees.
Comb. Probab. Comput.
Daniel Johannsen, Michael Krivelevich, Wojciech Samotij
2013 J jnl
More effective crossover operators for the all-pairs shortest path problem.
Theor. Comput. Sci.
Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile
2012 A* conf
Expanders are universal for the class of all spanning trees.
SODA
Daniel Johannsen, Michael Krivelevich, Wojciech Samotij
2012 J jnl
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
CoRR
Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile
2012 J jnl
Multiplicative Drift Analysis.
Algorithmica
Benjamin Doerr, Daniel Johannsen, Carola Winzen
2012 J jnl
Non-existence of linear universal drift functions.
Theor. Comput. Sci.
Benjamin Doerr, Daniel Johannsen, Carola Winzen
2011 — ch.
Evolutionary Computation in Combinatorial Optimization.
Theory of Randomized Search Heuristics
Daniel Johannsen
2011 A conf
Faster black-box algorithms through higher arity operators.
FOGA
Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen
2011 J jnl
Multiplicative Drift Analysis
CoRR
Benjamin Doerr, Daniel Johannsen, Carola Winzen
2011 — conf
Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting.
SSVM
Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Daniel Johannsen, Frank Neumann, Benjamin Doerr
2011 A conf
Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets.
FOGA
Benjamin Doerr, Daniel Johannsen, Martin Schmidt
2010 A conf
Can quantum search accelerate evolutionary algorithms?
GECCO
Daniel Johannsen, Piyush P. Kurur, Johannes Lengler
2010 B conf
Drift analysis and linear functions revisited.
IEEE Congress on Evolutionary Computation
Benjamin Doerr, Daniel Johannsen, Carola Winzen
2010 A conf
Edge-based representation beats vertex-based representation in shortest path problems.
GECCO
Benjamin Doerr, Daniel Johannsen
2010 J jnl
Faster Black-Box Algorithms Through Higher Arity Operators
CoRR
Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen
2010 — conf
More Effective Crossover Operators for the All-Pairs Shortest Path Problem.
PPSN (1)
Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile
2010 A conf
Multiplicative drift analysis.
GECCO
Benjamin Doerr, Daniel Johannsen, Carola Winzen
2010 J jnl
Non-Existence of Linear Universal Drift Functions
CoRR
Benjamin Doerr, Daniel Johannsen, Carola Winzen
2010 — —
Random combinatorial structures and randomized search heuristics.
Daniel Johannsen
2010 A* conf
Vertices of Degree k in Random Maps.
SODA
Daniel Johannsen, Konstantinos Panagiotou
2009 A conf
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences.
SAT
Daniel Johannsen, Igor Razgon, Magnus Wahlström
2008 J jnl
Counting Defective Parking Functions.
Electron. J. Comb.
Peter J. Cameron, Daniel Johannsen, Thomas Prellberg, Pascal Schweitzer
2008 A conf
How Single Ant ACO Systems Optimize Pseudo-Boolean Functions.
PPSN
Benjamin Doerr, Daniel Johannsen, Ching Hoo Tang
2008 A conf
Rigorous analyses of fitness-proportional selection for optimizing linear functions.
GECCO
Edda Happ, Daniel Johannsen, Christian Klein, Frank Neumann
2007 A conf
Adjacency list matchings: an ideal genotype for cycle covers.
GECCO
Benjamin Doerr, Daniel Johannsen
2007 B conf
Refined runtime analysis of a basic ant colony optimization algorithm.
IEEE Congress on Evolutionary Computation
Benjamin Doerr, Daniel Johannsen