IEEE Foundations of Computer Science, FOCS 2017


Article Details
Title: From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More
Article URLs:
Alternative Article URLs:
Authors: Parinya Chalermsook
  • Aalto University, CS
Marek Cygan
  • University of Warsaw, Informatics Institute
Guy Kortsarz
  • Rutgers University, CS
Bundit Laekhanukit
  • Weizmann Institute of Science, Math
  • Weizmann Institute of Science, CS
Pasin Manurangsi
  • UC Berkeley, EECS
Danupon Nanongkai
  • KTH Royal Institute of Technology, CSC
Luca Trevisan
  • UC Berkeley, EECS
  • UC Berkeley, Simons Institute for the Theory of Computing
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1218620, 1540547, 1540685, 1655215
DBLP Key: conf/focs/ChalermsookCKLM17
Author Comments:

Discuss this paper and its artifacts below