MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 21 documents:

  1. More effective crossover operators for the all-pairs shortest path problem
    Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, and Madeleine Theile
    Theoretical Computer Science 471: 12-26, 2013
  2. Multiplicative Drift Analysis
    Benjamin Doerr, Daniel Johannsen, and Carola Winzen
    Algorithmica 64 (4): 673-697, 2012
  3. Non-existence of linear universal drift functions
    Benjamin Doerr, Daniel Johannsen, and Carola Winzen
    Theoretical Computer Science 436: 71-86, 2012
  4. Faster black-box algorithms through higher arity operators
    Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Christian Lehre, Markus Wagner, and Carola Winzen
    In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), Schwarzenberg, Austria, 2011, 163-172
  5. Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
    Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Daniel Johannsen, Frank Neumann, and Benjamin Doerr
    In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, Ein-Gedi, Israel, 2011, 26-37
  6. Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
    Benjamin Doerr, Daniel Johannsen, and Martin Schmidt
    In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, Schwarzenberg, Austria, 2011, 119-126
    [PDF: Download: DoerrJohannsenSchmidt11.pdf]
  7. Can Quantum Search Accelerate Evolutionary Algorithms?
    Daniel Johannsen and Johannes Lengler
    In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), Portland, USA, 2010, 1433-1440
    [PDF: Download: JohannsenLenglerKurur10.pdf]
  8. Drift Analysis and Linear Functions Revisited
    Benjamin Doerr, Daniel Johannsen, and Carola Winzen
    In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, Barcelona, Spain, 2010, 1967-1974
  9. Edge-based representation beats vertex-based representation in shortest path problems
    Benjamin Doerr and Daniel Johannsen
    In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), Portland, USA, 2010, 759-766
    [PDF: Download: DoerrJohannsen10.pdf]
  10. More Effective Crossover Operators for the All-Pairs Shortest Path Problem
    Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, and Madeleine Theile
    In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Krakow, Poland, 2010, 184-193
  11. Multiplicative Drift Analysis
    Benjamin Doerr, Daniel Johannsen, and Carola Winzen
    In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), Portland, USA, 2010, 1449-1456. Note: Best Paper Award
  12. Random combinatorial structures and randomized search heuristics
    Daniel Johannsen
    Doctoral dissertation, Universität des Saarlandes, 2010
    [PDF: Download: PhD_Thesis_Johannsen.pdf] [PDF: Download: ATTLBEBZ.pdf]
  13. Vertices of Degree k in Random Maps
    Daniel Johannsen and Konstantinos Panagiotou
    In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, USA, 2010, 1436-1447. Note: to appear
    [PDF: Download: JohannsenPanagiotou2010.pdf]
  14. Solving SAT for CNF formulas with a one-sided variable occurrence restriction
    Daniel Johannsen, Igor Razgon, and Magnus Wahlström
    In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, Swansea, Wales, United Kingdom, 2009, 80-85
    [PDF: Download: JohannsenRazgonWahlstroem_2008_SolvingSATForCNFFormulasWithAOnesidedRestrictionOnVariableOccurrences.pdf]
  15. Counting Defective Parking Functions
    Peter Cameron, Daniel Johannsen, Thomas Prellberg, and Pascal Schweitzer
    Electronic Journal of Combinatorics 15 (1): R92 p., 2008
    [PDF: Download: CameronJohannsenPrellbergSchweitzer_2008_CountingDefectiveParkingFunctions.pdf]
  16. How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
    Benjamin Doerr, Daniel Johannsen, and Ching Hoo Tang
    In: Parallel Problem Solving from Nature – PPSN X, Dortmund, Germany, 2008, 378-388
    [PDF: Download: DoerrJohannsenTang_HowSingleAntACOSystemsOptimizePseudo-BooleanFunctions.pdf] [PDF: Download: DoerrJohannsenTang_Appendix_HowSingleAntACOSystemsOptimizePseudo-BooleanFunctions.pdf]
  17. Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
    Edda Happ, Daniel Johannsen, Christian Klein, and Frank Neumann
    In: Genetic and Evolutionary Computation Conference 2008, Atlanta, USA, 2008, 953-960
    [PDF: Download: HappJohannsenKleinNeumann_2008_RigorousAnalysesOfFitness-ProportionalSelectionForOptimizingLinearFunctions.pdf]
  18. Sampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time
    Daniel Johannsen
    Master's thesis, Humboldt-Universität zu Berlin, 2006
    [PDF: Download: Johannsen_2006_MasterThesis_SamplingRooted3-ConnectedPlanarGraphsInDeterministicPolynomialTime.pdf]
  19. A Direct Decomposition of 3-connected Planar Graphs
    Manuel Bodirsky, Clemens Gröpl, Daniel Johannsen, and Mihyun Kang
    Séminaire Lotharingien de Combinatoire B54Ak: 15 p., 2007
    [PDF: Download: BodirskyGroeplJohannsenKang_2007_ADirectDecompositionOfThree-ConnectedPlanarGraphs.pdf]
  20. Adjacency List Matchings --- An Ideal Genotype for Cycle Covers
    Benjamin Doerr and Daniel Johannsen
    In: Genetic and Evolutionary Computation Conference (GECCO-2007), London, UK, 2007, 1203-1210
    [PDF: Download: DoerrJohannsen_2007_AdjacencyListMatchings-AnIdealGenotypeForCycleCovers.pdf]
  21. Refined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
    Benjamin Doerr and Daniel Johannsen
    In: IEEE Congress on Evolutionary Computation 2007, Singapore, 2007, 501-507
    [PDF: Download: DoerrJohannsen_2007_RefinedRuntimeAnalysisOfABasicAntColonyOptimizationAlgorithm.pdf]