by Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Reference:
The Complexity of Envy-Free Graph CuttingArgyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian OrdyniakProceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt, ed.), pages 237–243, 2022, ijcai.org.
Bibtex Entry:
@inproceedings{DEGHO22,
author = {Argyrios Deligkas and
Eduard Eiben and
Robert Ganian and
Thekla Hamm and
Sebastian Ordyniak},
editor = {Luc De Raedt},
title = {The Complexity of Envy-Free Graph Cutting},
booktitle = {Proceedings of the Thirty-First International Joint Conference on
Artificial Intelligence, {IJCAI} 2022, Vienna, Austria, 23-29 July
2022},
pages = {237--243},
publisher = {ijcai.org},
year = {2022},
url = {10.24963/ijcai.2022/34">https://doi.org/10.24963/ijcai.2022/34},
doi = {10.24963/ijcai.2022/34},
keywords = {ParAI,nfpc}
}