ACM Symposium on Theory of Computing, STOC 2018


Article Details
Title: On the parameterized complexity of approximating dominating set
Article URLs:
Alternative Article URLs:
Authors: Karthik C. S.
  • Weizmann Institute of Science
Bundit Laekhanukit
  • Max-Planck-Institute for Informatics
  • Shanghai University of Finance and Economics
Pasin Manurangsi
  • University of California, Berkeley
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1740425, 1540685, 1655215
DBLP Key: conf/stoc/SLM18
Author Comments:

Discuss this paper and its artifacts below