Ralf Rothenberger

Orcid: 0000-0002-4133-2437

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The impact of heterogeneity and geometry on the proof complexity of random satisfiability.
Random Struct. Algorithms, December, 2023

Evolutionary Diversity Optimisation in Constructing Satisfying Assignments.
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)
PhD thesis, 2022

2021
Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

2020
Greed is Good for Deterministic Scale-Free Networks.
Algorithmica, 2020

2019
Routing for on-street parking search using probabilistic data.
AI Commun., 2019

Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

The Satisfiability Threshold for Non-Uniform Random 2-SAT.
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.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Memory-Restricted Routing with Tiled Map Data.
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2018

2017
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Phase Transitions for Scale-Free SAT Formulas.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Probabilistic Routing for On-Street Parking Search.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Dominating an s-t-Cut in a Network.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Ultra-Fast Load Balancing on Scale-Free Networks.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015


  Loading...