First Page | Document Content | |
---|---|---|
Date: 2013-11-18 03:54:41Computational complexity theory Parameterized complexity FO | Welcome Frances Rosamond, Editor, Charles Darwin University Congratulations to award winners, graduates and new job holders. IPEC, ALGO and GROW had excellent parameterized talks and tutorials. We feature Combinatorial SAdd to Reading ListSource URL: fpt.wdfiles.comDownload Document from Source WebsiteFile Size: 583,84 KBShare Document on Facebook |
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 |