h1

% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@INPROCEEDINGS{Grne:1018370,
      author       = {Grüne, Christoph and Wulf, Lasse},
      title        = {{O}n the {C}omplexity of {R}ecoverable {R}obust
                      {O}ptimization in the {P}olynomial {H}ierarchy},
      volume       = {345},
      publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
      reportid     = {RWTH-CONV-254847},
      series       = {LIPIcs},
      pages        = {52:1-52:18},
      year         = {2025},
      comment      = {50th International Symposium on Mathematical Foundations of
                      Computer Science, MFCS 2025, August 25-29, 2025, Warsaw,
                      Poland},
      booktitle     = {50th International Symposium on
                       Mathematical Foundations of Computer
                       Science, MFCS 2025, August 25-29, 2025,
                       Warsaw, Poland},
      month         = {Aug},
      date          = {2025-08-25},
      organization  = {50. International Symposium on
                       Mathematical Foundations of Computer
                       Science, Warsaw (Poland), 25 Aug 2025 -
                       29 Aug 2025},
      cin          = {121110 / 120000 / 080060},
      cid          = {$I:(DE-82)121110_20140620$ / $I:(DE-82)120000_20140620$ /
                      $I:(DE-82)080060_20170720$},
      pnm          = {GRK 2236 - GRK 2236: Unsicherheit und Randomisierung in
                      Algorithmen, Verifikation und Logik. (282652900)},
      pid          = {G:(GEPRIS)282652900},
      typ          = {PUB:(DE-HGF)7 / PUB:(DE-HGF)8},
      doi          = {10.4230/LIPICS.MFCS.2025.52},
      url          = {https://publications.rwth-aachen.de/record/1018370},
}