default search action
Ralf Rothenberger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j3]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): 885-941 (2023) - [c15]Adel Nikfarjam
Evolutionary Diversity Optimisation in Constructing Satisfying Assignments. GECCO 2023: 938-945 - [i6]Adel Nikfarjam, Ralf Rothenberger, Frank Neumann, Tobias Friedrich:
Evolutionary Diversity Optimisation in Constructing Satisfying Assignments. CoRR abs/2305.11457 (2023) - 2022
- [b1]Ralf Rothenberger:
Satisfiability thresholds for non-uniform random k-SAT (Erfüllbarkeitsschwellwerte für nicht-uniformes zufälliges k-SAT). University of Potsdam, Germany, 2022 - 2021
- [c14]Tobias Friedrich
Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. SAT 2021: 188-206 - [c13]Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. SODA 2021: 42-53 - 2020
- [j2]Ankit Chauhan, Tobias Friedrich, Ralf Rothenberger
Greed is Good for Deterministic Scale-Free Networks. Algorithmica 82(11): 3338-3389 (2020) - [i5]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 abs/2004.07319 (2020)
2010 – 2019
- 2019
- [j1]Tobias Friedrich, Martin S. Krejca, Ralf Rothenberger
Routing for on-street parking search using probabilistic data. AI Commun. 32(2): 113-124 (2019) - [c12]Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. AAAI 2019: 2272-2279 - [c11]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: 541-554 - [c10]Tobias Friedrich
The Satisfiability Threshold for Non-Uniform Random 2-SAT. ICALP 2019: 61:1-61:14 - [c9]Tobias Friedrich, Ralf Rothenberger:
Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT. IJCAI 2019: 6151-6155 - [i4]Tobias Friedrich, Ralf Rothenberger
The Satisfiability Threshold for Non-Uniform Random 2-SAT. CoRR abs/1904.02027 (2019) - 2018
- [c8]Tobias Friedrich
Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT. SAT 2018: 273-291 - [c7]Thomas Bläsius, Jan Eube, Thomas Feldtkeller, Tobias Friedrich, Martin S. Krejca, J. A. Gregor Lagodzinski
Memory-Restricted Routing with Tiled Map Data. SMC 2018: 3347-3354 - [i3]Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. CoRR abs/1811.05351 (2018) - 2017
- [c6]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Andrew M. Sutton:
Phase Transitions for Scale-Free SAT Formulas. AAAI 2017: 3893-3899 - [c5]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. ESA 2017: 37:1-37:15 - [i2]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. CoRR abs/1706.08431 (2017) - 2016
- [c4]Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann
Probabilistic Routing for On-Street Parking Search. ESA 2016: 6:1-6:13 - [c3]Ankit Chauhan
Greed is Good for Deterministic Scale-Free Networks. FSTTCS 2016: 33:1-33:15 - [i1]Ankit Chauhan, Tobias Friedrich, Ralf Rothenberger
Greed is Good for Deterministic Scale-Free Networks. CoRR abs/1610.04217 (2016) - 2015
- [c2]Karl Bringmann, Tobias Friedrich, Martin Hoefer, Ralf Rothenberger
Ultra-Fast Load Balancing on Scale-Free Networks. ICALP (2) 2015: 516-527 - [c1]Ralf Rothenberger
Dominating an s-t-Cut in a Network. SOFSEM 2015: 401-411
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: