h1

h2

h3

h4

h5
h6
% 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{Anapolska:1019858,
      author       = {Anapolska, Mariia and van den Boom, Dario and Büsing,
                      Christina Maria Katharina and Gersing, Timo},
      title        = {{A} {F}aster {P}arametric {S}earch for the {I}ntegral
                      {Q}uickest {T}ransshipment {P}roblem},
      volume       = {351},
      publisher    = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
      reportid     = {RWTH-2025-08597},
      series       = {Leibniz international proceedings in informatics},
      year         = {2025},
      comment      = {33rd Annual European Symposium on Algorithms : ESA 2025,
                      September 15–17, 2025, Warsaw, Poland / edited by Anne
                      Benoit, Haim Kaplan, Sebastian Wild, Grzegorz Herman},
      booktitle     = {33rd Annual European Symposium on
                       Algorithms : ESA 2025, September
                       15–17, 2025, Warsaw, Poland / edited
                       by Anne Benoit, Haim Kaplan, Sebastian
                       Wild, Grzegorz Herman},
      month         = {Sep},
      date          = {2025-09-15},
      organization  = {33. Annual European Symposium on
                       Algorithms, Warsaw (Poland), 15 Sep
                       2025 - 17 Sep 2025},
      keywords     = {Flow over time (Other) / Theory of computation → Network
                      flows (Other) / dynamic transshipment (Other) / efficient
                      algorithms (Other) / parametric submodular functions (Other)
                      / quickest transshipment (Other)},
      cin          = {125620},
      cid          = {$I:(DE-82)125620_20210528$},
      pnm          = {GRK 2236 - GRK 2236: Unsicherheit und Randomisierung in
                      Algorithmen, Verifikation und Logik. (282652900) / SFB 1481
                      B05 - Sparsifizierung zeitabhängiger Netzwerkflußprobleme
                      mittels diskreter Optimierung (B05) (504292598) / DFG
                      project G:(GEPRIS)442047500 - SFB 1481: Sparsity und
                      singuläre Strukturen (442047500)},
      pid          = {G:(GEPRIS)282652900 / G:(GEPRIS)504292598 /
                      G:(GEPRIS)442047500},
      typ          = {PUB:(DE-HGF)7 / PUB:(DE-HGF)8},
      doi          = {10.4230/LIPICS.ESA.2025.112},
      url          = {https://publications.rwth-aachen.de/record/1019858},
}