Fast and Memory-Efficient Algorithms for Evacuation Problems. - Miriam Schlöter; Martin Skutella (SODA, 2017)

Earliest Arrival Transshipments in Networks with Multiple Sinks. - Miriam Schlöter (IPCO, 2019)

Most IPs with bounded determinants can be solved in polynomial time. - Joseph Paat; Miriam Schlöter; Robert Weismantel (CoRR, 2019)

Tight Bounds for Online TSP on the Line. - Antje Bjelde; Jan Hackfeld; Yann Disser; Christoph Hansknecht; Maarten Lipmann; Julie Meißner; Miriam Schlöter; Kevin Schewior; Leen Stougie (ACM Trans. Algorithms, 2021)

A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method. - Miriam Schlöter; Martin Skutella; Khai Van Tran (SODA, 2022)

Minimum-Cost Flows Over Time. - Miriam Schlöter; Robert Weismantel (CoRR, 2022)

Constructing lattice-free gradient polyhedra in dimension two. - Joseph Paat; Miriam Schlöter; Emily Speakman (Math. Program., 2022)

The integrality number of an integer program. - Joseph Paat; Miriam Schlöter; Robert Weismantel (Math. Program., 2022)