Daniel Johannsen

According to our database1, Daniel Johannsen authored at least 22 papers between 2007 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
An SQL-Based Query Language and Engine for Graph Pattern Matching.
Proceedings of the Graph Transformation - 9th International Conference, 2016

2015
Optimising Spatial and Tonal Data for PDE-based Inpainting.
CoRR, 2015

2014
Evolutionary Algorithms for Quantum Computers.
Algorithmica, 2014

2013
More effective crossover operators for the all-pairs shortest path problem.
Theor. Comput. Sci., 2013

Expanders Are Universal for the Class of All Spanning Trees.
Comb. Probab. Comput., 2013

2012
Non-existence of linear universal drift functions.
Theor. Comput. Sci., 2012

Multiplicative Drift Analysis.
Algorithmica, 2012

2011
Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting.
Proceedings of the Scale Space and Variational Methods in Computer Vision, 2011

Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets.
Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

Faster black-box algorithms through higher arity operators.
Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

Evolutionary Computation in Combinatorial Optimization.
Proceedings of the Theory of Randomized Search Heuristics: Foundations and Recent Developments., 2011

2010
Random combinatorial structures and randomized search heuristics.
PhD thesis, 2010

Vertices of Degree k in Random Maps.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Can quantum search accelerate evolutionary algorithms?
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Edge-based representation beats vertex-based representation in shortest path problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Drift analysis and linear functions revisited.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010

2009
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008
Counting Defective Parking Functions.
Electron. J. Comb., 2008

How Single Ant ACO Systems Optimize Pseudo-Boolean Functions.
Proceedings of the Parallel Problem Solving from Nature, 2008

Rigorous analyses of fitness-proportional selection for optimizing linear functions.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

2007
Adjacency list matchings: an ideal genotype for cycle covers.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

Refined runtime analysis of a basic ant colony optimization algorithm.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007


  Loading...