The Complexity of Envy-free Graph Cutting

Research output: Contribution to journal › Article › peer-review

Access to Document

@article{ec9c45f49ab14844bc0d53a5941248a9,

title = "The Complexity of Envy-free Graph Cutting",

author = "Argyrios Deligkas and Eduard Eiben and Robert Ganian and Thekla Hamm and Sebastian Ordyniak",

year = "2026",

month = jun,

day = "16",

doi = "10.1016/j.artint.2026.104585",

language = "English",

volume = "358",

journal = "Artificial Intelligence",

issn = "0004-3702",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - The Complexity of Envy-free Graph Cutting

AU - Deligkas, Argyrios

AU - Eiben, Eduard

AU - Ganian, Robert

AU - Hamm, Thekla

AU - Ordyniak, Sebastian

PY - 2026/6/16

Y1 - 2026/6/16

U2 - 10.1016/j.artint.2026.104585

DO - 10.1016/j.artint.2026.104585

M3 - Article

SN - 0004-3702

VL - 358

JO - Artificial Intelligence

JF - Artificial Intelligence

M1 - 104585

ER -