Остановите войну!
for scientists:
default search action
Somnath Sikdar
- > Home > Persons > Somnath Sikdar
Publications
- 2013
- [j10]Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
The Parameterized Complexity of Unique Coverage and Its Variants. Algorithmica 65(3): 517-544 (2013) - 2012
- [j8]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
FPT algorithms for Connected Feedback Vertex Set. J. Comb. Optim. 24(2): 131-146 (2012) - [j7]Geevarghese Philip, Venkatesh Raman, Somnath Sikdar:
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond. ACM Trans. Algorithms 9(1): 11:1-11:23 (2012) - 2011
- [j6]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) - [j5]Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
On the directed Full Degree Spanning Tree problem. Discret. Optim. 8(1): 97-109 (2011) - 2010
- [c13]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
FPT Algorithms for Connected Feedback Vertex Set. WALCOM 2010: 269-280 - 2009
- [j3]Meena Mahajan, Venkatesh Raman, Somnath Sikdar:
Parameterizing above or below guaranteed values. J. Comput. Syst. Sci. 75(2): 137-153 (2009) - [c12]Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
The Budgeted Unique Coverage Problem and Color-Coding. CSR 2009: 310-321 - [c11]Geevarghese Philip, Venkatesh Raman, Somnath Sikdar:
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. ESA 2009: 694-705 - [c9]Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
On the Directed Degree-Preserving Spanning Tree Problem. IWPEC 2009: 276-287 - [i2]Geevarghese Philip, Venkatesh Raman, Somnath Sikdar:
Polynomial Kernels for Dominating Set in Ki,j-free and d-degenerate Graphs. CoRR abs/0903.4521 (2009) - [i1]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
FPT Algorithms for Connected Feedback Vertex Set. CoRR abs/0909.3180 (2009) - 2008
- [c7]Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
König Deletion Sets and Vertex Covers above the Matching Size. ISAAC 2008: 836-847 - 2007
- [j2]Venkatesh Raman, Somnath Sikdar:
Parameterized complexity of the induced subgraph problem in directed graphs. Inf. Process. Lett. 104(3): 79-85 (2007) - [j1]Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques. Theory Comput. Syst. 41(3): 563-587 (2007) - [c5]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 - [c4]Hannes Moser, Venkatesh Raman, Somnath Sikdar:
The Parameterized Complexity of the Unique Coverage Problem. ISAAC 2007: 621-631 - 2006
- [c3]Meena Mahajan, Venkatesh Raman, Somnath Sikdar:
Parameterizing MAX SNP Problems Above Guaranteed Values. IWPEC 2006: 38-49 - 2005
- [c2]Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. ICTCS 2005: 375-389
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-04-25 02:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint