h1

h2

h3

h4

h5
h6

001     1018370
005     20250919063617.0
024 7 _ |2 SCOPUS
|a SCOPUS:2-s2.0-105014762963
024 7 _ |2 doi
|a 10.4230/LIPICS.MFCS.2025.52
037 _ _ |a RWTH-CONV-254847
041 _ _ |a English
100 1 _ |a Grüne, Christoph
|b 0
111 2 _ |a 50. International Symposium on Mathematical Foundations of Computer Science
|c Warsaw
|d 2025-08-25 - 2025-08-29
|g MFCS 2025
|w Poland
245 _ _ |a On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
|h online
260 _ _ |b Schloss Dagstuhl - Leibniz-Zentrum für Informatik
|c 2025
295 1 0 |a 50th International Symposium on Mathematical Foundations of Computer Science, MFCS 2025, August 25-29, 2025, Warsaw, Poland
300 _ _ |a 52:1-52:18
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 123456789_1111
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 LIPIcs
|v 345
536 _ _ |0 G:(GEPRIS)282652900
|a GRK 2236 - GRK 2236: Unsicherheit und Randomisierung in Algorithmen, Verifikation und Logik. (282652900)
|c 282652900
|x 0
700 1 _ |a Wulf, Lasse
|b 1
914 1 _ |y 2025
920 1 _ |0 I:(DE-82)121110_20140620
|k 121110
|l Lehrstuhl für Algorithmen und Komplexität (Informatik 1)
|x 0
920 1 _ |0 I:(DE-82)120000_20140620
|k 120000
|l Fachgruppe Informatik
|x 1
920 1 _ |0 I:(DE-82)080060_20170720
|k 080060
|l Graduiertenkolleg UnRAVeL
|x 2
970 _ _ |a DBLP:conf/mfcs/GruneW25-RWTHp
980 _ _ |a I:(DE-82)080060_20170720
980 _ _ |a I:(DE-82)120000_20140620
980 _ _ |a I:(DE-82)121110_20140620
980 _ _ |a UNRESTRICTED
980 _ _ |a VDBINPRINT
980 _ _ |a contb
980 _ _ |a contrib

LibraryCollectionCLSMajorCLSMinorLanguageAuthor
Marc 21