• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Parameterized complexity of happy coloring problems.

Akanksha AgrawalN. R. AravindSubrahmanyam KalyanasundaramAnjeneya Swami KareJuho LauriNeeldhara MisraI. Vinod Reddy
Published in: Theor. Comput. Sci. (2020)
Keyphrases
  • parameterized complexity
  • np complete