@InProceedings{brandl_et_al:LIPIcs.FSTTCS.2017.19,
author = {Brandl, Florian and Kavitha, Telikepalli},
title = {{Popular Matchings with Multiple Partners}},
booktitle = {37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)},
pages = {19:1--19:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-055-2},
ISSN = {1868-8969},
year = {2018},
volume = {93},
editor = {Lokam, Satya and Ramanujam, R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2017.19},
URN = {urn:nbn:de:0030-drops-83765},
doi = {10.4230/LIPIcs.FSTTCS.2017.19},
annote = {Keywords: Bipartite graphs, Linear programming duality, Gale-Shapley algorithm}
}