B

Birx, Alexander (2020)
Competitive analysis of the online dial-a-ride problem.
Technische Universität Darmstadt
doi: 10.25534/tuprints-00014134
Ph.D. Thesis, Primary publication

D

Disser, Yann ; Friedmann, Oliver ; Hopp, Alexander V. (2025)
An exponential lower bound for Zadeh’s pivot rule.
In: Mathematical Programming: Series A, Series B ; A Publication of the Mathematical Programming Society, 2023, 199 (1-2)
doi: 10.26083/tuprints-00028505
Article, Secondary publication, Publisher's Version

Disser, Yann ; Hopp, Alexander V. (2018)
On Friedmann's subexponential lower bound for Zadeh's pivot rule.
Report, Primary publication

G

Gläser, Maximilian (2025)
On the Proof Complexity of Linear Programming Based Branch-and-Bound.
doi: 10.26083/tuprints-00028881
Book, Secondary publication, Publisher's Version

H

Huang, Wei (2019)
Optimal Operation of Water Supply Networks by Mixed Integer Nonlinear Programming and Algebraic Methods.
Technische Universität Darmstadt
Ph.D. Thesis, Primary publication

K

Klimm, Max ; Pfetsch, Marc E. ; Raber, Rico ; Skutella, Martin (2025)
On the robustness of potential-based flow networks.
In: Mathematical Programming : Series A, Series B ; A Publication of the Mathematical Optimization Society, 2023, 197 (1)
doi: 10.26083/tuprints-00028563
Article, Secondary publication, Publisher's Version

L

Lüthen, Hendrik (2019)
Partitioning into Isomorphic or Connected Subgraphs.
Technische Universität Darmstadt
Ph.D. Thesis, Primary publication

W

Weckbecker, David Michael (2024)
Competitive Analysis for Incremental Maximization.
Technische Universität Darmstadt
doi: 10.26083/tuprints-00026447
Ph.D. Thesis, Primary publication, Publisher's Version