Ralf Rothenberger

According to our database, Ralf Rothenberger authored at least 16 papers between 2015 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

The impact of heterogeneity and geometry on the proof complexity of random satisfiability.

Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger

Random Struct. Algorithms, December, 2023

Evolutionary Diversity Optimisation in Constructing Satisfying Assignments.

Adel Nikfarjam, Ralf Rothenberger, Frank Neumann, Tobias Friedrich

Proceedings of the Genetic and Evolutionary Computation Conference, 2023

2022

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

Ralf Rothenberger

PhD thesis, 2022

2021

Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily.

Tobias Friedrich, Frank Neumann, Ralf Rothenberger, Andrew M. Sutton

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

2020

Greed is Good for Deterministic Scale-Free Networks.

Ankit Chauhan, Tobias Friedrich, Ralf Rothenberger

Algorithmica, 2020

2019

Routing for on-street parking search using probabilistic data.

Tobias Friedrich, Martin S. Krejca, Ralf Rothenberger, Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann, Armin Razmjou

AI Commun., 2019

The Satisfiability Threshold for Non-Uniform Random 2-SAT.

Tobias Friedrich, Ralf Rothenberger

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem.

Jannik Peters, Daniel Stephan, Isabel Amon, Hans Gawendowicz, Julius Lischeid, Lennart Salabarria, Jonas Umland, Felix Werner, Martin S. Krejca, Ralf Rothenberger, Timo Kötzing, Tobias Friedrich

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints.

Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Memory-Restricted Routing with Tiled Map Data.

Thomas Bläsius, Jan Eube, Thomas Feldtkeller, Tobias Friedrich, Martin S. Krejca, J. A. Gregor Lagodzinski, Ralf Rothenberger, Julius Severin, Fabian Sommer, Justin Trautmann

Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2018

Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT.

Tobias Friedrich, Ralf Rothenberger

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

2017

Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT.

Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Phase Transitions for Scale-Free SAT Formulas.

Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Andrew M. Sutton

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Probabilistic Routing for On-Street Parking Search.

Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann, Armin Razmjou, Martin S. Krejca, Ralf Rothenberger, Tobias Friedrich

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Dominating an s-t-Cut in a Network.

Ralf Rothenberger, Sascha Grau, Michael Rossberg

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Ultra-Fast Load Balancing on Scale-Free Networks.

Karl Bringmann, Tobias Friedrich, Martin Hoefer, Ralf Rothenberger, Thomas Sauerwald

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015