✦ LIBER ✦

Parameterized complexity of generalized domination problems

✍ Scribed by Petr A. Golovach; Jan Kratochvíl; Ondřej Suchý

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parameterized complexity of constraint s

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

The Parameterized Complexity of Counting

✍ Flum, Jörg; Grohe, Martin 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 347 KB

Parameterized complexity in multiple-int

✍ Jiang, Minghui; Zhang, Yong 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 470 KB

Parameterized Complexity of Arc-Weighted

✍ Guo, Jiong; Niedermeier, Rolf; Suchý, Ondřej 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 280 KB

Parameterized approximation of dominatin

✍ Rodney G. Downey; Michael R. Fellows; Catherine McCartin; Frances Rosamond 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 217 KB

The complexity of domination problems in

✍ J.Mark Keil 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 854 KB