Somnath Sikdar

	2009
17		Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: The Budgeted Unique Coverage Problem and Color-Coding. CSR 2009: 310-321
16		Geevarghese Philip, Venkatesh Raman, Somnath Sikdar: Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. ESA 2009: 694-705
15		Daniel Lokshtanov, Saket Saurabh, Somnath Sikdar: Simpler Parameterized Algorithm for OCT. IWOCA 2009: 380-384
14		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)
13		Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: FPT Algorithms for Connected Feedback Vertex Set CoRR abs/0909.3180: (2009)
12		Hannes Moser, Somnath Sikdar: The parameterized complexity of the induced matching problem. Discrete Applied Mathematics 157(4): 715-727 (2009)
11		Meena Mahajan, Venkatesh Raman, Somnath Sikdar: Parameterizing above or below guaranteed values. J. Comput. Syst. Sci. 75(2): 137-153 (2009)
	2008
10		Michael Dom, Somnath Sikdar: The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants. FAW 2008: 288-299
9		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		Hannes Moser, Somnath Sikdar: The Parameterized Complexity of the Induced Matching Problem in Planar Graphs. FAW 2007: 325-336
7		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		Hannes Moser, Venkatesh Raman, Somnath Sikdar: The Parameterized Complexity of the Unique Coverage Problem. ISAAC 2007: 621-631
5		Venkatesh Raman, Somnath Sikdar: Parameterized complexity of the induced subgraph problem in directed graphs. Inf. Process. Lett. 104(3): 79-85 (2007)
4		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		Meena Mahajan, Venkatesh Raman, Somnath Sikdar: Parameterizing MAX SNP Problems Above Guaranteed Values. IWPEC 2006: 38-49
	2005
2		Venkatesh Raman, Saket Saurabh, Somnath Sikdar: Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. ICTCS 2005: 375-389
	2003
1		Avishek Adhikari, Somnath Sikdar: A New (2, n)-Visual Threshold Scheme for Color Images. INDOCRYPT 2003: 148-161

Coauthor Index

1	Avishek Adhikari	[1]
2	Michael Dom	[10]
3	Daniel Lokshtanov	[15]
4	Meena Mahajan	[3] [11]
5	Sounaka Mishra	[7] [9]
6	Neeldhara Misra	[13] [17]
7	Hannes Moser	[6] [8] [12]
8	Geevarghese Philip	[13] [14] [16]
9	Venkatesh Raman	[2] [3] [4] [5] [6] [7] [9] [11] [13] [14] [16] [17]
10	Saket Saurabh	[2] [4] [7] [9] [13] [15] [17]
11	C. R. Subramanian	[7]

Colors in the list of coauthors