Miriam Schlöter

12 papers A* 3B 3Journal 6
YearRankTypeTitle / Venue / Authors
2022 A* conf
A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method.
SODA
Miriam Schlöter, Martin Skutella, Khai Van Tran
2022 J jnl
Constructing lattice-free gradient polyhedra in dimension two.
Math. Program.
Joseph Paat, Miriam Schlöter, Emily Speakman
2022 J jnl
Minimum-Cost Flows Over Time.
CoRR
Miriam Schlöter, Robert Weismantel
2022 J jnl
The integrality number of an integer program.
Math. Program.
Joseph Paat, Miriam Schlöter, Robert Weismantel
2021 J jnl
A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method.
CoRR
Miriam Schlöter, Martin Skutella, Khai Van Tran
2021 J jnl
Tight Bounds for Online TSP on the Line.
ACM Trans. Algorithms
Antje Bjelde, Jan Hackfeld, Yann Disser, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Miriam Schlöter, Kevin Schewior, Leen Stougie
2020 B conf
Constructing Lattice-Free Gradient Polyhedra in Dimension Two.
IPCO
Joseph Paat, Miriam Schlöter, Emily Speakman
2020 B conf
The Integrality Number of an Integer Program.
IPCO
Joseph Paat, Miriam Schlöter, Robert Weismantel
2019 B conf
Earliest Arrival Transshipments in Networks with Multiple Sinks.
IPCO
Miriam Schlöter
2019 J jnl
Most IPs with bounded determinants can be solved in polynomial time.
CoRR
Joseph Paat, Miriam Schlöter, Robert Weismantel
2017 A* conf
Fast and Memory-Efficient Algorithms for Evacuation Problems.
SODA
Miriam Schlöter, Martin Skutella
2017 A* conf
Tight Bounds for Online TSP on the Line.
SODA
Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Kevin Schewior, Miriam Schlöter, Leen Stougie