"The Complexity of Envy-Free Graph Cutting."

Argyrios Deligkas et al. (2022)

> Home

Details and statistics

DOI: 10.24963/IJCAI.2022/34

access: open

type: Conference or Workshop Paper

metadata version: 2022-07-27

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/ijcai/DeligkasEGHO22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcai/DeligkasEGHO22
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
The Complexity of Envy-Free Graph Cutting. IJCAI 2022: 237-243

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.