Tobias Friedrich
Tobias Friedrich
Chair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, Germany
Verified email at
Cited by
Cited by
Why rumors spread so quickly in social networks
B Doer, M Fouz, T Friedrich
Communications of the ACM 55 (6), 70-75, 2012
Approximating the volume of unions and intersections of high-dimensional geometric objects
K Bringmann, T Friedrich
Computational Geometry 43 (6-7), 601-610, 2010
Social networks spread rumors in sublogarithmic time
B Doerr, M Fouz, T Friedrich
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
K Bringmann, T Friedrich
International Conference on Evolutionary Multi-Criterion Optimization, 6-20, 2009
Approximating covering problems by randomized search heuristics using multi-objective models
T Friedrich, J He, N Hebbinghaus, F Neumann, C Witt
Evolutionary Computation 18 (4), 617-633, 2010
Quasirandom rumor spreading
B Doerr, T Friedrich, T Sauerwald
ACM Transactions on Algorithms (TALG) 11 (2), 1-35, 2014
Do additional objectives make a problem harder?
D Brockhoff, T Friedrich, N Hebbinghaus, C Klein, F Neumann, E Zitzler
Proceedings of the 9th annual conference on Genetic and evolutionary …, 2007
Nonlinear climate sensitivity and its implications for future greenhouse warming
T Friedrich, A Timmermann, M Tigchelaar, OE Timm, A Ganopolski
Science Advances 2 (11), e1501923, 2016
Approximation quality of the hypervolume indicator
K Bringmann, T Friedrich
Artificial Intelligence 195, 265-290, 2013
The European spallation source design
R Garoby, A Vergara, H Danared, I Alonso, E Bargallo, B Cheymol, ...
Physica Scripta 93 (1), 014001, 2017
Analysis of diversity-preserving mechanisms for global exploration
T Friedrich, PS Oliveto, D Sudholt, C Witt
Evolutionary Computation 17 (4), 455-476, 2009
Analyzing hypervolume indicator based algorithms
D Brockhoff, T Friedrich, F Neumann
International Conference on Parallel Problem Solving from Nature, 651-660, 2008
Approximation-guided evolutionary multi-objective optimization
K Bringmann, T Friedrich, F Neumann, M Wagner
Twenty-Second International Joint Conference on Artificial Intelligence, 2011
Quasirandom rumor spreading: Expanders, push vs. pull, and robustness
B Doerr, T Friedrich, T Sauerwald
Automata, Languages and Programming, 366-377, 2009
On the effects of adding objectives to plateau functions
D Brockhoff, T Friedrich, N Hebbinghaus, C Klein, F Neumann, E Zitzler
IEEE Transactions on Evolutionary Computation 13 (3), 591-603, 2009
An efficient algorithm for computing hypervolume contributions
K Bringmann, T Friedrich
Evolutionary Computation 18 (3), 383-402, 2010
Deterministic random walks on the two-dimensional grid
B Doerr, T Friedrich
Combinatorics, Probability and Computing 18 (1-2), 123-144, 2009
Binding to SMN2 pre-mRNA-protein complex elicits specificity for small molecule splicing modifiers
M Sivaramakrishnan, KD McCarthy, S Campagne, S Huber, S Meier, ...
Nature communications 8 (1), 1-13, 2017
Towards picogram detection of superparamagnetic iron-oxide particles using a gradiometric receive coil
M Graeser, T Knopp, P Szwargulski, T Friedrich, A von Gladiss, M Kaul, ...
Scientific reports 7 (1), 1-13, 2017
A modern Green Revolution gene for reduced height in wheat
T Würschum, SM Langer, CFH Longin, MR Tucker, WL Leiser
The Plant Journal 92 (5), 892-903, 2017
The system can't perform the operation now. Try again later.
Articles 1–20