Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
  
 

Ralf Rothenberger

Research Group Algorithm Engineering
Hasso Plattner Institute

Office: A-1.13
Tel: +49 331 5509-417
E-Mail: Ralf.Rothenberger(at)hpi.de

Research Interests

  • Graph Algorithms and Random Graphs, especially scale-free networks
  • Satisfiability, especially random SAT and phase transitions

Activities

I am co-organizing our weekly Research Seminar.

Additionally, I am a supervisor for our Bachelor Project "Optimizing Project Schedules".

Also, I am a member of the HPI's Research School on "Service-Oriented Systems Engineering".

Code and Tools

Power-Law Random SAT generator

The algorithm for this generator was proposed by Ansótegui et al. in "Towards industrial-like random SAT instances" (IJCAI 2009).
We used this generator for the experiments in "Phase Transitions for Scale-Free SAT Formulas" (AAAI 2017) and "Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT" (ESA 2017).

The code of our implementation can be found at https://github.com/RalfRothenberger/Power-Law-Random-SAT-Generator.

 

Publications

[ 2018 ] [ 2017 ] [ 2016 ] [ 2015 ]

2018 [ to top ]

  • BPF1_SMC2018_submission.pdf
    Bläsius, Thomas; Eube, Jan; Feldtkeller, Thomas; Friedrich, Tobias; Krejca, Martin S.; Lagodzinski, J. A. Gregor; Rothenberger, Ralf; Severin, Julius; Sommer, Fabian; Trautmann, Justin Memory-restricted Routing With Tiled Map Data. IEEE International Conference on Systems, Man, and Cybernetics (SMC) 2018
     
  • sharp_SAT_final.pdf
    Friedrich, Tobias; Rothenberger, Ralf Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT. Theory and Applications of Satisfiability Testing (SAT) 2018: 273--291
    Best Paper Award
     

2017 [ to top ]

  • BoundsOnTheSatisfiabilityThresholdForPowerLawDistributedRandomSAT.pdf
    Friedrich, Tobias; Krohmer, Anton; Rothenberger, Ralf; Sauerwald, Thomas; Sutton, Andrew M. Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. European Symposium on Algorithms (ESA) 2017: 37:1-37:15
     
  • 0001KRS17.pdf
    Friedrich, Tobias; Krohmer, Anton; Rothenberger, Ralf; Sutton, Andrew M. Phase Transitions for Scale-Free SAT Formulas. Association for the Advancement of Artificial Intelligence (AAAI) 2017: 3893-3899
     

2016 [ to top ]

  • Chauhan0R16.pdf
    Chauhan, Ankit; Friedrich, Tobias; Rothenberger, Ralf Greed is Good for Deterministic Scale-Free Networks. Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2016: 33:1-33:15
     
  • 2016ESAparking.pdf
    Arndt, Tobias; Hafner, Danijar; Kellermeier, Thomas; Krogmann, Simon; Razmjou, Armin; Krejca, Martin S.; Rothenberger, Ralf; Friedrich, Tobias Probabilistic Routing for On-Street Parking Search. European Symposium on Algorithms (ESA) 2016: 6:1-6:13
     

2015 [ to top ]

  • DominatingAnS-T-CutInANetwork.pdf
    Rothenberger, Ralf; Grau, Sascha; Rossberg, Michael Dominating an s-t-Cut in a Network. Conference on Current Trends in Theory and Practice of Informatics (SOFSEM) 2015: 401-411
     
  • Ultra-FastLoadBalancingOnScale-FreeNetworks.pdf
    Bringmann, Karl; Friedrich, Tobias; Hoefer, Martin; Rothenberger, Ralf; Sauerwald, Thomas Ultra-Fast Load Balancing on Scale-Free Networks. International Colloquium on Automata, Languages and Programming (ICALP) 2015: 516-527