Miriam Schlöter

According to our database, Miriam Schlöter authored at least 8 papers between 2017 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

Minimum-Cost Flows Over Time.

Miriam Schlöter, Robert Weismantel

CoRR, 2022

A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method.

Miriam Schlöter, Martin Skutella, Khai Van Tran

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2020

The Integrality Number of an Integer Program.

Joseph Paat, Miriam Schlöter, Robert Weismantel

Proceedings of the Integer Programming and Combinatorial Optimization, 2020

Constructing Lattice-Free Gradient Polyhedra in Dimension Two.

Joseph Paat, Miriam Schlöter, Emily Speakman

Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019

Most IPs with bounded determinants can be solved in polynomial time.

Joseph Paat, Miriam Schlöter, Robert Weismantel

CoRR, 2019

Earliest Arrival Transshipments in Networks with Multiple Sinks.

Miriam Schlöter

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2017

Fast and Memory-Efficient Algorithms for Evacuation Problems.

Miriam Schlöter, Martin Skutella

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Tight Bounds for Online TSP on the Line.

Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Kevin Schewior, Miriam Schlöter, Leen Stougie

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017