![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Miriam Schlöter
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j3]Joseph Paat
, Miriam Schlöter, Robert Weismantel:
The integrality number of an integer program. Math. Program. 192(1): 271-291 (2022) - [j2]Joseph Paat
, Miriam Schlöter, Emily Speakman:
Constructing lattice-free gradient polyhedra in dimension two. Math. Program. 192(1): 293-317 (2022) - [c6]Miriam Schlöter, Martin Skutella, Khai Van Tran:
A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method. SODA 2022: 90-102 - [i3]Miriam Schlöter, Robert Weismantel:
Minimum-Cost Flows Over Time. CoRR abs/2206.00526 (2022) - 2021
- [j1]Antje Bjelde, Jan Hackfeld, Yann Disser, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Miriam Schlöter, Kevin Schewior
, Leen Stougie:
Tight Bounds for Online TSP on the Line. ACM Trans. Algorithms 17(1): 3:1-3:58 (2021) - [i2]Miriam Schlöter, Martin Skutella, Khai Van Tran:
A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method. CoRR abs/2108.06239 (2021) - 2020
- [c5]Joseph Paat, Miriam Schlöter, Robert Weismantel:
The Integrality Number of an Integer Program. IPCO 2020: 338-350 - [c4]Joseph Paat, Miriam Schlöter, Emily Speakman:
Constructing Lattice-Free Gradient Polyhedra in Dimension Two. IPCO 2020: 364-377
2010 – 2019
- 2019
- [c3]Miriam Schlöter:
Earliest Arrival Transshipments in Networks with Multiple Sinks. IPCO 2019: 370-384 - [i1]Joseph Paat, Miriam Schlöter, Robert Weismantel:
Most IPs with bounded determinants can be solved in polynomial time. CoRR abs/1904.06874 (2019) - 2017
- [c2]Miriam Schlöter, Martin Skutella:
Fast and Memory-Efficient Algorithms for Evacuation Problems. SODA 2017: 821-840 - [c1]Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Kevin Schewior
, Miriam Schlöter, Leen Stougie:
Tight Bounds for Online TSP on the Line. SODA 2017: 994-1005
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint