Sounaka Mishra

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 16

Top Topics

Approximation Algorithms

Bipartite Graph

Triangle Inequality

Top Venues

Theor. Comput. Sci.

J. Comb. Optim.

Discret. Appl. Math.

Publications

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