Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Ralf Rothenberger
@article{DBLP:journals/rsa/BlasiusFGLR23,
author = {Thomas Bl{\"{a}}sius and
Tobias Friedrich and
Andreas G{\"{o}}bel and
Jordi Levy and
Ralf Rothenberger},
title = {The impact of heterogeneity and geometry on the proof complexity of
random satisfiability},
journal = {Random Struct. Algorithms},
volume = {63},
number = {4},
pages = {885--941},
year = {2023},
url = {https://doi.org/10.1002/rsa.21168},
doi = {10.1002/RSA.21168},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BlasiusFGLR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/NikfarjamR0023,
author = {Adel Nikfarjam and
Ralf Rothenberger and
Frank Neumann and
Tobias Friedrich},
editor = {Sara Silva and
Lu{\'{\i}}s Paquete},
title = {Evolutionary Diversity Optimisation in Constructing Satisfying Assignments},
booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference,
{GECCO} 2023, Lisbon, Portugal, July 15-19, 2023},
pages = {938--945},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3583131.3590517},
doi = {10.1145/3583131.3590517},
timestamp = {Fri, 21 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gecco/NikfarjamR0023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-11457,
author = {Adel Nikfarjam and
Ralf Rothenberger and
Frank Neumann and
Tobias Friedrich},
title = {Evolutionary Diversity Optimisation in Constructing Satisfying Assignments},
journal = {CoRR},
volume = {abs/2305.11457},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.11457},
doi = {10.48550/ARXIV.2305.11457},
eprinttype = {arXiv},
eprint = {2305.11457},
timestamp = {Thu, 25 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-11457.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/basesearch/Rothenberger22a,
author = {Ralf Rothenberger},
title = {Satisfiability thresholds for non-uniform random k-SAT (Erf{\"{u}}llbarkeitsschwellwerte
f{\"{u}}r nicht-uniformes zuf{\"{a}}lliges k-SAT)},
school = {University of Potsdam, Germany},
year = {2022},
url = {https://publishup.uni-potsdam.de/frontdoor/index/index/docId/54970},
urn = {urn:nbn:de:kobv:517-opus4-549702},
doi = {10.25932/PUBLISHUP-54970},
timestamp = {Wed, 20 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/phd/basesearch/Rothenberger22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/FriedrichNRS21,
author = {Tobias Friedrich and
Frank Neumann and
Ralf Rothenberger and
Andrew M. Sutton},
editor = {Chu{-}Min Li and
Felip Many{\`{a}}},
title = {Solving Non-uniform Planted and Filtered Random {SAT} Formulas Greedily},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2021 - 24th
International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12831},
pages = {188--206},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-80223-3\_13},
doi = {10.1007/978-3-030-80223-3\_13},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/FriedrichNRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BlasiusFGLR21,
author = {Thomas Bl{\"{a}}sius and
Tobias Friedrich and
Andreas G{\"{o}}bel and
Jordi Levy and
Ralf Rothenberger},
editor = {D{\'{a}}niel Marx},
title = {The Impact of Heterogeneity and Geometry on the Proof Complexity of
Random Satisfiability},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {42--53},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.4},
doi = {10.1137/1.9781611976465.4},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BlasiusFGLR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChauhanFR20,
author = {Ankit Chauhan and
Tobias Friedrich and
Ralf Rothenberger},
title = {Greed is Good for Deterministic Scale-Free Networks},
journal = {Algorithmica},
volume = {82},
number = {11},
pages = {3338--3389},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00729-z},
doi = {10.1007/S00453-020-00729-Z},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChauhanFR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-07319,
author = {Thomas Bl{\"{a}}sius and
Tobias Friedrich and
Andreas G{\"{o}}bel and
Jordi Levy and
Ralf Rothenberger},
title = {The Impact of Heterogeneity and Geometry on the Proof Complexity of
Random Satisfiability},
journal = {CoRR},
volume = {abs/2004.07319},
year = {2020},
url = {https://arxiv.org/abs/2004.07319},
eprinttype = {arXiv},
eprint = {2004.07319},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-07319.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aicom/FriedrichKRAHKK19,
author = {Tobias Friedrich and
Martin S. Krejca and
Ralf Rothenberger and
Tobias Arndt and
Danijar Hafner and
Thomas Kellermeier and
Simon Krogmann and
Armin Razmjou},
title = {Routing for on-street parking search using probabilistic data},
journal = {{AI} Commun.},
volume = {32},
number = {2},
pages = {113--124},
year = {2019},
url = {https://doi.org/10.3233/AIC-180574},
doi = {10.3233/AIC-180574},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aicom/FriedrichKRAHKK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/000100QR19,
author = {Tobias Friedrich and
Andreas G{\"{o}}bel and
Frank Neumann and
Francesco Quinzan and
Ralf Rothenberger},
title = {Greedy Maximization of Functions with Bounded Curvature under Partition
Matroid Constraints},
booktitle = {The Thirty-Third {AAAI} Conference on Artificial Intelligence, {AAAI}
2019, The Thirty-First Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2019, The Ninth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2019, Honolulu, Hawaii,
USA, January 27 - February 1, 2019},
pages = {2272--2279},
publisher = {{AAAI} Press},
year = {2019},
url = {https://doi.org/10.1609/aaai.v33i01.33012272},
doi = {10.1609/AAAI.V33I01.33012272},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/000100QR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aips/PetersSAGLSUWKR19,
author = {Jannik Peters and
Daniel Stephan and
Isabel Amon and
Hans Gawendowicz and
Julius Lischeid and
Lennart Salabarria and
Jonas Umland and
Felix Werner and
Martin S. Krejca and
Ralf Rothenberger and
Timo K{\"{o}}tzing and
Tobias Friedrich},
editor = {J. Benton and
Nir Lipovetzky and
Eva Onaindia and
David E. Smith and
Siddharth Srivastava},
title = {Mixed Integer Programming versus Evolutionary Computation for Optimizing
a Hard Real-World Staff Assignment Problem},
booktitle = {Proceedings of the Twenty-Ninth International Conference on Automated
Planning and Scheduling, {ICAPS} 2019, Berkeley, CA, USA, July 11-15,
2019},
pages = {541--554},
publisher = {{AAAI} Press},
year = {2019},
url = {https://ojs.aaai.org/index.php/ICAPS/article/view/3521},
timestamp = {Thu, 10 Aug 2023 15:31:45 +0200},
biburl = {https://dblp.org/rec/conf/aips/PetersSAGLSUWKR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/0001R19,
author = {Tobias Friedrich and
Ralf Rothenberger},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {The Satisfiability Threshold for Non-Uniform Random 2-SAT},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {61:1--61:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.61},
doi = {10.4230/LIPICS.ICALP.2019.61},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/0001R19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/0001R19,
author = {Tobias Friedrich and
Ralf Rothenberger},
editor = {Sarit Kraus},
title = {Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT},
booktitle = {Proceedings of the Twenty-Eighth International Joint Conference on
Artificial Intelligence, {IJCAI} 2019, Macao, China, August 10-16,
2019},
pages = {6151--6155},
publisher = {ijcai.org},
year = {2019},
url = {https://doi.org/10.24963/ijcai.2019/853},
doi = {10.24963/IJCAI.2019/853},
timestamp = {Tue, 20 Aug 2019 16:18:18 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/0001R19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-02027,
author = {Tobias Friedrich and
Ralf Rothenberger},
title = {The Satisfiability Threshold for Non-Uniform Random 2-SAT},
journal = {CoRR},
volume = {abs/1904.02027},
year = {2019},
url = {http://arxiv.org/abs/1904.02027},
eprinttype = {arXiv},
eprint = {1904.02027},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-02027.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/0001R18,
author = {Tobias Friedrich and
Ralf Rothenberger},
editor = {Olaf Beyersdorff and
Christoph M. Wintersteiger},
title = {Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2018 - 21st
International Conference, {SAT} 2018, Held as Part of the Federated
Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10929},
pages = {273--291},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94144-8\_17},
doi = {10.1007/978-3-319-94144-8\_17},
timestamp = {Mon, 16 Sep 2019 15:30:17 +0200},
biburl = {https://dblp.org/rec/conf/sat/0001R18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/smc/BlasiusEF0KLRSS18,
author = {Thomas Bl{\"{a}}sius and
Jan Eube and
Thomas Feldtkeller and
Tobias Friedrich and
Martin S. Krejca and
J. A. Gregor Lagodzinski and
Ralf Rothenberger and
Julius Severin and
Fabian Sommer and
Justin Trautmann},
title = {Memory-Restricted Routing with Tiled Map Data},
booktitle = {{IEEE} International Conference on Systems, Man, and Cybernetics,
{SMC} 2018, Miyazaki, Japan, October 7-10, 2018},
pages = {3347--3354},
publisher = {{IEEE}},
year = {2018},
url = {https://doi.org/10.1109/SMC.2018.00567},
doi = {10.1109/SMC.2018.00567},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/smc/BlasiusEF0KLRSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-05351,
author = {Tobias Friedrich and
Andreas G{\"{o}}bel and
Frank Neumann and
Francesco Quinzan and
Ralf Rothenberger},
title = {Greedy Maximization of Functions with Bounded Curvature under Partition
Matroid Constraints},
journal = {CoRR},
volume = {abs/1811.05351},
year = {2018},
url = {http://arxiv.org/abs/1811.05351},
eprinttype = {arXiv},
eprint = {1811.05351},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-05351.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/0001KRS17,
author = {Tobias Friedrich and
Anton Krohmer and
Ralf Rothenberger and
Andrew M. Sutton},
editor = {Satinder Singh and
Shaul Markovitch},
title = {Phase Transitions for Scale-Free {SAT} Formulas},
booktitle = {Proceedings of the Thirty-First {AAAI} Conference on Artificial Intelligence,
February 4-9, 2017, San Francisco, California, {USA}},
pages = {3893--3899},
publisher = {{AAAI} Press},
year = {2017},
url = {https://doi.org/10.1609/aaai.v31i1.11133},
doi = {10.1609/AAAI.V31I1.11133},
timestamp = {Mon, 04 Sep 2023 14:40:32 +0200},
biburl = {https://dblp.org/rec/conf/aaai/0001KRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/0001KRSS17,
author = {Tobias Friedrich and
Anton Krohmer and
Ralf Rothenberger and
Thomas Sauerwald and
Andrew M. Sutton},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Bounds on the Satisfiability Threshold for Power Law Distributed Random
{SAT}},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {37:1--37:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.37},
doi = {10.4230/LIPICS.ESA.2017.37},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/0001KRSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/0001KRSS17,
author = {Tobias Friedrich and
Anton Krohmer and
Ralf Rothenberger and
Thomas Sauerwald and
Andrew M. Sutton},
title = {Bounds on the Satisfiability Threshold for Power Law Distributed Random
{SAT}},
journal = {CoRR},
volume = {abs/1706.08431},
year = {2017},
url = {http://arxiv.org/abs/1706.08431},
eprinttype = {arXiv},
eprint = {1706.08431},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/0001KRSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ArndtHKKRKRF16,
author = {Tobias Arndt and
Danijar Hafner and
Thomas Kellermeier and
Simon Krogmann and
Armin Razmjou and
Martin S. Krejca and
Ralf Rothenberger and
Tobias Friedrich},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {Probabilistic Routing for On-Street Parking Search},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {6:1--6:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.6},
doi = {10.4230/LIPICS.ESA.2016.6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/ArndtHKKRKRF16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Chauhan0R16,
author = {Ankit Chauhan and
Tobias Friedrich and
Ralf Rothenberger},
editor = {Akash Lal and
S. Akshay and
Saket Saurabh and
Sandeep Sen},
title = {Greed is Good for Deterministic Scale-Free Networks},
booktitle = {36th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2016, December 13-15, 2016,
Chennai, India},
series = {LIPIcs},
volume = {65},
pages = {33:1--33:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2016.33},
doi = {10.4230/LIPICS.FSTTCS.2016.33},
timestamp = {Tue, 30 Nov 2021 13:29:05 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/Chauhan0R16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChauhanFR16,
author = {Ankit Chauhan and
Tobias Friedrich and
Ralf Rothenberger},
title = {Greed is Good for Deterministic Scale-Free Networks},
journal = {CoRR},
volume = {abs/1610.04217},
year = {2016},
url = {http://arxiv.org/abs/1610.04217},
eprinttype = {arXiv},
eprint = {1610.04217},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChauhanFR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BringmannFHRS15,
author = {Karl Bringmann and
Tobias Friedrich and
Martin Hoefer and
Ralf Rothenberger and
Thomas Sauerwald},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Ultra-Fast Load Balancing on Scale-Free Networks},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9135},
pages = {516--527},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47666-6\_41},
doi = {10.1007/978-3-662-47666-6\_41},
timestamp = {Fri, 26 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BringmannFHRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/RothenbergerGR15,
author = {Ralf Rothenberger and
Sascha Grau and
Michael Rossberg},
editor = {Giuseppe F. Italiano and
Tiziana Margaria{-}Steffen and
Jaroslav Pokorn{\'{y}} and
Jean{-}Jacques Quisquater and
Roger Wattenhofer},
title = {Dominating an s-t-Cut in a Network},
booktitle = {{SOFSEM} 2015: Theory and Practice of Computer Science - 41st International
Conference on Current Trends in Theory and Practice of Computer Science,
Pec pod Sn{\v{e}}{\v{z}}kou, Czech Republic, January 24-29, 2015.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8939},
pages = {401--411},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-46078-8\_33},
doi = {10.1007/978-3-662-46078-8\_33},
timestamp = {Sun, 02 Jun 2019 21:12:07 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/RothenbergerGR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-05-08 21:02 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:
