Author:
Acharyya Ankush,Keikha Vahideh,Majumdar Diptapriyo,Pandit Supantha
Publisher
Springer International Publishing
Reference28 articles.
1. Abu-Khzam, F.N.: A kernelization algorithm for $$d$$-hitting set. J. Comput. Syst. Sci. 76(7), 524–531 (2010)
2. Agrawal, A., Jain, P., Kanesh, L., Saurabh, S.: Parameterized complexity of conflict-free matchings and paths. Algorithmica 82(7), 1939–1965 (2020). https://doi.org/10.1007/s00453-020-00681-y
3. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Boston (1974)
4. Aronov, B., Ezra, E., Sharir, M.: Small-size $$\epsilon $$-nets for axis-parallel rectangles and boxes. SIAM J. Comput. 39(7), 3248–3282 (2010)
5. Ausiello, G., D’Atri, A., Protasi, M.: Structure preserving reductions among convex optimization problems. J. Comput. Syst. Sci. 21(1), 136–153 (1980)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献