default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSounaka Mishra
- > Home > Persons > Sounaka Mishra
Publications
- 2024
[j21]Sayani Das, Sounaka Mishra
:
Approximation algorithm for minimum q-dominator partization problem. Discret. Math. Algorithms Appl. 16(1): 2250188:1-2250188:24 (2024)- 2022
- [j18]Sayani Das, Sounaka Mishra:
On the complexity of minimum q-domination partization problems. J. Comb. Optim. 43(2): 363-383 (2022) - 2021
- [j17]Sounaka Mishra, B. Arjuna Krishna, Shijin Rajakrishnan:
Approximability of open k-monopoly problems. Theory Comput. Syst. 65(5): 798-814 (2021) - 2020
- [j16]Sayani Das, Sounaka Mishra:
Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes. Discret. Math. Algorithms Appl. 12(6): 2050086:1-2050086:11 (2020) - 2017
- [j13]Sounaka Mishra, Shijin Rajakrishnan, Saket Saurabh:
On approximability of optimization problems related to Red/Blue-split graphs. Theor. Comput. Sci. 690: 104-113 (2017) - [i3]Kona Harshita, Sounaka Mishra, P. Renjith, N. Sadagopan:
FO and MSO approach to Some Graph Problems: Approximation and Poly time Results. CoRR abs/1711.02889 (2017) - [i2]Sounaka Mishra, Shijin Rajakrishnan:
The Complexity of Maximum k-Order Bounded Component Set Proble. CoRR abs/1712.02870 (2017) - 2015
- [j12]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: 114-121 (2015) - [j11]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: 71-80 (2015) - 2014
- [j10]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: 90-96 (2014) - 2013
- [i1]Sounaka Mishra, Ashwin Pananjady, N. Safina Devi:
On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion. CoRR abs/1312.3779 (2013) - 2011
- [j8]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): 857-881 (2011) - [c5]Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh:
Approximation Algorithms for Minimum Chain Vertex Deletion. WALCOM 2011: 21-32 - 2008
- [c4]Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
König Deletion Sets and Vertex Covers above the Matching Size. ISAAC 2008: 836-847 - 2007
- [c3]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: 268-279
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
