Neeldhara Misra

	2012
15		Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh: Planar F-Deletion: Approximation and Optimal FPT Algorithms CoRR abs/1204.4230: (2012)
	2011
14		Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh: On Parameterized Independent Feedback Vertex Set. COCOON 2011: 98-109
13		S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh: Algorithmic Aspects of Dominator Colorings in Graphs. IWOCA 2011: 19-30
12		Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh: Hitting forbidden minors: Approximation and Kernelization. STACS 2011: 189-200
11		Neeldhara Misra, Venkatesh Raman, Saket Saurabh: Lower bounds on kernelization. Discrete Optimization 8(1): 110-128 (2011)
	2010
10		Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh: Imbalance Is Fixed Parameter Tractable. COCOON 2010: 199-208
9		Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh: The effect of girth on the kernelization complexity of Connected Dominating Set. FSTTCS 2010: 96-107
8		Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan: On the Kernelization Complexity of Colorful Motifs. IPEC 2010: 14-25
7		Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar: Solving minones-2-sat as Fast as vertex cover. MFCS 2010: 549-555
6		Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: FPT Algorithms for Connected Feedback Vertex Set. WALCOM 2010: 269-280
5		Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh: Hitting forbidden minors: Approximation and Kernelization CoRR abs/1010.1365: (2010)
	2009
4		Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: The Budgeted Unique Coverage Problem and Color-Coding. CSR 2009: 310-321
3		Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: FPT Algorithms for Connected Feedback Vertex Set CoRR abs/0909.3180: (2009)
2		Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh: The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. Theory Comput. Syst. 45(4): 822-848 (2009)
	2008
1		Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh: Graph Layout Problems Parameterized by Vertex Cover. ISAAC 2008: 294-305

Coauthor Index

1	Abhimanyu M. Ambalath	[8]
2	S. Arumugam	[13]
3	Radheshyam Balasundaram	[8]
4	K. Raja Chandrasekar	[13]
5	Michael R. Fellows (Mike Fellows)	[1] [2]
6	Fedor V. Fomin	[5] [12] [15]
7	Chintan Rao H.	[8]
8	Venkata Koppula	[8]
9	Daniel Lokshtanov	[1] [2] [5] [10] [12] [15]
10	Matthias Mnich	[2]
11	N. S. Narayanaswamy	[7]
12	Geevarghese Philip	[3] [5] [6] [8] [9] [12] [13] [14]
13	Venkatesh Raman	[3] [4] [6] [7] [9] [11] [14]
14	M. S. Ramanujan	[8]
15	Frances A. Rosamond	[1] [2]
16	Saket Saurabh	[1] [2] [3] [4] [5] [6] [9] [10] [11] [12] [13] [14] [15]
17	Bal Sri Shankar	[7]
18	Somnath Sikdar	[3] [4] [6]

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page