Parameterized complexity - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2007-02-23 12:22:01 Analysis of algorithms NP-complete problems Operations research Search algorithms Randomized algorithm Matching Graph coloring Color-coding Parameterized complexity Theoretical computer science Mathematics Computational complexity theory		Add to Reading List Source URL: faculty.cse.tamu.edu Download Document from Source Website File Size: 250,59 KB Share Document on Facebook

	Representative Families and Kernels Fahad Panolan Department of Informatics, University of Bergen, Norway Parameterized Complexity Summer School DocID: 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, Hungary DocID: 1v7gN - View Document
	Lower bounds for polynomial kernelization Michal Pilipczuk Institute of Informatics, University of Warsaw, Poland Parameterized Complexity Summer School DocID: 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 problems DocID: 1up1m - View Document