Kernelization - PDFSEARCH.IO - Document Search Engine

Kernelization
Results: 67

#	Item
51	IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. XX, NO. X, JANUARY 201X 1 Partitioning Biological Networks into Highly Connected Clusters Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-01-08 11:56:00 NP-complete problems Degeneracy Vertex cover Kernelization Neighbourhood Clique Graph operations Connectivity Tree Graph theory Mathematics Theoretical computer science
52	A Multivariate Complexity Analysis of Lobbying in Multiple Referenda Robert Bredereck∗ , Jiehua Chen† , Sepp Hartung, Rolf Niedermeier and Ondˇrej Such´y‡ Stefan Kratsch Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-05-07 11:13:53 Complexity classes Parameterized complexity Mathematical optimization Matrix Kernelization NP Rank 2-satisfiability Theoretical computer science Computational complexity theory Applied mathematics
53	k Newsletter of the Parameterized Complexity Community fpt.wikidot.com www.fpt.wikidot.com Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2014-06-09 11:30:44 Computational complexity theory Parameterized complexity Analysis of algorithms Michael Fellows Kernelization Outerplanar graph Clique Connectivity Tree decomposition Graph theory Theoretical computer science Mathematics
54	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:49 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory
55	Incremental List Coloring of Graphs, Parameterized by Conservation2 Sepp Hartung and Rolf Niedermeier TU Berlin Institut f¨ ur Softwaretechnik und Theoretische Informatik Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-02-01 23:13:02 Graph coloring NP-complete problems Analysis of algorithms Parameterized complexity List coloring Graph Travelling salesman problem Kernelization Edge coloring Graph theory Theoretical computer science Mathematics
56	Welcome • September 10th (Fri) – Final version due Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter. Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:19:59 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Kernelization Bidimensionality Feedback vertex set Dominating set Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
57	Newsletter of the PC Community NovemberWelcome Bergen Algorithmics Wins Big Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:47:38 NP-complete problems Analysis of algorithms Parameterized complexity Graph operations Graph coloring Bidimensionality Kernelization Clique Dominating set Theoretical computer science Graph theory Computational complexity theory
58	A Linear Kernel for the Complementary Maximal Strip Recovery Problem Binhai Zhu Computer Science Department Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2012-12-29 15:19:34 Analysis of algorithms Parameterized complexity NP-complete problems Kernelization Time complexity Vertex cover Algorithm Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
59	Newsletter of the PC Community November 2011 Welcome Frances Rosamond, Editor Congratulations to Serge Gaspers and Mohammad Taghi Hajiaghayi for multiple awards, to Yoichi Iwata for the IPEC Excellent Student Paper award Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:09:27 NP-complete problems Parameterized complexity Kernelization NP-complete Bidimensionality Dominating set Clique problem Feedback vertex set Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
60	A quick summary of the field of Parameterized Complexity, 2012 Overview Parameterized Complexity is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-22 20:37:29 Analysis of algorithms Parameterized complexity Michael Fellows Kernelization Bidimensionality Exponential time hypothesis Time complexity Complexity FO Theoretical computer science Computational complexity theory Applied mathematics

UPDATE