k Newsletter of the Parameterized Complexity Community fpt.wikidot.com www.fpt.wikidot.com

First Page		Document Content
Date: 2014-06-09 11:30:44 Computational complexity theory Parameterized complexity Analysis of algorithms Michael Fellows Kernelization Outerplanar graph Clique Connectivity Tree decomposition Graph theory Theoretical computer science Mathematics		k Newsletter of the Parameterized Complexity Community fpt.wikidot.com www.fpt.wikidot.com Add to Reading List Source URL: fpt.wdfiles.com Download Document from Source Website File Size: 649,67 KB Share Document on Facebook

	2015 IRTS SUMMER FELLOWS Andreea Arama Queens College The IRTS Michael Brochstein/Queens College Fellow - Sponsored by Bruce Lefkowitz Andreea Arama is a rising senior at the Macaulay Honors College at Queens College, ma DocID: 1sreN - View Document
	Two Students Named Recipients of ACM/IEEE-CS George Michael Memorial HPC Fellowships NEW YORK, NY & LOS ALAMITOS, Calif., August 5, Maciej Besta of ETH Zurich and Dhairya Malhotra of the University of Texas at Au DocID: 1rxIy - View Document
	Top 50 authors in computer science Author Michael I. Jordan Andrew Y. Ng Andrew Zisserman DocID: 1rll2 - View Document
	Microsoft Word - Newsletter CASEdoc DocID: 1rjrs - View Document
	Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office DocID: 1r8ab - View Document