Prof. Dr. Tobias Friedrich

All publications in 2010

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

Conference Publications


  • Solutions to Open Questio... - Download
    Case, John; Kötzing, Timo Solutions to Open Questions for Non-U-Shaped Learning with Memory LimitationsAlgorithmic Learning Theory (ALT) 2010: 285–299
  • Theoretical Properties of... - Download
    Kötzing, Timo; Neumann, Frank; Röglin, Heiko; Witt, Carsten Theoretical Properties of Two ACO Approaches for the Traveling Salesman ProblemInternational Conference on Swarm Intelligence (ANTS) 2010: 324–335
  • The Cover Time of Determi... - Download
    Friedrich, Tobias; Sauerwald, Thomas The Cover Time of Deterministic Random WalksComputing and Combinatorics Conference (COCOON) 2010: 130–139
  • Strongly Non-U-Shaped Lea... - Download
    Case, John; Kötzing, Timo Strongly Non-U-Shaped Learning Results by General TechniquesConference On Learning Theory (COLT) 2010: 181–193
  • RatFish: A File Sharing P... - Download
    Backes, Michael; Ciobotaru, Oana; Krohmer, Anton RatFish: A File Sharing Protocol Provably Secure against Rational UsersEuropean Symposium on Research in Computer Security (ESORICS) 2010: 607–625
  • Orthogonal Graph Drawing ... - Download
    Bläsius, Thomas; Krug, Marcus; Rutter, Ignaz; Wagner, Dorothea Orthogonal Graph Drawing with Flexibility ConstraintsGraph Drawing (GD) 2010: 92–104
  • Set-based multi-objective... - Download
    Berghammer, Rudolf; Friedrich, Tobias; Neumann, Frank Set-based multi-objective optimization, indicators, and deteriorative cyclesGenetic and Evolutionary Computation Conference (GECCO) 2010: 495–502
  • The maximum hypervolume s... - Download
    Bringmann, Karl; Friedrich, Tobias The maximum hypervolume set yields near-optimal approximationGenetic and Evolutionary Computation Conference (GECCO) 2010: 511–518
    Best Paper Award (EMO Track)
  • Ant colony optimization a... - Download
    Kötzing, Timo; Lehre, Per Kristian; Neumann, Frank; Oliveto, Pietro Simone Ant colony optimization and the minimum cut problemGenetic and Evolutionary Computation Conference (GECCO) 2010: 1393–1400
  • Scaling up indicator-base... - Download
    Voß, Thomas; Friedrich, Tobias; Bringmann, Karl; Igel, Christian Scaling up indicator-based MOEAs by approximating the least hypervolume contributor: a preliminary studyGenetic and Evolutionary Computation Conference (GECCO) 2010: 1975–1978
  • String Extension Learning... - Download
    Kasprzik, Anna; Kötzing, Timo String Extension Learning Using LatticesLanguage and Automata Theory and Applications (LATA) 2010: 380–391
  • More Effective Crossover ... - Download
    Doerr, Benjamin; Johannsen, Daniel; Kötzing, Timo; Neumann, Frank; Theile, Madeleine More Effective Crossover Operators for the All-Pairs Shortest Path ProblemParallel Problem Solving from Nature (PPSN) 2010: 184–193
  • Tight Bounds for the Appr... - Download
    Bringmann, Karl; Friedrich, Tobias Tight Bounds for the Approximation Ratio of the Hypervolume IndicatorParallel Problem Solving from Nature (PPSN) 2010: 607–616
  • Directed Plateau Search f... - Download
    Sutton, Andrew M.; Howe, Adele E.; Whitley, L. Darrell Directed Plateau Search for MAX-k-SATSymposium on Combinatorial Search (SOCS) 2010
  • Efficient Broadcast on Ra... - Download
    Bradonjic, Milan; Elsässer, Robert; Friedrich, Tobias; Sauerwald, Thomas; Stauffer, Alexandre Efficient Broadcast on Random Geometric GraphsSymposium on Discrete Algorithms (SODA) 2010: 1412–1421
  • Quasirandom Load Balancin... - Download
    Friedrich, Tobias; Gairing, Martin; Sauerwald, Thomas Quasirandom Load BalancingSymposium on Discrete Algorithms (SODA) 2010: 1620–1629
  • On Approximate Nash Equil... - Download
    Albers, Susanne; Lenzner, Pascal On Approximate Nash Equilibria in Network DesignWeb and Internet Economics (WINE) 2010: 14–25

Journal Publications


  • Approximating the volume ... - Download
    Bringmann, Karl; Friedrich, Tobias Approximating the volume of unions and intersections of high-dimensional geometric objectsComputational Geometry 2010: 601–610
  • Average-case analysis of ... - Download
    Ajwani, Deepak; Friedrich, Tobias Average-case analysis of incremental topological orderingDiscrete Applied Mathematics 2010: 240–250
  • The Cover Time of Determi... - Download
    Friedrich, Tobias; Sauerwald, Thomas The Cover Time of Deterministic Random WalksElectronic Journal of Combinatorics 2010
  • An Efficient Algorithm fo... - Download
    Bringmann, Karl; Friedrich, Tobias An Efficient Algorithm for Computing Hypervolume ContributionsEvolutionary Computation 2010: 383–402
  • Approximating Covering Pr... - Download
    Friedrich, Tobias; He, Jun; Hebbinghaus, Nils; Neumann, Frank; Witt, Carsten Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective ModelsEvolutionary Computation 2010: 617–633
  • When to use bit-wise neut... - Download
    Friedrich, Tobias; Neumann, Frank When to use bit-wise neutralityNatural Computing 2010: 283–294
  • Deterministic random walk... - Download
    Cooper, Joshua N.; Doerr, Benjamin; Friedrich, Tobias; Spencer, Joel Deterministic random walks on regular treesRandom Structures and Algorithms 2010: 353–366
  • Plateaus can be harder in... - Download
    Friedrich, Tobias; Hebbinghaus, Nils; Neumann, Frank Plateaus can be harder in Multi-Objective OptimizationTheoretical Computer Science 2010: 854–864