TU Darmstadt / ULB / TUbiblio

Browse by Person

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: No Grouping | Item Type | Date | Language
Number of items: 4.

Bernstein, Aaron ; Disser, Yann ; Groß, Martin ; Himburg, Sandra (2022):
General Bounds for Incremental Maximization.
In: Mathematical Programming, 191 (2), pp. 953-979. Springer, ISSN 0025-5610,
DOI: 10.1007/s10107-020-01576-0,
[Article]

Bernstein, Aaron ; Däubel, Karl ; Disser, Yann ; Klimm, Max ; Mütze, Torsten ; Smolny, Frieder (2019):
Distance-Preserving Graph Contractions.
In: SIAM Journal on Discrete Mathematics, 33 (3), pp. 1607-1636. Society for Industrial and Applied Mathematics, ISSN 0895-4801,
DOI: 10.1137/18M1169382,
[Article]

Bernstein, Aaron ; Däubel, Karl ; Disser, Yann ; Klimm, Max ; Mütze, Torsten ; Smolny, Frieder (2018):
Distance-preserving graph contractions.
In: Leibniz International Proceedings in Informatics, 94, In: Proceedings of the 9th Innovations in Theoretical Computer Science,
Dagstuhl Publishing, 9th Innovations in Theoretical Computer Science conference (ITCS 2018), Cambridge, USA, 11.-14.01.2018, ISBN 978-3-95977-060-6,
DOI: 10.4230/LIPIcs.ITCS.2018.51,
[Conference or Workshop Item]

Bernstein, Aaron ; Disser, Yann ; Groß, Martin (2017):
General Bounds for Incremental Maximization.
In: Leibniz International Proceedings in Informatics, 80, In: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP),
Dagstuhl Publishing, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Warsaw, Poland, 10.-14.07.2017, ISBN 978-3-95977-041-5,
DOI: 10.4230/LIPIcs.ICALP.2017.43,
[Conference or Workshop Item]

This list was generated on Tue Sep 27 04:57:26 2022 CEST.