Author:
Bliznets Ivan,Sagunov Danil
Publisher
Springer International Publishing
Reference22 articles.
1. Lecture Notes in Computer Science;A Agrawal,2018
2. Lecture Notes in Computer Science;NR Aravind,2016
3. Aravind, N., Kalyanasundaram, S., Kare, A.S., Lauri, J.: Algorithms and hardness results for happy coloring problems. arXiv preprint
arXiv:1705.08282
(2017)
4. Lecture Notes in Computer Science;J Choudhari,2018
5. Cygan, M., et al.: On problems as hard as CNF-SAT. ACM Trans. Algorithms 12(3), 1–24 (2016)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献