The Complexity of Envy-Free Graph Cutting

Abstract

Full Citation:

Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak. The Complexity of Envy-Free Graph Cutting. Artificial Intelligence, 2026. (Note: to appear)

Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.