EDBT 2026 Demo / reviewers in the wild / expert
Sounaka Mishra
dblp:42/2840
· DBLP profile ↗
16ranked-venue papers
8as first author
6since 2021 · last 2026
0000-0001-8393-9109ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 15 · 7 first-author · 6 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Complexity of (p,q)-bipartition of planar and 1-planar graphs
Cyriac Antony, Abhimanyoo Karve, Sounaka Mishra |
Discret. Appl. Math. | 3 |
| 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. | 3 |
| 2025 | On minimum t-claw deletion in split graphs
Sounaka Mishra |
Acta Informatica | 1 |
| 2024 | On the complexity of co-secure dominating set problem
Bhawani Sankar Panda, Soumyashree Rana, Sounaka Mishra |
Inf. Process. Lett. | 3 |
| 2022 | On the Complexity of Minimum Maximal Acyclic Matchings
Juhi Chaudhary, Sounaka Mishra, Bhawani Sankar Panda |
COCOON | 2 |
| 2021 | Approximability of open k-monopoly problems
Sounaka Mishra, B. Arjuna Krishna, Shijin Rajakrishnan |
Theory Comput. Syst. | 1 |
| 2019 | A 4-approximation algorithm for the TSP-Path satisfying a biased triangle inequality
Usha Mohan, Sivaramakrishnan Ramani, Sounaka Mishra |
Discret. Appl. Math. | 3 |
| 2017 | On approximability of optimization problems related to Red/Blue-split graphs
Sounaka Mishra, Shijin Rajakrishnan, Saket Saurabh 0001 |
Theor. Comput. Sci. | 1 |
| 2017 | Constant factor approximation algorithm for TSP satisfying a biased triangle inequality
Usha Mohan, Sivaramakrishnan Ramani, Sounaka Mishra |
Theor. Comput. Sci. | 3 |
| 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. | 3 |
| 2014 | Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
Mrinal Kumar 0001, Sounaka Mishra, N. Safina Devi, Saket Saurabh 0001 |
Theor. Comput. Sci. | 2 |
| 2011 | The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover
Sounaka Mishra, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar, C. R. Subramanian 0001 |
Algorithmica | 1 |
| 2008 | König Deletion Sets and Vertex Covers above the Matching Size
Sounaka Mishra, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar |
ISAAC | 1 |
| 2007 | The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
Sounaka Mishra, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar, C. R. Subramanian 0001 |
ISAAC | 1 |
| 2004 | On approximability of linear ordering and related NP-optimization problems on graphs
Sounaka Mishra, Kripasindhu Sikdar |
Discret. Appl. Math. | 1 |
| 2002 | Optimizing register spills for eager functional languages
Sounaka Mishra, Kripasindhu Sikdar, Manoranjan Satpathy |
Future Gener. Comput. Syst. | 1 |