<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2014-10-14 03:31:39Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity Michael Fellows Kernelization Clique problem Vertex cover Path decomposition Theoretical computer science Computational complexity theory Applied mathematics |
Add to Reading List |
k Newsletter of the Parameterized Complexity Community fpt.wikidot.com www.fpt.wikidot.com | Representative Families and Kernels Fahad Panolan Department of Informatics, University of Bergen, Norway Parameterized Complexity Summer SchoolDocID: 1vk0H - View Document |
| Some open problems in parameterized complexity Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, HungaryDocID: 1v7gN - View Document |
| Lower bounds for polynomial kernelization Michal Pilipczuk Institute of Informatics, University of Warsaw, Poland Parameterized Complexity Summer SchoolDocID: 1uKug - View Document |
| Discrete Applied Mathematics – 429 www.elsevier.com/locate/dam Parameterized complexity of vertex colouring Leizhen Cai ∗DocID: 1uqiK - View Document |
| Parameterized complexity of even/odd subgraph problemsDocID: 1up1m - View Document |