Dr. Tobias Friedrich
Tobias Friedrich has been head of the Independent Research Group Random Structures and Algorithms within the Cluster of Excellence since May 2011.
Research interests
His recent research interests include probabilistic methods and structures, quasirandomness, dynamic graph algorithms, multi-objective optimization, and bio-inspired computation.
Contact
Publications
- T. Friedrich and K. Bringmann and T. Voß and C. Igel The logarithmic hypervolume indicator In: FOGA, 2011
- Petra Berenbrink and Colin Cooper and Tom Friedetzky and Tobias Friedrich and Thomas Sauerwald Randomized Diffusion for Indivisible Loads In: SODA, 2011
- Benjamin Doerr and Mahmoud Fouz and Tobias Friedrich Social networks spread rumors in sublogarithmic time In: STOC, 2011
- Tobias Friedrich and Thomas Sauerwald and Dan Vilenchik Smoothed analysis of balancing networks In: Random Struct. Algorithms, 2011
- Tobias Friedrich and Christian Horoba and Frank Neumann Illustration of fairness in evolutionary multi-objective optimization In: Theor. Comput. Sci., 2011
- Tobias Friedrich and Thomas Sauerwald The Cover Time of Deterministic Random Walks In: COCOON, 2010
- Rudolf Berghammer and Tobias Friedrich and Frank Neumann Set-based multi-objective optimization, indicators, and deteriorative cycles In: GECCO, 2010
- Karl Bringmann and Tobias Friedrich The maximum hypervolume set yields near-optimal approximation In: GECCO, 2010
- Karl Bringmann and Tobias Friedrich Tight Bounds for the Approximation Ratio of the Hypervolume Indicator In: PPSN (1), 2010
- Milan Bradonjic and Robert Elsässer and Tobias Friedrich and Thomas Sauerwald and Alexandre Stauffer Efficient Broadcast on Random Geometric Graphs In: SODA, 2010
- Tobias Friedrich and Martin Gairing and Thomas Sauerwald Quasirandom Load Balancing In: SODA, 2010
- Karl Bringmann and Tobias Friedrich Approximating the volume of unions and intersections of high-dimensional geometric objects In: Comput. Geom., 2010
- Deepak Ajwani and Tobias Friedrich Average-case analysis of incremental topological ordering In: Discrete Applied Mathematics, 2010
- Karl Bringmann and Tobias Friedrich An Efficient Algorithm for Computing Hypervolume Contributions In: Evolutionary Computation, 2010
- Tobias Friedrich and Jun He and Nils Hebbinghaus and Frank Neumann and Carsten Witt Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models In: Evolutionary Computation, 2010
- Tobias Friedrich and Frank Neumann When to use bit-wise neutrality In: Natural Computing, 2010
- Joshua N. Cooper and Benjamin Doerr and Tobias Friedrich and Joel Spencer Deterministic random walks on regular trees In: Random Struct. Algorithms, 2010
- Tobias Friedrich and Nils Hebbinghaus and Frank Neumann Plateaus can be harder in multi-objective optimization In: Theor. Comput. Sci., 2010
- Benjamin Doerr and Tobias Friedrich and Marvin Künnemann and Thomas Sauerwald Quasirandom Rumor Spreading: An Experimental Analysis In: ALENEX, 2009
- Karl Bringmann and Tobias Friedrich Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice In: EMO, 2009
- Karl Bringmann and Tobias Friedrich Don't be greedy when calculating hypervolume contributions In: FOGA, 2009
- Surender Baswana and Somenath Biswas and Benjamin Doerr and Tobias Friedrich and Piyush P. Kurur and Frank Neumann Computing single source shortest paths using single-objective fitness In: FOGA, 2009
- Tobias Friedrich and Christian Horoba and Frank Neumann Multiplicative approximations and the hypervolume indicator In: GECCO, 2009
- Tobias Friedrich and Thomas Sauerwald and Dan Vilenchik Smoothed Analysis of Balancing Networks In: ICALP (2), 2009
- Tobias Friedrich and Thomas Sauerwald Near-perfect load balancing by randomized rounding In: STOC, 2009
- Benjamin Doerr and Tobias Friedrich Deterministic Random Walks on the Two-Dimensional Grid In: Combinatorics, Probability & Computing, 2009
- Tobias Friedrich and Jun He and Nils Hebbinghaus and Frank Neumann and Carsten Witt Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem In: Evolutionary Computation, 2009
- Tobias Friedrich and Pietro Simone Oliveto and Dirk Sudholt and Carsten Witt Analysis of Diversity-Preserving Mechanisms for Global Exploration In: Evolutionary Computation, 2009
- Dimo Brockhoff and Tobias Friedrich and Nils Hebbinghaus and Christian Klein and Frank Neumann and Eckart Zitzler On the Effects of Adding Objectives to Plateau Functions In: IEEE Trans. Evolutionary Computation, 2009
- Tobias Friedrich and Nils Hebbinghaus and Frank Neumann Comparison of simple diversity mechanisms on plateau functions In: Theor. Comput. Sci., 2009
- Tobias Friedrich and Pietro Simone Oliveto and Dirk Sudholt and Carsten Witt Theoretical analysis of diversity mechanisms for global exploration In: GECCO, 2008
- Tobias Friedrich and Frank Neumann When to use bit-wise neutrality In: IEEE Congress on Evolutionary Computation, 2008
- Karl Bringmann and Tobias Friedrich Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects In: ISAAC, 2008
- Tobias Friedrich and Nils Hebbinghaus Average Update Times for Fully-Dynamic All-Pairs Shortest Paths In: ISAAC, 2008
- Dimo Brockhoff and Tobias Friedrich and Frank Neumann Analyzing Hypervolume Indicator Based Algorithms In: PPSN, 2008
- Tobias Friedrich and Christian Horoba and Frank Neumann Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization In: PPSN, 2008
- Joshua N. Cooper and Benjamin Doerr and Tobias Friedrich and Joel Spencer Deterministic random walks on regular trees In: SODA, 2008
- Benjamin Doerr and Tobias Friedrich and Thomas Sauerwald Quasirandom rumor spreading In: SODA, 2008
- Deepak Ajwani and Tobias Friedrich and Ulrich Meyer An (2.75) algorithm for incremental topological ordering In: ACM Transactions on Algorithms, 2008
- Tobias Friedrich and Nils Hebbinghaus and Frank Neumann Rigorous analyses of simple diversity mechanisms In: GECCO, 2007
- Dimo Brockhoff and Tobias Friedrich and Nils Hebbinghaus and Christian Klein and Frank Neumann and Eckart Zitzler Do additional objectives make a problem harder? In: GECCO, 2007
- Tobias Friedrich and Nils Hebbinghaus and Frank Neumann and Jun He and Carsten Witt Approximating covering problems by randomized search heuristics using multi-objective models In: GECCO, 2007
- Tobias Friedrich and Jun He and Nils Hebbinghaus and Frank Neumann and Carsten Witt On improving approximate solutions by evolutionary algorithms In: IEEE Congress on Evolutionary Computation, 2007
- Tobias Friedrich and Nils Hebbinghaus and Frank Neumann Plateaus can be harder in multi-objective optimization In: IEEE Congress on Evolutionary Computation, 2007
- Deepak Ajwani and Tobias Friedrich Average-Case Analysis of Online Topological Ordering In: ISAAC, 2007
- Benjamin Doerr and Tobias Friedrich and Christian Klein and Ralf Osbild Unbiased Matrix Rounding In: SWAT, 2006
- Benjamin Doerr and Tobias Friedrich and Christian Klein and Ralf Osbild Rounding of Sequences and Matrices, with Applications In: WAOA, 2005
Affiliation
