1. Abraham, D.J., Blum, A., Sandholm, T.: Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. In: Proceedings of the 8th ACM Conference on Electronic Commerce (EC ’07), pp. 295–304. ACM (2007)
2. Lecture Notes in Computer Science;DJ Abraham,2005
3. Bentert, M., Chen, J., Froese, V., Woeginger, G.J.: Good things come to those who swap objects on paths. CoRR abs/1905.04219 (2019)
4. Bentert, M., Malík, J., Weller, M.: Tree containment with soft polytomies. In: Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT ’18), LIPIcs, vol. 101, pp. 9:1–9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
5. Beynier, A., et al.: Local envy-freeness in house allocation problems. Auton. Agents Multi-Agent Syst. 33(5), 591–627 (2019). https://doi.org/10.1007/s10458-019-09417-x