Kernelization - PDFSEARCH.IO - Document Search Engine

Kernelization
Results: 67

#	Item
31	PDF Document Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-01-31 16:33:06 NP-complete problems Analysis of algorithms Parameterized complexity Dominating set Kernelization Vertex cover Path decomposition Tree decomposition Time complexity Theoretical computer science Computational complexity theory Graph theory
32	PDF Document Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-02-01 22:06:56 Parameterized complexity Kernelization Computational complexity theory Polynomial Theoretical computer science Analysis of algorithms Applied mathematics
33	Preprint. To appear in Algorithmica. DOIs00453 – Online available. On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion Nadja Betzler1 · Hans L. Bodlaender · Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-10-16 08:46:15 NP-complete problems Graph operations Analysis of algorithms Parameterized complexity Feedback vertex set Tree decomposition Vertex cover Dominating set Kernelization Graph theory Theoretical computer science Mathematics
34	Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges Robert Bredereck1 , Jiehua Chen1 , Piotr Faliszewski2 , Jiong Guo3 , Rolf Niedermeier1 , and Gerhard J. Woeginger4 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-12-01 07:16:49 Analysis of algorithms NP-complete problems Complexity classes Parameterized complexity Kernelization Vertex cover Time complexity Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
35	Journal of Artificial Intelligence Research446 Submitted 12/13; published 6/14 A Multivariate Complexity Analysis of Lobbying in Multiple Referenda Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-06-16 17:55:22 Complexity classes NP-complete problems Analysis of algorithms Mathematical optimization Parameterized complexity NP-hard Kernelization NP P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
36	Multivariate Algorithmics for NP-Hard String Problems Laurent Bulteau∗ Falk Hüffner† Christian Komusiewicz Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-01-11 10:59:55 NP-complete problems Complexity classes Analysis of algorithms String Closest string Parameterized complexity Kernelization Time complexity Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
37	A Refined Complexity Analysis of Degree Anonymization on Graphs Sepp Hartung1 , Andr´e Nichterlein1 , Rolf Niedermeier1 , and Ondˇrej Such´ y2 1 Institut f¨ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-05-03 04:36:19 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Degeneracy Graph Degree Vertex Neighbourhood Graph theory Theoretical computer science Mathematics
38	Noname manuscript No. (will be inserted by the editor) On Tractable Cases of Target Set Selection Andr´ Add to Reading List Source URL: www.akt.tu-berlin.de Language: English - Date: 2012-06-07 13:36:43 NP-complete problems Vertex cover Kernelization Feedback vertex set Clique Dominating set Tree decomposition Graph Vertex Graph theory Theoretical computer science Mathematics
39	A Refined Complexity Analysis of Degree Anonymization in GraphsI Sepp Hartunga , Andr´e Nichterleina , Rolf Niedermeiera , Ondˇrej Such´ yb a Institut Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-09-29 07:15:40 NP-complete problems Kernelization Graph coloring Clique Independent set Degree Neighbourhood Degeneracy Parameterized complexity Graph theory Theoretical computer science Mathematics
40	Effective and Efficient Data Reduction for the Subset Interconnection Design Problem? Jiehua Chen1 , Christian Komusiewicz1 , Rolf Niedermeier1 , Manuel Sorge1 , Ondˇrej Such´ y2 , and Mathias Weller3 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-10-09 05:34:13 Hypergraph Graph Vertex cover Constraint programming Kernelization Graph theory Theoretical computer science NP-complete problems

UPDATE