guest ::
| 001 | 1019858 | ||
| 005 | 20260114074028.0 | ||
| 024 | 7 | _ | |2 ISBN |a 978-3-95977-395-9 |
| 024 | 7 | _ | |2 ISSN |a 1868-8969 |
| 024 | 7 | _ | |2 SCOPUS |a SCOPUS:2-s2.0-105019056534 |
| 024 | 7 | _ | |2 doi |a 10.4230/LIPICS.ESA.2025.112 |
| 037 | _ | _ | |a RWTH-2025-08597 |
| 041 | _ | _ | |a English |
| 100 | 1 | _ | |0 P:(DE-82)IDM04471 |a Anapolska, Mariia |b 0 |u rwth |
| 111 | 2 | _ | |a 33. Annual European Symposium on Algorithms |c Warsaw |d 2025-09-15 - 2025-09-17 |g ESA 2025 |w Poland |
| 245 | _ | _ | |a A Faster Parametric Search for the Integral Quickest Transshipment Problem |h online |
| 260 | _ | _ | |b Schloss Dagstuhl – Leibniz-Zentrum für Informatik |c 2025 |
| 295 | 1 | 0 | |a 33rd Annual European Symposium on Algorithms : ESA 2025, September 15–17, 2025, Warsaw, Poland / edited by Anne Benoit, Haim Kaplan, Sebastian Wild, Grzegorz Herman |
| 336 | 7 | _ | |0 33 |2 EndNote |a Conference Paper |
| 336 | 7 | _ | |0 PUB:(DE-HGF)7 |2 PUB:(DE-HGF) |a Contribution to a book |
| 336 | 7 | _ | |0 PUB:(DE-HGF)8 |2 PUB:(DE-HGF) |a Contribution to a conference proceedings |b contrib |m contrib |s 1760358349_3890629 |
| 336 | 7 | _ | |2 BibTeX |a INPROCEEDINGS |
| 336 | 7 | _ | |2 DRIVER |a conferenceObject |
| 336 | 7 | _ | |2 DataCite |a Output Types/Conference Paper |
| 336 | 7 | _ | |2 ORCID |a CONFERENCE_PAPER |
| 490 | 0 | _ | |a Leibniz international proceedings in informatics |v 351 |
| 536 | _ | _ | |0 G:(GEPRIS)282652900 |a GRK 2236 - GRK 2236: Unsicherheit und Randomisierung in Algorithmen, Verifikation und Logik. (282652900) |c 282652900 |x 0 |
| 536 | _ | _ | |0 G:(GEPRIS)504292598 |a SFB 1481 B05 - Sparsifizierung zeitabhängiger Netzwerkflußprobleme mittels diskreter Optimierung (B05) (504292598) |c 504292598 |x 1 |
| 536 | _ | _ | |0 G:(GEPRIS)442047500 |a DFG project G:(GEPRIS)442047500 - SFB 1481: Sparsity und singuläre Strukturen (442047500) |c 442047500 |x 2 |
| 588 | _ | _ | |a Dataset connected to DataCite |
| 591 | _ | _ | |a Germany |
| 650 | _ | 7 | |2 Other |a Flow over time |
| 650 | _ | 7 | |2 Other |a Theory of computation → Network flows |
| 650 | _ | 7 | |2 Other |a dynamic transshipment |
| 650 | _ | 7 | |2 Other |a efficient algorithms |
| 650 | _ | 7 | |2 Other |a parametric submodular functions |
| 650 | _ | 7 | |2 Other |a quickest transshipment |
| 700 | 1 | _ | |0 P:(DE-82)IDM07343 |a van den Boom, Dario |b 1 |e Corresponding author |u rwth |
| 700 | 1 | _ | |0 P:(DE-82)IDM02252 |a Büsing, Christina Maria Katharina |b 2 |u rwth |
| 700 | 1 | _ | |0 P:(DE-82)IDM06469 |a Gersing, Timo |b 3 |u rwth |
| 910 | 1 | _ | |0 I:(DE-588b)36225-6 |6 P:(DE-82)IDM04471 |a RWTH Aachen |b 0 |k RWTH |
| 910 | 1 | _ | |0 I:(DE-588b)36225-6 |6 P:(DE-82)IDM07343 |a RWTH Aachen |b 1 |k RWTH |
| 910 | 1 | _ | |0 I:(DE-588b)36225-6 |6 P:(DE-82)IDM02252 |a RWTH Aachen |b 2 |k RWTH |
| 910 | 1 | _ | |0 I:(DE-588b)36225-6 |6 P:(DE-82)IDM06469 |a RWTH Aachen |b 3 |k RWTH |
| 914 | 1 | _ | |y 2025 |
| 915 | 1 | _ | |0 StatID:(DE-HGF)0031 |2 StatID |a Peer reviewed article |x 0 |
| 920 | 1 | _ | |0 I:(DE-82)125620_20210528 |k 125620 |l Lehr- und Forschungsgebiet Kombinatorische Optimierung |x 0 |
| 980 | _ | _ | |a I:(DE-82)125620_20210528 |
| 980 | _ | _ | |a UNRESTRICTED |
| 980 | _ | _ | |a VDBINPRINT |
| 980 | _ | _ | |a contb |
| 980 | _ | _ | |a contrib |
| Library | Collection | CLSMajor | CLSMinor | Language | Author |
|---|