![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 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](https://www.pdfsearch.io/img/ef5b8733a510a45a393ca16aa292bbd0.jpg) Date: 2012-09-17 05:09:27NP-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 | | 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 awardAdd to Reading ListSource URL: fpt.wdfiles.comDownload Document from Source Website File Size: 290,79 KBShare Document on Facebook
|