Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1

First Page		Document Content
Date: 2012-09-21 09:31:02 Graph operations Path decomposition Clique Kernelization Vertex cover Parameterized complexity Tree decomposition Feedback vertex set Dominating set Graph theory Theoretical computer science NP-complete problems		Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Download Document from Source Website File Size: 416,29 KB Share Document on Facebook

	Ecology, 87(9), 2006, pp. 2288–2297 Ó 2006 by the Ecological Society of America TREE SPECIES EFFECTS ON DECOMPOSITION AND FOREST FLOOR DYNAMICS IN A COMMON GARDEN SARAH E. HOBBIE,1,4 PETER B. REICH,2 JACEK OLEKSYN,2,3 DocID: 1v1QH - View Document
	Foliar litter decomposition of four dominant tree species of Hollongapar Gibbon Wildlife Sanctuary, Assam, northeast India Authors: Moumita Sarkar, Ashalata Devi* and Monoranjan Nath Moumita Sarkar Affiliation: Research DocID: 1sBfs - View Document
	Brief Announcement: Tree Decomposition for Faster Concurrent Data Structures Johannes Schneider Roger Wattenhofer DocID: 1snsS - View Document
	Characterizing Graphs of Small Carving-Width R´emy Belmonte1? , Pim van ’t Hof1? , Marcin Kami´ nski3 , 2?? 4? ? ? Dani¨el Paulusma , and Dimitrios M. Thilikos DocID: 1rq3s - View Document
	Reasoning about XML Update Constraints∗ Bogdan Cautis Serge Abiteboul INRIA Futurs & U. Paris Sud DocID: 1rjFm - View Document