Telikepalli Kavitha. Popular Matchings of Desired Size. In Andreas Brandstädt, Ekkehard Köhler, Klaus Meer, editors, Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings. Volume 11159 of Lecture Notes in Computer Science, pages 306-317, Springer, 2018. [doi]
@inproceedings{Kavitha18-0,
title = {Popular Matchings of Desired Size},
author = {Telikepalli Kavitha},
year = {2018},
doi = {10.1007/978-3-030-00256-5_25},
url = {https://doi.org/10.1007/978-3-030-00256-5_25},
researchr = {https://researchr.org/publication/Kavitha18-0},
cites = {0},
citedby = {0},
pages = {306-317},
booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},
editor = {Andreas Brandstädt and Ekkehard Köhler and Klaus Meer},
volume = {11159},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-00256-5},
}