Mechthild Stoer

{{Short description|German operations researcher}}

{{Use dmy dates|cs1-dates=ly|date=April 2025}}

{{Use list-defined references|date=April 2025}}

{{CS1 config|mode=cs2}}

{{Infobox scientist

| honorific_prefix =

| name =

| honorific_suffix =

| native_name =

| native_name_lang =

| image =

| image_size =

| image_upright =

| landscape =

| alt =

| caption =

| birth_name =

| birth_date =

| birth_place =

| death_date =

| death_place =

| death_cause =

| resting_place =

| resting_place_coordinates =

| other_names =

| siglum =

| pronounce =

| citizenship =

| nationality = German

| fields = Operations research

| workplaces = Telenor

| patrons =

| education = University of Augsburg

| alma_mater =

| thesis_title = Design of Survivable Networks

| thesis_url =

| thesis_year = 1992

| doctoral_advisor =

| academic_advisors = Martin Grötschel

| doctoral_students =

| notable_students =

| known_for = Stoer–Wagner algorithm

| awards = European Symposium on Algorithms Test-of-Time Award

| author_abbrev_bot =

| author_abbrev_zoo =

| spouse =

| partner =

| children =

| parents =

| father =

| mother =

| relatives =

| signature =

| signature_type =

| signature_alt =

| website =

| footnotes =

}}

Mechthild Maria Stoer is a German applied mathematician and operations researcher known for her work on the minimum cut problem and in network design. She is one of the namesakes of the Stoer–Wagner algorithm for minimum cuts,{{r|correct}} which she published with Frank Wagner in 1994.

Education and career

Stoer was a master's student of Martin Grötschel at the University of Augsburg in Germany, receiving a diploma in 1987 with the thesis Dekompositionstechniken beim Travelling Salesman Problem.{{r|mgms}} She continued working with Grötschel in Augsburg for a Ph.D.; her 1992 dissertation, Design of Survivable Networks,{{r|mg}} was also published by Springer-Verlag in the series Lecture Notes in Mathematics (vol. 1531, 1992).{{r|dsn}} After completing her doctorate she worked for Telenor in Norway, focusing on the applications of combinatorial optimization in telecommunication.{{r|about}}

Recognition

Stoer's work on minimum cuts received the inaugural European Symposium on Algorithms Test-of-Time Award in 2015. The award citation states that "The algorithm continues to be taught because of its elegance and used because of its efficiency and ease of implementation."{{r|tot}}

Selected publications

  • {{citation

| last = Stoer | first = Mechthild

| doi = 10.1007/BFb0088963

| isbn = 3-540-56271-0

| mr = 1223549

| publisher = Springer-Verlag | location = Berlin

| series = Lecture Notes in Mathematics

| title = Design of Survivable Networks

| volume = 1531

| year = 1992}}

  • {{citation

| last1 = Grötschel | first1 = Martin | author1-link = Martin Grötschel

| last2 = Monma | first2 = Clyde L.

| last3 = Stoer | first3 = Mechthild

| doi = 10.1287/opre.40.2.309

| issue = 2

| journal = Operations Research

| mr = 1162949

| pages = 309–330

| title = Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints

| volume = 40

| year = 1992}}

  • {{citation

| last1 = Grötschel | first1 = Martin | author1-link = Martin Grötschel

| last2 = Monma | first2 = Clyde L.

| last3 = Stoer | first3 = Mechthild

| doi = 10.1137/0802024

| issue = 3

| journal = SIAM Journal on Optimization

| mr = 1172502

| pages = 474–504

| title = Facets for polyhedra arising in the design of communication networks with low-connectivity constraints

| volume = 2

| year = 1992}}

  • {{citation

| last1 = Stoer | first1 = Mechthild

| last2 = Dahl | first2 = Geir

| doi = 10.1007/s002110050054

| issue = 1

| journal = Numerische Mathematik

| mr = 1278454

| pages = 149–167

| title = A polyhedral approach to multicommodity survivable network design

| volume = 68

| year = 1994}}

  • {{citation

| last1 = Stoer | first1 = Mechthild

| last2 = Wagner | first2 = Frank

| doi = 10.1145/263867.263872

| issue = 4

| journal = Journal of the ACM

| mr = 1481316

| pages = 585–591

| title = A simple min-cut algorithm

| volume = 44

| year = 1997}}; previously announced in 1994 at the European Symposium on Algorithms, {{doi|10.1007/BFb0049404}}

References

{{reflist|refs=

{{citation|title=Contributors|journal=Operations Research|volume=43|issue=6|date=November–December 1995|pages=1071–1072|jstor=171646}}

{{citation

| last1 = Arikati | first1 = Srinivasa R.

| last2 = Mehlhorn | first2 = Kurt | author2-link= Kurt Mehlhorn

| doi = 10.1016/S0020-0190(99)00071-X

| issue = 5

| journal = Information Processing Letters

| mr = 1707963

| pages = 251–254

| title = A correctness certificate for the Stoer–Wagner min-cut algorithm

| volume = 70

| year = 1999}}

Reviews of Design of Survivable Networks:

  • Horst Hamacher, {{zbl|0766.90063}}
  • Michael Trick, {{MR|1223549}}

{{mathgenealogy|26606}}

{{citation|url=https://www.zib.de/userpage//groetschel/students/masterstudentsIE.html|title=My Former Master Students|first=Martin|last=Grötschel|author-link=Martin Grötschel|access-date=2025-04-04}}

{{citation|url=https://algo-conference.org/esa/test-of-time-award/|title=Test of Time Award|work=European Symposium on Algorithms|access-date=2025-04-04}}

}}

{{Authority control|state=collapsed}}

{{DEFAULTSORT:Stoer, Mechthild}}

Category:Year of birth missing (living people)

Category:Living people

Category:German applied mathematicians

Category:German women mathematicians

Category:Operations researchers

Category:University of Augsburg alumni