Author:
Chaudhary Juhi,Mishra Sounaka,Panda B. S.
Publisher
Springer International Publishing
Reference23 articles.
1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Spaccamela, A.M., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (2012)
2. Bazgan, C., et al.: The many facets of upper domination. Theoret. Comput. Sci. 717, 2–25 (2018)
3. Boria, N., Croce, F.D., Paschos, V.T.: On the max min vertex cover problem. Discret. Appl. Math. 196, 62–71 (2015)
4. Chaudhary, J., Panda, B.S.: On the complexity of minimum maximal uniquely restricted matching. Theoret. Comput. Sci. 882, 15–28 (2021)
5. Damaschke, P.: Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover. Discret. Optim. 8(1), 18–24 (2011)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the complexity of minimum maximal acyclic matchings;Journal of Combinatorial Optimization;2024-08
2. On Two Variants of Induced Matchings;Communications in Computer and Information Science;2022