Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

STACS
2004
Springer

favoriteEmaildiscussreport

104views Theoretical Computer Science» more STACS 2004»

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

13 years 10 months ago

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

Download www-sop.inria.fr

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich

Real-time Traffic

STACS 2004 | Theoretical Computer Science |

claim paper

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	STACS
Authors	Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch

Comments (0)