On the complexity of minimum maximal acyclic matchings
Chaudhary, Juhi, Mishra, Sounaka, Panda, B. S.
Published in Journal of combinatorial optimization (01.08.2024)
Published in Journal of combinatorial optimization (01.08.2024)
Get full text
Journal Article
Approximability of open k-monopoly problems
Mishra, Sounaka, Krishna, B. Arjuna, Rajakrishnan, Shijin
Published in Theory of computing systems (01.07.2021)
Published in Theory of computing systems (01.07.2021)
Get full text
Journal Article
Minimum maximal acyclic matching in proper interval graphs
Chaudhary, Juhi, Mishra, Sounaka, Panda, B.S.
Published in Discrete Applied Mathematics (15.01.2025)
Published in Discrete Applied Mathematics (15.01.2025)
Get full text
Journal Article
On the complexity of co-secure dominating set problem
Panda, B.S., Rana, Soumyashree, Mishra, Sounaka
Published in Information processing letters (01.03.2024)
Published in Information processing letters (01.03.2024)
Get full text
Journal Article
A 4-approximation algorithm for the TSP-Path satisfying a biased triangle inequality
Mohan, Usha, Ramani, Sivaramakrishnan, Mishra, Sounaka
Published in Discrete Applied Mathematics (01.12.2019)
Published in Discrete Applied Mathematics (01.12.2019)
Get full text
Journal Article
Constant factor approximation algorithm for TSP satisfying a biased triangle inequality
Mohan, Usha, Ramani, Sivaramakrishnan, Mishra, Sounaka
Published in Theoretical computer science (02.01.2017)
Published in Theoretical computer science (02.01.2017)
Get full text
Journal Article
On approximability of optimization problems related to Red/Blue-split graphs
Mishra, Sounaka, Rajakrishnan, Shijin, Saurabh, Saket
Published in Theoretical computer science (22.08.2017)
Published in Theoretical computer science (22.08.2017)
Get full text
Journal Article
Computational complexity of minimum vertex cover problem for regular and -free graphs
Devi, NSafina, Mane, Aniket C, Mishra, Sounaka
Published in Discrete Applied Mathematics (31.03.2015)
Published in Discrete Applied Mathematics (31.03.2015)
Get full text
Journal Article
Computational complexity of minimum P4 vertex cover problem for regular and K1,4-free graphs
Safina Devi, N., Mane, Aniket C., Mishra, Sounaka
Published in Discrete Applied Mathematics (31.03.2015)
Published in Discrete Applied Mathematics (31.03.2015)
Get full text
Journal Article
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover
Mishra, Sounaka, Raman, Venkatesh, Saurabh, Saket, Sikdar, Somnath, Subramanian, C. R.
Published in Algorithmica (01.12.2011)
Published in Algorithmica (01.12.2011)
Get full text
Journal Article
Conference Proceeding
Computational complexity of minimum P 4 vertex cover problem for regular and K 1 , 4 -free graphs
Safina Devi, N., Mane, Aniket C., Mishra, Sounaka
Published in Discrete Applied Mathematics (01.03.2015)
Published in Discrete Applied Mathematics (01.03.2015)
Get full text
Journal Article