Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
  
 

All publications in 2011

The following listing contains all publications of the current members of the Algorithm Engineering group in 2011.


Conference Publications

  • BalancedIntervalColoring.pdf
    Antoniadis, Antonios; Hüffner, Falk; Lenzner, Pascal; Moldenhauer, Carsten; Souza, Alexander Balanced Interval Coloring. Symposium on Theoretical Aspects of Computer Science (STACS) 2011: 531-542
     
  • BerenbrinkCFFS11.pdf
    Berenbrink, Petra; Cooper, Colin; Friedetzky, Tom; Friedrich, Tobias; Sauerwald, Thomas Randomized Diffusion for Indivisible Loads. Symposium on Discrete Algorithms (SODA) 2011: 429-439
     
  • BringmannF11.pdf
    Bringmann, Karl; Friedrich, Tobias Convergence of hypervolume-based archiving algorithms I: effectiveness. Genetic and Evolutionary Computation Conference (GECCO) 2011: 745-752
    Nominated for Best Paper Award (EMO Track)
     
  • Approximation-GuidedEvolutionaryMulti-ObjectiveOptimization.pdf
    Bringmann, Karl; Friedrich, Tobias; Neumann, Frank; Wagner, Markus Approximation-Guided Evolutionary Multi-Objective Optimization. International Joint Conference on Artificial Intelligence (IJCAI) 2011: 1198-1203
     
  • MeasuringLearningComplexityWithCriteriaEpitomizers.pdf
    Case, John; Kötzing, Timo Measuring Learning Complexity with Criteria Epitomizers. Symposium on Theoretical Aspects of Computer Science (STACS) 2011: 320-331
     
  • SocialNetworksSpreadRumorsInSublogarithmicTime.pdf
    Doerr, Benjamin; Fouz, Mahmoud; Friedrich, Tobias Social networks spread rumors in sublogarithmic time. Symposium on Theory of Computing (STOC) 2011: 21-30
     
  • FasterBlack-BoxAlgorithmsThroughHigherArityOperators.pdf
    Doerr, Benjamin; Johannsen, Daniel; Kötzing, Timo; Lehre, Per Kristian; Wagner, Markus; Winzen, Carola Faster black-box algorithms through higher arity operators. Foundations of Genetic Algorithms (FOGA) 2011: 163-172
     
  • TooFastUnbiasedBlack-BoxAlgorithms.pdf
    Doerr, Benjamin; Kötzing, Timo; Winzen, Carola Too fast unbiased black-box algorithms. Genetic and Evolutionary Computation Conference (GECCO) 2011: 2043-2050
     
  • Black-BoxComplexitiesOfCombinatorialProblems.pdf
    Doerr, Benjamin; Lengler, Johannes; Kötzing, Timo; Winzen, Carola Black-box complexities of combinatorial problems. Genetic and Evolutionary Computation Conference (GECCO) 2011: 981-988
     
  • FellowsFHNR11.pdf
    Fellows, Michael R.; Friedrich, Tobias; Hermelin, Danny; Narodytska, Nina; Rosamond, Frances A. Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. International Joint Conference on Artificial Intelligence (IJCAI) 2011: 522-527
     
  • FriedrichBVI11.pdf
    Friedrich, Tobias; Bringmann, Karl; Voß, Thomas; Igel, Christian The logarithmic hypervolume indicator. Foundations of Genetic Algorithms (FOGA) 2011: 81-92
     
  • WeightedPreferencesInEvolutionaryMulti-ObjectiveOptimization.pdf
    Friedrich, Tobias; Kroeger, Trent; Neumann, Frank Weighted Preferences in Evolutionary Multi-objective Optimization. Australasian Conference on Artificial Intelligence (AUSAI) 2011: 291-300
     
  • FastSimulationOfLarge-ScaleGrowthModels.pdf
    Friedrich, Tobias; Levine, Lionel Fast Simulation of Large-Scale Growth Models. Approximation Algorithms for Combinatorial Optimization (APPROX) 2011: 555-566
     
  • FriedrichSS11.pdf
    Friedrich, Tobias; Sauerwald, Thomas; Stauffer, Alexandre Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. International Symposium on Algorithms and Computation (ISAAC) 2011: 190-199
     
  • IterativeLearningFromPositiveDataAndCounters.pdf
    Kötzing, Timo Iterative Learning from Positive Data and Counters. Algorithmic Learning Theory (ALT) 2011: 40-54
     
  • PacLearningAndGeneticProgramming.pdf
    Kötzing, Timo; Neumann, Frank; Spöhel, Reto PAC learning and genetic programming. Genetic and Evolutionary Computation Conference (GECCO) 2011: 2091-2096
     
  • SimpleMax-MinAntSystemsAndTheOptimizationOfLinearPseudo-BooleanFunctions.pdf
    Kötzing, Timo; Neumann, Frank; Sudholt, Dirk; Wagner, Markus Simple max-min ant systems and the optimization of linear pseudo-boolean functions. Foundations of Genetic Algorithms (FOGA) 2011: 209-218
     
  • HowCrossoverHelpsInPseudo-BooleanOptimization.pdf
    Kötzing, Timo; Sudholt, Dirk; Theile, Madeleine How crossover helps in pseudo-boolean optimization. Genetic and Evolutionary Computation Conference (GECCO) 2011: 989-996
     
  • OnDynamicsInBasicNetworkCreationGames.pdf
    Lenzner, Pascal On Dynamics in Basic Network Creation Games. Symposium on Algorithmic Game Theory (SAGT) 2011: 254-265
     
  • MutationRatesOfThe(1+1)-EaOnPseudo-BooleanFunctionsOfBoundedEpistasis.pdf
    Sutton, Andrew M.; Whitley, Darrell; Howe, Adele E. Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis. Genetic and Evolutionary Computation Conference (GECCO) 2011: 973-980
     
  • ApproximatingTheDistributionOfFitnessOverHammingRegions.pdf
    Sutton, Andrew M.; Whitley, Darrell; Howe, Adele E. Approximating the distribution of fitness over hamming regions. Foundations of Genetic Algorithms (FOGA) 2011: 93-104
     

Journal Publications

  • SocialNetworksSpreadRumorsInSublogarithmicTimeJournal.pdf
    Doerr, Benjamin; Fouz, Mahmoud; Friedrich, Tobias Social Networks Spread Rumors in Sublogarithmic Time. Electronic Notes in Discrete Mathematics 2011: 303-308
     
  • DoerrFKS11.pdf
    Doerr, Benjamin; Friedrich, Tobias; Künnemann, Marvin; Sauerwald, Thomas Quasirandom rumor spreading: An experimental analysis. ACM Journal of Experimental Algorithmics 2011
     
  • FriedrichH11.pdf
    Friedrich, Tobias; Hebbinghaus, Nils Average update times for fully-dynamic all-pairs shortest paths. Discrete Applied Mathematics 2011: 1751-1758
     
  • IllustrationOfFairnessInEvolutionaryMultiObjectiveOptimizationJournal.pdf
    Friedrich, Tobias; Horoba, Christian; Neumann, Frank Illustration of Fairness in Evolutionary Multi-Objective Optimization. Theoretical Computer Science 2011: 1546-1556
     
  • FriedrichSV11.pdf
    Friedrich, Tobias; Sauerwald, Thomas; Vilenchik, Dan Smoothed analysis of balancing networks. Random Structures and Algorithms 2011: 115-138