![](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
Mechthild Stoer
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
1990 – 1999
- 1999
- [j7]Geir Dahl
, Alexander Martin
, Mechthild Stoer:
Routing Through Virtual Paths in Layered Telecommunication Networks. Oper. Res. 47(5): 693-702 (1999) - 1998
- [j6]Geir Dahl
, Mechthild Stoer:
A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems. INFORMS J. Comput. 10(1): 1-11 (1998) - 1997
- [j5]Mechthild Stoer, Frank Wagner:
A simple min-cut algorithm. J. ACM 44(4): 585-591 (1997) - 1995
- [j4]Martin Grötschel, Clyde L. Monma, Mechthild Stoer:
Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements. Oper. Res. 43(6): 1012-1024 (1995) - 1994
- [c3]Mechthild Stoer, Frank Wagner:
A Simple Min Cut Algorithm. ESA 1994: 141-147 - 1993
- [j3]Norbert Ascheuer, Laureano F. Escudero, Martin Grötschel, Mechthild Stoer:
A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing). SIAM J. Optim. 3(1): 25-42 (1993) - 1992
- [j2]Martin Grötschel, Clyde L. Monma, Mechthild Stoer:
Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints. Oper. Res. 40(2): 309-330 (1992) - [j1]Martin Grötschel, Clyde L. Monma, Mechthild Stoer:
Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints. SIAM J. Optim. 2(3): 474-504 (1992) - 1990
- [c2]Norbert Ascheuer, Laureano F. Escudero, Martin Grötschel, Mechthild Stoer:
On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem. IPCO 1990: 19-28
1980 – 1989
- 1989
- [c1]Martin Grötschel, Clyde L. Monma, Mechthild Stoer:
Polyhedral Approaches to Network Survivability. Reliability Of Computer And Communication Networks 1989: 121-142
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:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint