Publications

• Daniel Lokshtanov, Saket Saurabh and Somnath Sikdar. A Simpler Parameterized Algorithm for OCT. In Proceedings of the 20th International Workshop on Combinatorial Algorithms (IWOCA 2009).
  
• Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh and Somnath Sikdar. On the Directed Degree Preserving Spanning Tree Problem. Under Submission.
  
• Geevarghese Philip, Venkatesh Raman and Somnath Sikdar. A Polynomial Kernel for the Dominating Set Problem in K_{i,j}-Free  and Degenerate Graphs. In Proceedings of the 17th Annual European Symposium on Algorithms (ESA 2009).
  
• Neeldhara Misra, Venkatesh Raman, Saket Saurabh and Somnath Sikdar. The Budgeted Unique Coverage Problem and Color Coding. Accepted at the 4th Computer Science Symposium in Russia, CSR 2009. 
• Sounaka Mishra, Venkatesh Raman, Saket Saurabh and Somnath Sikdar. Konig Deletion Sets and Vertex Covers Above the Matching Size. Accepted in ISAAC 2008.
  
• Michael Dom and Somnath Sikdar. The Parameterized Complexity of the Rectangle Stabbing Problem. Accepted in Frontiers of Algorithmics Workshop (FAW 2008).
  
• Hannes Moser, Venkatesh Raman, Somnath Sikdar. Making a Hard Problem Easier: The Complexity of the Unique Coverage Problem. Accepted in ISAAC 2007. Here's an extended version of this work.
  
• Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian. The Complexity of Finding Subgraphs whose Matching Number Equals the Vertex Cover Number. Accepted in ISAAC 2007. An extended version is under preparation.
  
• Hannes Moser, Somnath Sikdar. Parameterized Complexity of the Induced Matching Problem in Planar Graphs. Accepted in Frontiers of Algorithms Workshop (FAW 2007), Lanzhou, China. Springer LNCS. An extended version is to appear in Discrete Applied Mathematics.
  
• Venkatesh Raman, Somnath Sikdar. Parameterized Complexity of the Induced Subgraph Problem in Directed Graphs. Information Processing Letters.
• Meena Mahajan, Venkatesh Raman, Somnath Sikdar. Parameterizing NP-Optimization Problems Above/Below Guaranteed Values. To appear in the Journal of Computer and System Sciences.
• Meena Mahajan, Venkatesh Raman, Somnath Sikdar. Parameterizing MAX SNP Problems Above Guaranteed Values. Accepted in IWPEC 2006.
• Venkatesh Raman, Saket Surabh, Somnath Sikdar. Efficient Exact Algorithms  through Enumerating Maximal Independent Sets and Other Techniques.  Accepted for publication in The Theory of Computing Systems.
• Venkatesh Raman, Saket Saurabh, Somnath Sikdar. Improved Exact Algorithms for Vertex Bipartization and Other Problems.  Proceedings of the 9th Italian Conference on Theoretical Computer Science, ICTCS 2005. Springer Verlag LNCS Vol. 3701, pp 375-389, 2005.
• Avishek  Adhikari, Somnath Sikdar. A new (2,n)-Visual Threshold Scheme for Color Images. Indocrypt 2003, Springer Verlag, LNCS Vol. 2904, pp 148-161, 2003.

---

Back to home page