On minimum t-claw deletion in split graphs - Sounaka Mishra (Acta Informatica, 2025)

Approximation algorithm for minimum q-dominator partization problem - Sayani Das; Sounaka Mishra (Discret. Math. Algorithms Appl., 2024)

Complexity of Near-3-Choosability Problem - Sounaka Mishra; S. Rohini; Sagar S. Sawant (Graphs Comb., 2024)

On the complexity of co-secure dominating set problem - B. S. Panda; Soumyashree Rana; Sounaka Mishra (Inf. Process. Lett., 2024)

On the complexity of minimum maximal acyclic matchings - Juhi Chaudhary; Sounaka Mishra; B. S. Panda (J. Comb. Optim., 2024)

Minimum Maximal Acyclic Matching in Proper Interval Graphs - Juhi Chaudhary; Sounaka Mishra; B. S. Panda (Algorithms and Discrete Applied Mathematics - 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023, Proceedings, 2023)

On the Complexity of Co-secure Dominating Set Problem - Bhawani Sankar Panda; Soumyashree Rana; Sounaka Mishra (CoRR, 2023)

On minimum t-claw deletion in split graphs - Sounaka Mishra (CoRR, 2023)

Disjoint Dominating and 2-Dominating Sets in Graphs: Hardness and Approximation results - Soumyashree Rana; Sounaka Mishra; Bhawani Sankar Panda (CoRR, 2023)

On the complexity of minimum q-domination partization problems - Sayani Das; Sounaka Mishra (J. Comb. Optim., 2022)

On the Complexity of Minimum Maximal Acyclic Matchings - Juhi Chaudhary; Sounaka Mishra; B. S. Panda (Computing and Combinatorics - 28th International Conference, COCOON 2022, Shenzhen, China, October 22-24, 2022, Proceedings, 2022)

Approximability of open k-monopoly problems - Sounaka Mishra; B. Arjuna Krishna; Shijin Rajakrishnan (Theory Comput. Syst., 2021)

Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes - Sayani Das; Sounaka Mishra (Discret. Math. Algorithms Appl., 2020)

A 4-approximation algorithm for the TSP-Path satisfying a biased triangle inequality - Usha Mohan; Sivaramakrishnan Ramani; Sounaka Mishra (Discret. Appl. Math., 2019)

Constant factor approximation algorithm for TSP satisfying a biased triangle inequality - Usha Mohan; Sivaramakrishnan Ramani; Sounaka Mishra (Theor. Comput. Sci., 2017)

On approximability of optimization problems related to Red/Blue-split graphs - Sounaka Mishra; Shijin Rajakrishnan; Saket Saurabh (Theor. Comput. Sci., 2017)

FO and MSO approach to Some Graph Problems: Approximation and Poly time Results - Kona Harshita; Sounaka Mishra; P. Renjith; N. Sadagopan (CoRR, 2017)

The Complexity of Maximum k-Order Bounded Component Set Proble - Sounaka Mishra; Shijin Rajakrishnan (CoRR, 2017)

Computational complexity of minimum P4 vertex cover problem for regular and K1, 4-free graphs - N. Safina Devi; Aniket C. Mane; Sounaka Mishra (Discret. Appl. Math., 2015)

On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion - Sounaka Mishra; Ashwin Pananjady; N. Safina Devi (J. Discrete Algorithms, 2015)

Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization - Mrinal Kumar; Sounaka Mishra; N. Safina Devi; Saket Saurabh (Theor. Comput. Sci., 2014)

On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion - Sounaka Mishra; Ashwin Pananjady; N. Safina Devi (CoRR, 2013)

Complexity of majority monopoly and signed domination problems - Sounaka Mishra (J. Discrete Algorithms, 2012)

The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover - Sounaka Mishra; Venkatesh Raman; Saket Saurabh; Somnath Sikdar; C. R. Subramanian (Algorithmica, 2011)

On the Maximum Uniquely Restricted Matching for Bipartite Graphs - Sounaka Mishra (Electron. Notes Discret. Math., 2011)

Approximation Algorithms for Minimum Chain Vertex Deletion - Mrinal Kumar; Sounaka Mishra; N. Safina Devi; Saket Saurabh (WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, 2011)

König Deletion Sets and Vertex Covers above the Matching Size - Sounaka Mishra; Venkatesh Raman; Saket Saurabh; Somnath Sikdar (Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, 2008)

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number - Sounaka Mishra; Venkatesh Raman; Saket Saurabh; Somnath Sikdar; C. R. Subramanian (Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, 2007)

Minimum monopoly in regular and tree graphs - Sounaka Mishra; Siddani Bhaskara Rao (Discret. Math., 2006)

On approximability of linear ordering and related NP-optimization problems on graphs - Sounaka Mishra; Kripasindhu Sikdar (Discret. Appl. Math., 2004)

Minimum Monopoly in Regular and Tree Graphs - Sounaka Mishra; Siddani Bhaskara Rao (Electron. Notes Discret. Math., 2003)

Optimizing register spills for eager functional languages - Sounaka Mishra; Kripasindhu Sikdar; Manoranjan Satpathy (Future Gener. Comput. Syst., 2002)

On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract) - Sounaka Mishra; Kripasindhu Sikdar (Electron. Notes Discret. Math., 2001)

On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem - Sounaka Mishra; Kripasindhu Sikdar (RAIRO Theor. Informatics Appl., 2001)

Optimizing Register Spills for Eager Functional Languages - Sounaka Mishra; Kripasindhu Sikdar; Manoranjan Satpathy (Computational Science - ICCS 2001, International Conference, San Francisco, CA, USA, May 28-30, 2001. Proceedings, Part II, 2001)

On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem - Sounaka Mishra; Kripasindhu Sikdar (Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings, 2000)