LNCSThe Lost Continent of Polynomial Time: Preprocessing and Kernelization

First Page		Document Content
Date: 2009-10-14 09:25:39 Analysis of algorithms Complexity classes Parameterized complexity Kernelization NP-complete problems Time complexity PP Polynomial NP Theoretical computer science Computational complexity theory Applied mathematics		LNCSThe Lost Continent of Polynomial Time: Preprocessing and Kernelization Add to Reading List Source URL: www.mrfellows.net Download Document from Source Website File Size: 221,68 KB Share Document on Facebook

	Lower bounds for polynomial kernelization Michal Pilipczuk Institute of Informatics, University of Warsaw, Poland Parameterized Complexity Summer School DocID: 1uKug - View Document
	Kernelization using structural parameters on sparse graph classes ˇ 1 Jan Obdržálek1 Jakub Gajarský1 Petr Hlinený 1 Sebastian Ordyniak DocID: 1unGd - View Document
	Kernelization: The basics Bart M. P. Jansen Parameterized Complexity Summer School @ Vienna September 2nd 2017, Vienna, Austria DocID: 1u4am - View Document
	Fixed-parameter tractability of multicut parameterized by the size of the cutset Dániel Marx Humboldt-Universität zu Berlin (Joint work with Igor Razgon) WorKer 2010: Workshop on Kernelization DocID: 1tUWX - View Document
	Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams Rajesh Chitnis∗ Graham Cormode† Hossein Esfandiari‡ § DocID: 1toHN - View Document