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

2011

  • Iterative Learning from P... - Download
    Kötzing, Timo Iterative Learning from Positive Data and CountersAlgorithmic Learning Theory (ALT) 2011: 40–54
     
  • Fast Simulation of Large-... - Download
    Friedrich, Tobias; Levine, Lionel Fast Simulation of Large-Scale Growth ModelsApproximation Algorithms for Combinatorial Optimization (APPROX) 2011: 555–566
     
  • Weighted Preferences in E... - Download
    Friedrich, Tobias; Kroeger, Trent; Neumann, Frank Weighted Preferences in Evolutionary Multi-objective OptimizationAustralasian Conference on Artificial Intelligence (AUSAI) 2011: 291–300
     
  • The logarithmic hypervolu... - Download
    Friedrich, Tobias; Bringmann, Karl; Voß, Thomas; Igel, Christian The logarithmic hypervolume indicatorFoundations of Genetic Algorithms (FOGA) 2011: 81–92
     
  • Approximating the distrib... - Download
    Sutton, Andrew M.; Whitley, Darrell; Howe, Adele E. Approximating the distribution of fitness over hamming regionsFoundations of Genetic Algorithms (FOGA) 2011: 93–104
     
  • Faster black-box algorith... - Download
    Doerr, Benjamin; Johannsen, Daniel; Kötzing, Timo; Lehre, Per Kristian; Wagner, Markus; Winzen, Carola Faster black-box algorithms through higher arity operatorsFoundations of Genetic Algorithms (FOGA) 2011: 163–172
     
  • Simple max-min ant system... - Download
    Kötzing, Timo; Neumann, Frank; Sudholt, Dirk; Wagner, Markus Simple max-min ant systems and the optimization of linear pseudo-boolean functionsFoundations of Genetic Algorithms (FOGA) 2011: 209–218
     
  • Convergence of hypervolum... - Download
    Bringmann, Karl; Friedrich, Tobias Convergence of hypervolume-based archiving algorithms I: effectivenessGenetic and Evolutionary Computation Conference (GECCO) 2011: 745–752
    Nominated for Best Paper Award (EMO Track)
     
  • Mutation rates of the (1+... - Download
    Sutton, Andrew M.; Whitley, Darrell; Howe, Adele E. Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasisGenetic and Evolutionary Computation Conference (GECCO) 2011: 973–980
     
  • Black-box complexities of... - Download
    Doerr, Benjamin; Lengler, Johannes; Kötzing, Timo; Winzen, Carola Black-box complexities of combinatorial problemsGenetic and Evolutionary Computation Conference (GECCO) 2011: 981–988
     
  • How crossover helps in ps... - Download
    Kötzing, Timo; Sudholt, Dirk; Theile, Madeleine How crossover helps in pseudo-boolean optimizationGenetic and Evolutionary Computation Conference (GECCO) 2011: 989–996
     
  • Too fast unbiased black-b... - Download
    Doerr, Benjamin; Kötzing, Timo; Winzen, Carola Too fast unbiased black-box algorithmsGenetic and Evolutionary Computation Conference (GECCO) 2011: 2043–2050
     
  • PAC learning and genetic ... - Download
    Kötzing, Timo; Neumann, Frank; Spöhel, Reto PAC learning and genetic programmingGenetic and Evolutionary Computation Conference (GECCO) 2011: 2091–2096
     
  • Constraint Satisfaction P... - Download
    Fellows, Michael R.; Friedrich, Tobias; Hermelin, Danny; Narodytska, Nina; Rosamond, Frances A. Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints TractableInternational Joint Conference on Artificial Intelligence (IJCAI) 2011: 522–527
     
  • Approximation-Guided Evol... - Download
    Bringmann, Karl; Friedrich, Tobias; Neumann, Frank; Wagner, Markus Approximation-Guided Evolutionary Multi-Objective OptimizationInternational Joint Conference on Artificial Intelligence (IJCAI) 2011: 1198–1203
     
  • Diameter and Broadcast Ti... - Download
    Friedrich, Tobias; Sauerwald, Thomas; Stauffer, Alexandre Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary DimensionsInternational Symposium on Algorithms and Computation (ISAAC) 2011: 190–199
     
  • On Dynamics in Basic Netw... - Download
    Lenzner, Pascal On Dynamics in Basic Network Creation GamesSymposium on Algorithmic Game Theory (SAGT) 2011: 254–265
     
  • Randomized Diffusion for ... - Download
    Berenbrink, Petra; Cooper, Colin; Friedetzky, Tom; Friedrich, Tobias; Sauerwald, Thomas Randomized Diffusion for Indivisible LoadsSymposium on Discrete Algorithms (SODA) 2011: 429–439
     
  • Measuring Learning Comple... - Download
    Case, John; Kötzing, Timo Measuring Learning Complexity with Criteria EpitomizersSymposium on Theoretical Aspects of Computer Science (STACS) 2011: 320–331
     
  • Balanced Interval Colorin... - Download
    Antoniadis, Antonios; Hüffner, Falk; Lenzner, Pascal; Moldenhauer, Carsten; Souza, Alexander Balanced Interval ColoringSymposium on Theoretical Aspects of Computer Science (STACS) 2011: 531–542
     
  • Social networks spread ru... - Download
    Doerr, Benjamin; Fouz, Mahmoud; Friedrich, Tobias Social networks spread rumors in sublogarithmic timeSymposium on Theory of Computing (STOC) 2011: 21–30
     

Journal Publications

2011

  • Average update times for ... - Download
    Friedrich, Tobias; Hebbinghaus, Nils Average update times for fully-dynamic all-pairs shortest pathsDiscrete Applied Mathematics 2011: 1751–1758
     
  • Social Networks Spread Ru... - Download
    Doerr, Benjamin; Fouz, Mahmoud; Friedrich, Tobias Social Networks Spread Rumors in Sublogarithmic TimeElectronic Notes in Discrete Mathematics 2011: 303–308
     
  • Quasirandom rumor spreadi... - Download
    Doerr, Benjamin; Friedrich, Tobias; Künnemann, Marvin; Sauerwald, Thomas Quasirandom rumor spreading: An experimental analysisJournal of Experimental Algorithmics 2011
     
  • Smoothed analysis of bala... - Download
    Friedrich, Tobias; Sauerwald, Thomas; Vilenchik, Dan Smoothed analysis of balancing networksRandom Structures and Algorithms 2011: 115–138
     
  • Illustration of Fairness ... - Download
    Friedrich, Tobias; Horoba, Christian; Neumann, Frank Illustration of Fairness in Evolutionary Multi-Objective OptimizationTheoretical Computer Science 2011: 1546–1556