Tobias Friedrich

The Research Group of Algorithm Engineering, led by Prof. Tobias Friedrich, deals with the theoretical foundation of computer science. This area involves both the design and the analysis of efficient algorithms and the limits of predictability. The focus of the Research Group is on randomized algorithms, random processes, and heuristic optimization. As the primary subject of research, algorithms are investigated mathematically as well as empirically

Research Interest

• Algorithm engineering (e.g. efficient algorithms for the hypervolume, scale-free satisfiabiliy, enumeration in data profiling)
• Probabilistic methods and quasirandomness (e.g. Propp machine)
• Artificial intelligence (e.g. bio-inspired and evolutionary optimization)
• Data science (e.g. time series analytics for industrial IoT services)
• Network science (e.g. hyperbolic network embeddings)
• Distributed algorithms (e.g. information spreading in social networks)
• Graph algorithms (e.g. average-case analysis of dynamic graph algorithms)

Selected Research Projects

• Project "Scale-Free Satisfiability" (since 2018) funded by DFG
• Project "Evolutionary diversity optimisation" (2019-21) funded by ARC (with Frank Neumann)
• Project "The Hyperbolic Geometry of Networks" (since 2018) funded by DFG
• Project "Virtual Compressor" (2018-2021) funded by ILB
• Project "Improving Applicability of Nature-Inspired Optimisation by Joining Theory and Practice" (2016-2020) funded by COST
• Project "Theory of Swarm Algorithms and Their Effectiveness in Uncertain Environments" (since 2016) funded by DFG
• Project "Bio-inspired Computing for Problems with Dynamically Changing Constraints" (2014-16) funded by ARC (with Frank Neumann, Zbigniew Michalewicz, and Marc Schoenauer)
• Project "Analysis of Discrete Load Balancing on Heterogeneous Networks" (since 2015) funded by DFG (with Thomas Sauerwald)
• Project "Parameterized Analysis of Bio-inspired Computing" (2014-16) funded by ARC (with Frank Neumann)
• Project "Speed of Adaptation in Population Genetics and Evolutionary Computation (SAGE)" (2014-16) funded by EU FP7 ICT FET Open Scheme
• Project "Smoothed Parameterized Complexity" (2013-14) funded by GIF
• Project "Average-Case Analysis of Parameterized Problems and Algorithms" (2012-15) funded by DFG (with Jiong Guo)
• Project "Theoretical Foundations of Swarm Intelligence" (2009-11) funded by DFG (with Carsten Witt)

Short Biography

• Since 2019: Dean of Studies (Studiendekan) at the Digital Engineering Faculty of University of Potsdam
• Since 2015: Full professor (W3) at the Faculty of Science of University of Potsdam and Head of the Chair for Algorithm Engineering at the Hasso Plattner Institute Potsdam, Germany
• 2012–15: Full professor (W3) and Chair of Theoretical Computer Science I at the Friedrich-Schiller-Universität Jena, Germany
• 2011–12: Head (W2) of independent research group Random Structures and Algorithms at the Cluster of Excellence MMCI, Saarbrücken, Germany
• 2011–12: Senior researcher and coordinator of the Bio-Inspired Computation Group at the Max-Planck-Institut für Informatik, Saarbrücken, Germany
• 2009–11: Research associate at the Max-Planck-Institut für Informatik, Saarbrücken, Germany
• 2008–09: Postdoc at the International Computer Science Institute, Berkeley, USA
• 2007: Ph. D. (Dr. rer. nat.) in Computer Science, Max-Planck-Institut für Informatik, Saarbrücken, Germany
• 2005: Master's degree (Dipl.-Math.) in Mathematics, Friedrich-Schiller-Universität Jena, Germany
• 2003: Master's degree (M. Sc.) in Computer Science, The University of Sheffield, UK

Academic Activities

• Honorary Title of Adjunct Professor with The University of Adelaide (since 2016)
• Organizer of DCGT 2019, COSEAL 2019, FOGA 2019
• Organizer of Dagstuhl seminar Theory of Randomized Optimization Heuristics in 2019 (with Carola Doerr, Carlos M. Fonseca, Xin Yao)
• Organizer of Oberwolfach seminar Random Graphs: Combinatorics, Complex Networks and Disordered Systems in 2020 (with Amin Coja-Oghlan, Mihyun Kang, Konstantinos Panagiotou)
• Local Chair of GECCO 2017, Editor-in-Chief of GECCO 2016, Co-Chair of the Theory Track of GECCO 2012 (with Jonathan E. Rowe) and GECCO 2013 (with Alberto Moraglio)
• Best Paper Awards at SAT 2018, ESA 2016 and in different tracks of GECCO: Genetic Algorithms (2008), Multiobjective Optimization (2009, 2010), Ant Colony Optimization and Swarm Intelligence (2015)
• (Senior) Program committee member of IJCAI 2018, GECCO 2008-16, PPSN 2008-14, RANDOM 2012, FOGA 2013, SEA 2013, STACS 2015, ESA 2015
• Invited talk at MFCS 2016
• Organizer of the 8th Workshop on Theory of Randomized Search Heuristics ThRaSH 2014
• Tutorial speaker at GECCO 2010, PPSN 2010, GECCO 2011, ThRaSH 2012, CEC 2013, and STACS 2019
• Guest editor of two special issues in Theoretical Computer Science (2013, 2014)
• Selected artist at the 2011 Joint Mathematics Meetings Exhibition of Mathematical Art in New Orleans
• My Erdős Number is two (path: Paul Erdős - Joel Spencer - me).

Teaching

• Current courses taught at HPI can be found here
• Courses taught at Friedrich-Schiller-Universität can be found here
• For bachlor/master thesis topics send an email or stop by my office
• Initiated Sommercamp Informatik at Friedrich-Schiller-Universität

Programming Contests

• Coaching for ACM-ICPC International Collegiate Programming Contest
• Judge of 34. Bundeswettbewerb Informatik
• Organizing Central-European Olympiad in Informatics (CEOI) 2014
• Course on Competitive Programming in SS 2016
• Participation of HPI students in German Collegiate Programming Contest