Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch. Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. In Volker Diekert, Michel Habib, editors, STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings. Volume 2996 of Lecture Notes in Computer Science, pages 222-233, Springer, 2004. [doi]

@inproceedings{KavithaMMP04,
  title = {Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem},
  author = {Telikepalli Kavitha and Kurt Mehlhorn and Dimitrios Michail and Katarzyna E. Paluch},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=222},
  tags = {e-science},
  researchr = {https://researchr.org/publication/KavithaMMP04},
  cites = {0},
  citedby = {0},
  pages = {222-233},
  booktitle = {STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings},
  editor = {Volker Diekert and Michel Habib},
  volume = {2996},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-21236-1},
}