1. Aziz, H., de Keijzer, B.: Complexity of coalition structure generation. In: Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2011, pp. 191–198 (2011)
2. Bhatnagar, N., Greenberg, S., Randall, D.: Sampling stable marriages: why spouse-swapping won’t work. In: Proceedings of the 19th ACM/SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 1223–1232. ACM-SIAM (2008)
3. Biró, P., Manlove, D., Mittal, S.: Size versus stability in the marriage problem. Theor. Comput. Sci. 411, 1828–1841 (2010)
4. Chebolu, P., Goldberg, L.A., Martin, R.: The complexity of approximately counting stable matchings. Theor. Comput. Sci. 437, 35–68 (2012)
5. Chebolu, P., Goldberg, L.A., Martin, R.: The complexity of approximately counting stable roommate assignments. J. Comput. Syst. Sci. 78(5), 1579–1605 (2012)