| 2009 |
|---|
| 12 | EE | Geevarghese Philip,
Venkatesh Raman,
Somnath Sikdar:
Polynomial Kernels for Dominating Set in $K_{i,j}$-free and d-degenerate Graphs
CoRR abs/0903.4521: (2009) |
| 11 | EE | Meena Mahajan,
Venkatesh Raman,
Somnath Sikdar:
Parameterizing above or below guaranteed values.
J. Comput. Syst. Sci. 75(2): 137-153 (2009) |
| 2008 |
|---|
| 10 | EE | Michael Dom,
Somnath Sikdar:
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants.
FAW 2008: 288-299 |
| 9 | EE | Sounaka Mishra,
Venkatesh Raman,
Saket Saurabh,
Somnath Sikdar:
König Deletion Sets and Vertex Covers above the Matching Size.
ISAAC 2008: 836-847 |
| 2007 |
|---|
| 8 | EE | Hannes Moser,
Somnath Sikdar:
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs.
FAW 2007: 325-336 |
| 7 | EE | 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 |
| 6 | EE | Hannes Moser,
Venkatesh Raman,
Somnath Sikdar:
The Parameterized Complexity of the Unique Coverage Problem.
ISAAC 2007: 621-631 |
| 5 | EE | Venkatesh Raman,
Somnath Sikdar:
Parameterized complexity of the induced subgraph problem in directed graphs.
Inf. Process. Lett. 104(3): 79-85 (2007) |
| 4 | EE | 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) |
| 2006 |
|---|
| 3 | EE | Meena Mahajan,
Venkatesh Raman,
Somnath Sikdar:
Parameterizing MAX SNP Problems Above Guaranteed Values.
IWPEC 2006: 38-49 |
| 2005 |
|---|
| 2 | EE | Venkatesh Raman,
Saket Saurabh,
Somnath Sikdar:
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems.
ICTCS 2005: 375-389 |
| 2003 |
|---|
| 1 | EE | Avishek Adhikari,
Somnath Sikdar:
A New (2, n)-Visual Threshold Scheme for Color Images.
INDOCRYPT 2003: 148-161 |
