Intl. Colloquium on Automata, Languages, and Programming, ICALP 2018


Article Details
Title: How Hard Is It to Satisfy (Almost) All Roommates?
Article URLs:
Alternative Article URLs:
Authors: Jiehua Chen
  • Ben-Gurion University of the Negev
Danny Hermelin
  • Ben-Gurion University of the Negev
Manuel Sorge
  • Ben-Gurion University of the Negev
Harel Yedidsion
  • Ben-Gurion University of the Negev
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/icalp/ChenHSY18
Author Comments:

Discuss this paper and its artifacts below