Kernelization - PDFSEARCH.IO - Document Search Engine

Kernelization
Results: 67

#	Item
11	Proc. 9th LATIN, 2010 Average Parameterization and Partial Kernelization for Computing Medians Nadja Betzler1⋆ , Jiong Guo2⋆⋆ , Christian Komusiewicz1⋆ ⋆ ⋆ , and Rolf Niedermeier1 Add to Reading List Source URL: theinf1.informatik.uni-jena.de Language: English - Date: 2010-01-06 05:59:54
12	BRICS Basic Research in Computer Science BRICS RS-01-7 Gutin et al.: On the Number of Quasi-Kernels in Digraphs Add to Reading List Source URL: www.brics.dk Language: English - Date: 2001-02-27 07:32:09 Kernelization Directed graph Hilbert space Mathematics
13	Parameterized Complexity News The Newsletter of the Parameterized Complexity Community fpt.wikidot.com May 2009 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 05:57:59 NP-complete problems Analysis of algorithms Graph coloring Parameterized complexity Complexity classes Kernelization Time complexity Clique problem Vertex cover Theoretical computer science Computational complexity theory Graph theory
14	Parameterized Complexity News The Newsletter of the Parameterized Complexity Community Volume 4, AprilWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 05:58:10 NP-complete problems Analysis of algorithms Parameterized complexity Complexity classes Kernelization Dominating set Feedback vertex set Michael Fellows Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
15	The Computer Journal Special Issue on Parameterized Complexity: Foreward by the Guest Editors Rodney G. Downey Victoria University Wellington, New Zealand Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-06 03:04:07 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Kernelization Bidimensionality Dominating set Exponential time hypothesis Feedback vertex set Theoretical computer science Computational complexity theory Applied mathematics
16	LNCSThe Lost Continent of Polynomial Time: Preprocessing and Kernelization Add to Reading List Source URL: www.mrfellows.net Language: English - 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
17	Open Problems in Parameterized and Exact Computation — IWPEC 2008 Hans L. Bodlaender Erik D. Demaine Michael R. Fellows Jiong Guo Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:04:12 NP-complete problems Parameterized complexity Kernelization Path decomposition Clique Tree decomposition Vertex cover Dominating set Edge coloring Graph theory Theoretical computer science Mathematics
18	LNCSA Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:26:19 Analysis of algorithms NP-complete problems Parameterized complexity Kernelization Dominating set Time complexity Algorithm Mathematical optimization NP Theoretical computer science Computational complexity theory Applied mathematics
19	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 1, MayWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:15:19 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Feedback vertex set Graph coloring Vertex cover Dominating set Time complexity Theoretical computer science Computational complexity theory Applied mathematics
20	URL: http://www.elsevier.nl/locate/entcs/volume61.html 19 pages Parameterized Complexity: The Main Ideas and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:10:30 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Dominating set Kernelization Vertex cover Clique problem NP-complete Theoretical computer science Computational complexity theory Applied mathematics

UPDATE