✦ LIBER ✦

The Parameterized Complexity of Stabbing Rectangles

✍ Scribed by Michael Dom; Michael R. Fellows; Frances A. Rosamond; Somnath Sikdar

Publisher: Springer
Year: 2010
Tongue: English
Weight: 951 KB
Volume: 62
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-010-9471-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parameterized complexity and inapproxima

Parameterized complexity and inapproximability of

✍ Chunmei Liu; Yinglei Song 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 501 KB

The Turing way to parameterized complexi

The Turing way to parameterized complexity

✍ Marco Cesati 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 280 KB

We propose a general proof technique based on the Turing machine halting problem that allows us to establish membership results for the classes W[1], W[2], and W[P]. Using this technique, we prove that Perfect Code belongs to W[1], Steiner Tree belongs to W[2], and a-Balanced Separator, Maximal Irre

Parameterized Complexity of Vertex Cover

Parameterized Complexity of Vertex Cover Variants

✍ Jiong Guo; Rolf Niedermeier; Sebastian Wernicke 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 276 KB

Parameterized complexity of constraint s

Parameterized complexity of constraint satisfaction problems

✍ Dániel Marx 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 285 KB

On the Parameterized Complexity of Layer

On the Parameterized Complexity of Layered Graph Drawing

✍ Vida Dujmović; Michael R. Fellows; Matthew Kitching; Giuseppe Liotta; Catherine 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 537 KB

On the parameterized complexity of short

On the parameterized complexity of short computation and factorization

✍ Liming Cai; Jianer Chen; Rodney G. Downey; Michael R. Fellows 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 169 KB