@InProceedings{kavitha:LIPIcs.FSTTCS.2021.25,
author = {Kavitha, Telikepalli},
title = {{Matchings, Critical Nodes, and Popular Solutions}},
booktitle = {41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)},
pages = {25:1--25:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-215-0},
ISSN = {1868-8969},
year = {2021},
volume = {213},
editor = {Boja\'{n}czyk, Miko{\l}aj and Chekuri, Chandra},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.25},
URN = {urn:nbn:de:0030-drops-155360},
doi = {10.4230/LIPIcs.FSTTCS.2021.25},
annote = {Keywords: Bipartite graphs, Stable matchings, LP-duality}
}