Sounaka Mishra

38 papers B 3Misc 2Journal 31Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Corrigendum to "On the complexity of co-secure dominating set problem" [Inf. Process. Lett. 185 (2024) 106463].
Inf. Process. Lett.
Bhawani Sankar Panda, Soumyashree Rana, Sounaka Mishra
2025 J jnl
Disjoint dominating and 2-dominating sets in graphs: Hardness and approximation results.
Discret. Optim.
Soumyashree Rana, Sounaka Mishra, Bhawani Sankar Panda
2025 J jnl
On minimum t-claw deletion in split graphs.
Acta Informatica
Sounaka Mishra
2024 J jnl
Approximation algorithm for minimum q-dominator partization problem.
Discret. Math. Algorithms Appl.
Sayani Das, Sounaka Mishra
2024 J jnl
Complexity of Near-3-Choosability Problem.
Graphs Comb.
Sounaka Mishra, S. Rohini, Sagar S. Sawant
2024 J jnl
On the complexity of co-secure dominating set problem.
Inf. Process. Lett.
B. S. Panda, Soumyashree Rana, Sounaka Mishra
2024 J jnl
On the complexity of minimum maximal acyclic matchings.
J. Comb. Optim.
Juhi Chaudhary, Sounaka Mishra, B. S. Panda
2023 J jnl
Disjoint Dominating and 2-Dominating Sets in Graphs: Hardness and Approximation results.
CoRR
Soumyashree Rana, Sounaka Mishra, Bhawani Sankar Panda
2023 — conf
Minimum Maximal Acyclic Matching in Proper Interval Graphs.
CALDAM
Juhi Chaudhary, Sounaka Mishra, B. S. Panda
2023 J jnl
On minimum t-claw deletion in split graphs.
CoRR
Sounaka Mishra
2023 J jnl
On the Complexity of Co-secure Dominating Set Problem.
CoRR
Bhawani Sankar Panda, Soumyashree Rana, Sounaka Mishra
2022 Misc conf
On the Complexity of Minimum Maximal Acyclic Matchings.
COCOON
Juhi Chaudhary, Sounaka Mishra, B. S. Panda
2022 J jnl
On the complexity of minimum q-domination partization problems.
J. Comb. Optim.
Sayani Das, Sounaka Mishra
2021 J jnl
Approximability of open k-monopoly problems.
Theory Comput. Syst.
Sounaka Mishra, B. Arjuna Krishna, Shijin Rajakrishnan
2020 J jnl
Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes.
Discret. Math. Algorithms Appl.
Sayani Das, Sounaka Mishra
2019 J jnl
A 4-approximation algorithm for the TSP-Path satisfying a biased triangle inequality.
Discret. Appl. Math.
Usha Mohan, Sivaramakrishnan Ramani, Sounaka Mishra
2017 J jnl
Constant factor approximation algorithm for TSP satisfying a biased triangle inequality.
Theor. Comput. Sci.
Usha Mohan, Sivaramakrishnan Ramani, Sounaka Mishra
2017 J jnl
FO and MSO approach to Some Graph Problems: Approximation and Poly time Results.
CoRR
Kona Harshita, Sounaka Mishra, P. Renjith, N. Sadagopan
2017 J jnl
On approximability of optimization problems related to Red/Blue-split graphs.
Theor. Comput. Sci.
Sounaka Mishra, Shijin Rajakrishnan, Saket Saurabh
2017 J jnl
The Complexity of Maximum k-Order Bounded Component Set Proble.
CoRR
Sounaka Mishra, Shijin Rajakrishnan
2015 J jnl
Computational complexity of minimum P4 vertex cover problem for regular and K1, 4-free graphs.
Discret. Appl. Math.
N. Safina Devi, Aniket C. Mane, Sounaka Mishra
2015 J jnl
On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion.
J. Discrete Algorithms
Sounaka Mishra, Ashwin Pananjady, N. Safina Devi
2014 J jnl
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization.
Theor. Comput. Sci.
Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh
2013 J jnl
On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion.
CoRR
Sounaka Mishra, Ashwin Pananjady, N. Safina Devi
2012 J jnl
Complexity of majority monopoly and signed domination problems.
J. Discrete Algorithms
Sounaka Mishra
2011 B conf
Approximation Algorithms for Minimum Chain Vertex Deletion.
WALCOM
Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh
2011 J jnl
On the Maximum Uniquely Restricted Matching for Bipartite Graphs.
Electron. Notes Discret. Math.
Sounaka Mishra
2011 J jnl
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover.
Algorithmica
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian
2008 B conf
König Deletion Sets and Vertex Covers above the Matching Size.
ISAAC
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2007 B conf
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.
ISAAC
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian
2006 J jnl
Minimum monopoly in regular and tree graphs.
Discret. Math.
Sounaka Mishra, Siddani Bhaskara Rao
2004 J jnl
On approximability of linear ordering and related NP-optimization problems on graphs.
Discret. Appl. Math.
Sounaka Mishra, Kripasindhu Sikdar
2003 J jnl
Minimum Monopoly in Regular and Tree Graphs.
Electron. Notes Discret. Math.
Sounaka Mishra, Siddani Bhaskara Rao
2002 J jnl
Optimizing register spills for eager functional languages.
Future Gener. Comput. Syst.
Sounaka Mishra, Kripasindhu Sikdar, Manoranjan Satpathy
2001 J jnl
On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract).
Electron. Notes Discret. Math.
Sounaka Mishra, Kripasindhu Sikdar
2001 J jnl
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem.
RAIRO Theor. Informatics Appl.
Sounaka Mishra, Kripasindhu Sikdar
2001 Misc conf
Optimizing Register Spills for Eager Functional Languages.
International Conference on Computational Science (2)
Sounaka Mishra, Kripasindhu Sikdar, Manoranjan Satpathy
2000 — conf
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem.
IFIP TCS
Sounaka Mishra, Kripasindhu Sikdar