Florian Brandl, Telikepalli Kavitha. Two Problems in Max-Size Popular Matchings. Algorithmica, 81(7):2738-2764, 2019. [doi]
@article{BrandlK19,
title = {Two Problems in Max-Size Popular Matchings},
author = {Florian Brandl and Telikepalli Kavitha},
year = {2019},
doi = {10.1007/s00453-019-00553-0},
url = {https://doi.org/10.1007/s00453-019-00553-0},
researchr = {https://researchr.org/publication/BrandlK19},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2738-2764},
}