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 (Future Gener. Comput. Syst., 2002)

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

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

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. - Sounaka Mishra; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar; C. R. Subramanian 001 (ISAAC, 2007)

König Deletion Sets and Vertex Covers above the Matching Size. - Sounaka Mishra; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (ISAAC, 2008)

Approximation Algorithms for Minimum Chain Vertex Deletion. - Mrinal Kumar 001; Sounaka Mishra; N. Safina Devi; Saket Saurabh 001 (WALCOM, 2011)

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

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

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

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

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)

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)

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

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

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

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

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

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

Minimum Maximal Acyclic Matching in Proper Interval Graphs. - Juhi Chaudhary; Sounaka Mishra; B. S. Panda 001 (CALDAM, 2023)

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

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

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

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

Disjoint dominating and 2-dominating sets in graphs: Hardness and approximation results. - Soumyashree Rana; Sounaka Mishra; Bhawani Sankar Panda (Discret. Optim., 2025)

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