Publisher
Springer International Publishing
Reference15 articles.
1. Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular matchings. SIAM J. Comput. 37(4), 1030–1045 (2007)
2. Biró, P., Irving, R.W., Manlove, D.F.: Popular matchings in the marriage and roommates problems. In: Proceedings of 7th International Conference on Algorithms and Complexity (CIAC), pp. 97–108 (2010)
3. Cseh, Á., Huang, C.-C., Kavitha, T.: Popular matchings with two-sided preferences and one-sided ties. SIAM J. Discret. Math. 31(4), 2348–2377 (2017)
4. Lecture Notes in Computer Science;Á Cseh,2016
5. Faenza, Y., Kavitha, T., Powers, V., Zhang, X.: Popular matchings and limits to tractability. http://arxiv.org/abs/1805.11473 (2018)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献