Author Info
Name
Affiliation
Papers
DANIEL JOHANNSEN
School of Mathematical Sciences, Tel Aviv University, Ramat Aviv, Tel Aviv, 69978, Israel
20
Collaborators
Citations 
PageRank 
28
211
13.73
Referers 
Referees 
References 
186
408
298
Search Limit
100408
Title
Citations
PageRank
Year
Optimising Spatial and Tonal Data for PDE-based Inpainting10.352015
Evolutionary Algorithms for Quantum Computers.00.342014
Expanders are universal for the class of all spanning trees50.512012
More effective crossover operators for the all-pairs shortest path problem180.752012
Multiplicative Drift Analysis.90.572012
Faster black-box algorithms through higher arity operators301.372011
Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets50.492011
Optimising spatial and tonal data for homogeneous diffusion inpainting180.852011
Non-existence of linear universal drift functions40.442010
More Effective Crossover Operators For The All-Pairs Shortest Path Problem00.342010
Can quantum search accelerate evolutionary algorithms?50.412010
Edge-based representation beats vertex-based representation in shortest path problems170.672010
Drift Analysis And Linear Functions Revisited261.352010
Vertices of degree k in random maps20.392010
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences00.342009
Counting Defective Parking Functions20.392008
Rigorous analyses of fitness-proportional selection for optimizing linear functions322.012008
How Single Ant ACO Systems Optimize Pseudo-Boolean Functions20.412008
Refined Runtime Analysis Of A Basic Ant Colony Optimization Algorithm120.782007
Adjacency list matchings: an ideal genotype for cycle covers230.982007