Author:
Agrawal Akanksha,Aravind N.R.,Kalyanasundaram Subrahmanyam,Kare Anjeneya Swami,Lauri Juho,Misra Neeldhara,Reddy I. Vinod
Subject
General Computer Science,Theoretical Computer Science
Reference30 articles.
1. On the parameterized complexity of happy vertex coloring;Agrawal,2017
2. Linear time algorithms for happy vertex coloring problems for trees;Aravind,2016
3. Set Partitioning via Inclusion-Exclusion;Björklund;SIAM J. Comput.,2009
4. Lower bounds for the happy coloring problems;Bliznets,2019
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献