Prof. Dr. Tobias Friedrich

All Publications in 2021

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

Conference Publications


  • Aziz, Haris; Cseh, Agnes; Dickerson, John; McElfresh, DuncanOptimal Kidney Exchange with Immunosuppressants. Conference on Artificial Intelligence (AAAI) 2021
  • Bilò, Davide; Friedrich, Tobias; Lenzner, Pascal; Lowski, Stefanie; Melnichenko, AnnaSelfish Creation of Social Networks. Conference on Artificial Intelligence (AAAI) 2021
  • Kraiczy, Sonja; Cseh, Ágnes; Manlove, DavidOn weakly and strongly popular rankings. International Conference on Autonomous Agents and Multiagent Systems (AAMAS) 2021
  • Aziz, Haris; Chan, Hau; Cseh, Ágnes; Li, Bo; Ramezani, Fahimeh; Wang, ChenhaoMulti-Robot Task Allocation—Complexity and Approximation. International Conference on Autonomous Agents and Multiagent Systems (AAMAS) 2021
  • Adaptive Sampling for Fas... - Download
    Quinzan, Francesco; Doskoč, Vanja; Göbel, Andreas; Friedrich, TobiasAdaptive Sampling for Fast Constrained Maximization of Submodular Functions. Artificial Intelligence and Statistics (AISTATS) 2021
  • Fine-Grained Complexity o... - Download
    Casel, Katrin; Schmid, Markus L.Fine-Grained Complexity of Regular Path Queries. International Conference on Database Theory (ICDT) 2021
  • The Impact of Heterogenei... - Download
    Bläsius, Thomas; Friedrich, Tobias; Göbel, Andreas; Levy, Jordi; Rothenberger, RalfThe Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. Symposium on Discrete Algorithms (SODA) 2021

Journal Publications


  • A Simplified Run Time Ana... - Download
    Doerr, Benjamin; Krejca, Martin S.A Simplified Run Time Analysis of the Univariate Marginal Distribution Algorithm on LeadingOnes. Theoretical Computer Science 2021: 121-128
  • On the Complexity of the ... - Download
    Casel, Katrin; Fernau, Henning; Gaspers, Serge; Gras, Benjamin; Schmid, Markus L.On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory of Computing Systems 2021: 344–409