Ralf Rothenberger

Publication Activity (10 Years)

Years Active: 2015-2023
Publications (10 Years): 22

Top Topics

Satisfiability Problem

Stochastic Local Search

Top Venues

Publications

Adel Nikfarjam, Ralf Rothenberger, Frank Neumann, Tobias Friedrich
Evolutionary Diversity Optimisation in Constructing Satisfying Assignments. GECCO (2023)
Adel Nikfarjam, Ralf Rothenberger, Frank Neumann, Tobias Friedrich
Evolutionary Diversity Optimisation in Constructing Satisfying Assignments. CoRR (2023)
Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger
The impact of heterogeneity and geometry on the proof complexity of random satisfiability. Random Struct. Algorithms 63 (4) (2023)
Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. SODA (2021)
Tobias Friedrich, Frank Neumann, Ralf Rothenberger, Andrew M. Sutton
Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. SAT (2021)
Ankit Chauhan, Tobias Friedrich, Ralf Rothenberger
Greed is Good for Deterministic Scale-Free Networks. Algorithmica 82 (11) (2020)
Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. CoRR (2020)
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
Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem. ICAPS (2019)
Tobias Friedrich, Ralf Rothenberger
The Satisfiability Threshold for Non-Uniform Random 2-SAT. ICALP (2019)
Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. AAAI (2019)
Tobias Friedrich, Ralf Rothenberger
Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT. IJCAI (2019)
Tobias Friedrich, Martin S. Krejca, Ralf Rothenberger, Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann, Armin Razmjou
Routing for on-street parking search using probabilistic data. AI Commun. 32 (2) (2019)
Tobias Friedrich, Ralf Rothenberger
The Satisfiability Threshold for Non-Uniform Random 2-SAT. CoRR (2019)
Thomas Bläsius, Jan Eube, Thomas Feldtkeller, Tobias Friedrich, Martin S. Krejca, J. A. Gregor Lagodzinski, Ralf Rothenberger, Julius Severin, Fabian Sommer, Justin Trautmann
Memory-Restricted Routing with Tiled Map Data. SMC (2018)
Tobias Friedrich, Ralf Rothenberger
Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT. SAT (2018)
Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. CoRR (2018)
Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. CoRR (2017)
Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Andrew M. Sutton
Phase Transitions for Scale-Free SAT Formulas. AAAI (2017)
Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. ESA (2017)
Ankit Chauhan, Tobias Friedrich, Ralf Rothenberger
Greed is Good for Deterministic Scale-Free Networks. CoRR (2016)
Ankit Chauhan, Tobias Friedrich, Ralf Rothenberger
Greed is Good for Deterministic Scale-Free Networks. FSTTCS (2016)
Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann, Armin Razmjou, Martin S. Krejca, Ralf Rothenberger, Tobias Friedrich
Probabilistic Routing for On-Street Parking Search. ESA (2016)
Karl Bringmann, Tobias Friedrich, Martin Hoefer, Ralf Rothenberger, Thomas Sauerwald
Ultra-Fast Load Balancing on Scale-Free Networks. ICALP (2) (2015)
Ralf Rothenberger, Sascha Grau, Michael Rossberg
Dominating an s-t-Cut in a Network. SOFSEM (2015)