APA (7th ed.) Citation

Hanaka, T., Kiya, H., Maei, Y., Ono, H., Goos, G., Hartmanis, J., . . . Zalila Wenkstern, R. (2019). Computational Complexity of Hedonic Games on Sparse Graphs. PRIMA 2019: Principles and Practice of Multi-Agent Systems : 22nd International Conference, Turin, Italy, October 28–31, 2019, Proceedings, 11873, 576-584. https://doi.org/10.1007/978-3-030-33792-6_43

Chicago Style (17th ed.) Citation

Hanaka, Tesshu, et al. "Computational Complexity of Hedonic Games on Sparse Graphs." PRIMA 2019: Principles and Practice of Multi-Agent Systems : 22nd International Conference, Turin, Italy, October 28–31, 2019, Proceedings 11873 (2019): 576-584. https://doi.org/10.1007/978-3-030-33792-6_43.

MLA (9th ed.) Citation

Hanaka, Tesshu, et al. "Computational Complexity of Hedonic Games on Sparse Graphs." PRIMA 2019: Principles and Practice of Multi-Agent Systems : 22nd International Conference, Turin, Italy, October 28–31, 2019, Proceedings, vol. 11873, 2019, pp. 576-584, https://doi.org/10.1007/978-3-030-33792-6_43.