| Greedy maximization of functions with bounded curvature under partition matroid constraints T Friedrich, A Göbel, F Neumann, F Quinzan, R Rothenberger Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2272-2279, 2019 | 43 | 2019 |
| Phase transitions for scale-free SAT formulas T Friedrich, A Krohmer, R Rothenberger, A Sutton Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017 | 29 | 2017 |
| Bounds on the satisfiability threshold for power law distributed random SAT T Friedrich, A Krohmer, R Rothenberger, T Sauerwald, AM Sutton arXiv preprint arXiv:1706.08431, 2017 | 16 | 2017 |
| Mixed integer programming versus evolutionary computation for optimizing a hard real-world staff assignment problem J Peters, D Stephan, I Amon, H Gawendowicz, J Lischeid, L Salabarria, ... Proceedings of the international conference on automated planning and …, 2019 | 11 | 2019 |
| Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT T Friedrich, R Rothenberger Theory and Applications of Satisfiability Testing–SAT 2018: 21st …, 2018 | 11 | 2018 |
| Probabilistic routing for on-street parking search T Arndt, D Hafner, T Kellermeier, S Krogmann, A Razmjou, MS Krejca, ... 24th annual European symposium on algorithms (ESA 2016), 6: 1-6: 13, 2016 | 11 | 2016 |
| Routing for on-street parking search using probabilistic data T Friedrich, MS Krejca, R Rothenberger, T Arndt, D Hafner, T Kellermeier, ... AI Communications 32 (2), 113-124, 2019 | 10 | 2019 |
| The impact of heterogeneity and geometry on the proof complexity of random satisfiability T Bläsius, T Friedrich, A Göbel, J Levy, R Rothenberger Random Structures & Algorithms 63 (4), 885-941, 2023 | 9 | 2023 |
| Evolutionary diversity optimisation in constructing satisfying assignments A Nikfarjam, R Rothenberger, F Neumann, T Friedrich Proceedings of the Genetic and Evolutionary Computation Conference, 938-945, 2023 | 7 | 2023 |
| The satisfiability threshold for non-uniform random 2-SAT T Friedrich, R Rothenberger arXiv preprint arXiv:1904.02027, 2019 | 7 | 2019 |
| Greed is good for deterministic scale-free networks A Chauhan, T Friedrich, R Rothenberger Algorithmica 82 (11), 3338-3389, 2020 | 5 | 2020 |
| Technical Report: Fall Retreat 2018 C Adriano, T Bleifuß, LP Cheng, K Diba, A Fricke, A Grapentin, R Kovacs, ... Universitätsverlag Potsdam, 2019 | 1 | 2019 |
| Memory-restricted routing with tiled map data T Blsius, J Eube, T Feldtkeller, T Friedrich, MS Krejca, JAG Lagodzinski, ... 2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC …, 2018 | 1 | 2018 |
| 24th annual European symposium on algorithms (ESA 2016) L Georgiadis, GF Italiano, N Parotsidis, O Svensson, M Abolhassani, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2016 | 1 | 2016 |
| Ultra-Fast Load Balancing on Scale-Free Networks K Bringmann, T Friedrich, M Hoefer, R Rothenberger, T Sauerwald International Colloquium on Automata, Languages, and Programming, 516-527, 2015 | 1 | 2015 |
| Satisfiability thresholds for non-uniform random k-SAT R Rothenberger Universität Potsdam, 2022 | | 2022 |
| Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily T Friedrich, F Neumann, R Rothenberger, AM Sutton International Conference on Theory and Applications of Satisfiability …, 2021 | | 2021 |
| HPI Future SOC Lab–Proceedings 2017 S Zhang, M Plauth, F Eberhardt, A Polze, J Lehmann, G Sejdiu, H Jabeen, ... Universitätsverlag Potsdam, 2020 | | 2020 |
| compare the results of stochastic local search (SLS) and backtracking SAT solvers near the phase transition of scale-free propositional satisfiability T Friedrich, R Rothenberger, AM Sutton HPI Future SOC Lab: Proceedings 2017 130 (3.3375), 53, 2019 | | 2019 |
| The Structure of Industrial SAT Instances Comparing SLS and Backtracking Solvers T Friedrich, R Rothenberger, AM Sutton HPI Future SOC Lab 2017, 53-58, 2019 | | 2019 |
Tobias FriedrichChair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, GermanyVerified email at hpi.de
