Ultra-Fast Load Balancing on Scale-Free Networks. - Karl Bringmann; Tobias Friedrich 001; Martin Hoefer 001; Ralf Rothenberger; Thomas Sauerwald (ICALP (2), 2015)

Dominating an s-t-Cut in a Network. - Ralf Rothenberger; Sascha Grau; Michael Rossberg (SOFSEM, 2015)

Probabilistic Routing for On-Street Parking Search. - Tobias Arndt; Danijar Hafner; Thomas Kellermeier; Simon Krogmann; Armin Razmjou; Martin S. Krejca; Ralf Rothenberger; Tobias Friedrich 001 (ESA, 2016)

Phase Transitions for Scale-Free SAT Formulas. - Tobias Friedrich 001; Anton Krohmer; Ralf Rothenberger; Andrew M. Sutton (AAAI, 2017)

Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. - Tobias Friedrich 001; Anton Krohmer; Ralf Rothenberger; Thomas Sauerwald; Andrew M. Sutton (ESA, 2017)

Memory-Restricted Routing with Tiled Map Data. - Thomas Bläsius; Jan Eube; Thomas Feldtkeller; Tobias Friedrich 001; Martin S. Krejca; J. A. Gregor Lagodzinski; Ralf Rothenberger; Julius Severin; Fabian Sommer; Justin Trautmann (SMC, 2018)

Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. - Tobias Friedrich 001; Andreas Göbel 001; Frank Neumann 001; Francesco Quinzan; Ralf Rothenberger (AAAI, 2019)

Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem. - Jannik Peters 001; Daniel Stephan; Isabel Amon; Hans Gawendowicz; Julius Lischeid; Lennart Salabarria; Jonas Umland; Felix Werner; Martin S. Krejca; Ralf Rothenberger; Timo Kötzing; Tobias Friedrich 001 (ICAPS, 2019)

The Satisfiability Threshold for Non-Uniform Random 2-SAT. - Tobias Friedrich 001; Ralf Rothenberger (ICALP, 2019)

Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT. - Tobias Friedrich 001; Ralf Rothenberger (IJCAI, 2019)

Routing for on-street parking search using probabilistic data. - Tobias Friedrich 001; Martin S. Krejca; Ralf Rothenberger; Tobias Arndt; Danijar Hafner; Thomas Kellermeier; Simon Krogmann; Armin Razmjou (AI Commun., 2019)

Greed is Good for Deterministic Scale-Free Networks. - Ankit Chauhan; Tobias Friedrich 001; Ralf Rothenberger (Algorithmica, 2020)

Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. - Tobias Friedrich 001; Frank Neumann 001; Ralf Rothenberger; Andrew M. Sutton (SAT, 2021)

Satisfiability thresholds for non-uniform random k-SAT (Erfüllbarkeitsschwellwerte für nicht-uniformes zufälliges k-SAT) - Ralf Rothenberger (2022)

Evolutionary Diversity Optimisation in Constructing Satisfying Assignments. - Adel Nikfarjam; Ralf Rothenberger; Frank Neumann 001; Tobias Friedrich 001 (GECCO, 2023)

The impact of heterogeneity and geometry on the proof complexity of random satisfiability. - Thomas Bläsius; Tobias Friedrich 001; Andreas Göbel 001; Jordi Levy; Ralf Rothenberger (Random Struct. Algorithms, 2023)