The Complexity of Envy-Free Graph Cutting (bibtex)
by , , , ,
Reference:
The Complexity of Envy-Free Graph CuttingArgyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastiak OrdyniakProceeding of IJCAI-22, the 31st International Joint Conference on Artificial Intelligence, 2022.Note: to appear
Bibtex Entry:
@inproceedings{DEGHO22,
  author    = {Argyrios Deligkas and Eduard Eiben and Robert Ganian and Thekla Hamm and Sebastiak Ordyniak},
  title     = {The Complexity of Envy-Free Graph Cutting},
  booktitle = {Proceeding of IJCAI-22, the 31st International Joint Conference on Artificial Intelligence},
  year      = {2022},  
  keywords  = {ParAI,nfpc},
  note = {to appear}
}
Powered by bibtexbrowser