Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Venkatesh Raman, Somnath Sikdar. Parameterized complexity of the induced subgraph problem in directed graphs. Inf. Process. Lett., 104(3):79-85, 2007. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: The Parameterized Complexity of the Induced Matching Problem in Planar GraphsHannes Moser, Somnath Sikdar. faw 2007: 325-336 [doi] Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect GraphsNeeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh. wg 2013: 370-381 [doi]
The following publications are possibly variants of this publication: