✦ LIBER ✦

On the complexity of some colorful problems parameterized by treewidth

✍ Scribed by Michael R. Fellows; Fedor V. Fomin; Daniel Lokshtanov; Frances Rosamond; Saket Saurabh; Stefan Szeider; Carsten Thomassen

Book ID: 113641959
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 357 KB
Volume: 209
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2010.11.026

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the parameterized complexity of the M

On the parameterized complexity of the Multi-MCT and Multi-MCST problems

✍ Wenbin Chen; Matthew C. Schmidt; Nagiza F. Samatova 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 244 KB

On the complexity of some data analysis

On the complexity of some data analysis problems

✍ A. V. Kel’manov 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 236 KB

On the complexity of some cluster analys

On the complexity of some cluster analysis problems

✍ A. V. Kel’manov 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 290 KB

On the complexity of some coding problem

On the complexity of some coding problems (Corresp.)

✍ Ntafos, S.; Hakimi, S. 📂 Article 📅 1981 🏛 IEEE 🌐 English ⚖ 546 KB

On the Complexity of Some Enumeration Pr

On the Complexity of Some Enumeration Problems for Matroids

✍ Khachiyan, L.; Boros, E.; Elbassioni, K.; Gurvich, V.; Makino, K. 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 258 KB

On the complexity of some extended word

On the complexity of some extended word problems defined by cancellation rules

✍ Michèle Benois; Jacques Sakarovitch 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 486 KB