Searching for authors named "Somnath Sikdar" – sorted by Relevance.
6 documents found, showing 1 through 6.
-
The parameterized complexity of the induced matching problem in planar graphs
- … Informatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz 2, D-07743 Jena, Germany Somnath Sikdar…
- Cited by 3 (0 self) – Add To MetaCart
-
The parameterized complexity of the rectangle stabbing problem and its variants
- … Complexity of the Rectangle Stabbing Problem and its Variants ⋆ Michael Dom 1 and Somnath Sikdar 2 1 Institut…
- Cited by 1 (1 self) – Add To MetaCart
-
Parameterizing MAX SNP Problems Above Guaranteed Values
- …, and Somnath Sikdar The Institute of Mathematical Sciences, C.I.T Campus, Taramani, Chennai 600113. {meena,vraman,somnath…
- Cited by 1 (1 self) – Add To MetaCart
-
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems
- …, SAKET SAURABH, SOMNATH SIKDAR The Institute of Mathematical Sciences, Taramani, Chennai 600113. {vraman|saket|somnath…
- Cited by 1 (0 self) – Add To MetaCart
-
The Parameterized Complexity of the Unique Coverage Problem ⋆
- … Problem ⋆ Hannes Moser 1⋆⋆ , Venkatesh Raman 2 , Somnath Sikdar 2 1 Institut für Informatik, Friedrich…
- Cited by 1 (0 self) – Add To MetaCart
-
Subramanian The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex
- … Mishra 1 , Venkatesh Raman 2 , Saket Saurabh 2 , Somnath Sikdar 2 and C. R. Subramanian 2 1 Indian…
- Cited by 3 (1 self) – Add To MetaCart
Showing 1 through 6.
