Author:
Choudhari Jayesh,Reddy I. Vinod
Publisher
Springer International Publishing
Reference23 articles.
1. Lecture Notes in Computer Science;A Adiga,2010
2. Agrawal, A.: On the parameterized complexity of happy vertex coloring. In: International Workshop on Combinatorial Algorithms. Springer (2017, in press)
3. Lecture Notes in Computer Science;NR Aravind,2016
4. Aravind, N., Kalyanasundaram, S., Kare, A.S., Lauri, J.: Algorithms and hardness results for happy coloring problems. arXiv preprint arXiv:1705.08282 (2017)
5. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM (1999)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Backdoor DNFs;Journal of Computer and System Sciences;2024-09
2. Parameterized algorithms for the Happy Set problem;Discrete Applied Mathematics;2021-12
3. Complexity and approximability of the happy set problem;Theoretical Computer Science;2021-04
4. Lower bounds for the happy coloring problems;Theoretical Computer Science;2020-10
5. Parameterized Algorithms for the Happy Set Problem;WALCOM: Algorithms and Computation;2020