Sounaka Mishra

According to our database, Sounaka Mishra authored at least 30 papers between 2000 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Corrigendum to "On the complexity of co-secure dominating set problem" [Inf. Process. Lett. 185 (2024) 106463].

Bhawani Sankar Panda, Soumyashree Rana, Sounaka Mishra

Inf. Process. Lett., 2026

2025

On minimum t-claw deletion in split graphs.

Sounaka Mishra

Acta Informatica, March, 2025

Disjoint dominating and 2-dominating sets in graphs: Hardness and approximation results.

Soumyashree Rana, Sounaka Mishra, Bhawani Sankar Panda

Discret. Optim., 2025

2024

Complexity of Near-3-Choosability Problem.

Sounaka Mishra, S. Rohini, Sagar S. Sawant

Graphs Comb., December, 2024

On the complexity of co-secure dominating set problem.

B. S. Panda, Soumyashree Rana, Sounaka Mishra

Inf. Process. Lett., March, 2024

Approximation algorithm for minimum q-dominator partization problem.

Sayani Das, Sounaka Mishra

Discret. Math. Algorithms Appl., January, 2024

2023

Minimum Maximal Acyclic Matching in Proper Interval Graphs.

Juhi Chaudhary, Sounaka Mishra, B. S. Panda

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022

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

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

Approximability of open k-monopoly problems.

Sounaka Mishra, B. Arjuna Krishna, Shijin Rajakrishnan

Theory Comput. Syst., 2021

2020

Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes.

Sayani Das, Sounaka Mishra

Discret. Math. Algorithms Appl., 2020

2019

A 4-approximation algorithm for the TSP-Path satisfying a biased triangle inequality.

Usha Mohan, Sivaramakrishnan Ramani, Sounaka Mishra

Discret. Appl. Math., 2019

2017

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

The Complexity of Maximum k-Order Bounded Component Set Proble.

Sounaka Mishra, Shijin Rajakrishnan

CoRR, 2017

FO and MSO approach to Some Graph Problems: Approximation and Poly time Results.

Kona Harshita, Sounaka Mishra, P. Renjith, N. Sadagopan

CoRR, 2017

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

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

2014

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

2012

Complexity of majority monopoly and signed domination problems.

Sounaka Mishra

J. Discrete Algorithms, 2012

2011

On the Maximum Uniquely Restricted Matching for Bipartite Graphs.

Sounaka Mishra

Electron. Notes Discret. Math., 2011

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

Approximation Algorithms for Minimum Chain Vertex Deletion.

Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

2008

König Deletion Sets and Vertex Covers above the Matching Size.

Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.

Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2004

On approximability of linear ordering and related NP-optimization problems on graphs.

Sounaka Mishra, Kripasindhu Sikdar

Discret. Appl. Math., 2004

2003

Minimum Monopoly in Regular and Tree Graphs.

Sounaka Mishra, Siddani Bhaskara Rao

Electron. Notes Discret. Math., 2003

2001

On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract).

Sounaka Mishra, Kripasindhu Sikdar

Electron. Notes Discret. Math., 2001

Optimizing Register Spills for Eager Functional Languages.

Sounaka Mishra, Kripasindhu Sikdar, Manoranjan Satpathy

Proceedings of the Computational Science - ICCS 2001, 2001

2000

On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem.

Sounaka Mishra, Kripasindhu Sikdar

Proceedings of the Theoretical Computer Science, 2000