| 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, 2272-2279, 2019 | 10 | 2019 |
| Phase transitions for scale-free SAT formulas T Friedrich, A Krohmer, R Rothenberger, AM Sutton Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence …, 2017 | 10 | 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 | 6 | 2017 |
| 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), 2016 | 5 | 2016 |
| The satisfiability threshold for non-uniform random 2-SAT T Friedrich, R Rothenberger arXiv preprint arXiv:1904.02027, 2019 | 3 | 2019 |
| Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT T Friedrich, R Rothenberger International Conference on Theory and Applications of Satisfiability …, 2018 | 3 | 2018 |
| Greed is good for deterministic scale-free networks A Chauhan, T Friedrich, R Rothenberger Algorithmica, 1-52, 2020 | 2 | 2020 |
| 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 | 2 | 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 arXiv preprint arXiv:2004.07319, 2020 | | 2020 |
| HPI Future SOC Lab–Proceedings 2017 S Zhang, M Plauth, F Eberhardt, A Polze, J Lehmann, G Sejdiu, H Jabeen, ... | | 2020 |
| 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 | | 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 | | 2018 |
| Power-Law Distributions in Random Satisfiability R Rothenberger Proceedings of the 10th Ph. D. Retreat of the HPI Research School on Service …, 2018 | | 2018 |
| Analysis of Distributed Algorithms on Scale-free Networks R Rothenberger Proceedings of the 9th Ph. D. retreat of the HPI Research School on service …, 2017 | | 2017 |
| 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 | | 2015 |
| Dominating an s-t-Cut in a Network R Rothenberger, S Grau, M Rossberg International Conference on Current Trends in Theory and Practice of …, 2015 | | 2015 |
| Technical Report: Fall Retreat 2018 C Adriano, T Bleifuß, LP Cheng, K Diba, A Fricke, A Grapentin, R Kovacs, ... Universitätsverlag Potsdam, 0 | | |
| HPI Future SOC Lab: Proceedings 2017 F Bär, AY Barrera-Animas, A Baumann, F Cheng, Y Choudhary, T Cooray, ... Universitätsverlag Potsdam, 0 | | |
| 2 Hardness of scale-free formulas T Friedrich, R Rothenberger, AM Sutton HPI Future SOC Lab: Proceedings 2017 130, 141, 0 | | |
Tobias FriedrichChair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, GermanyVerified email at hpi.de
