✦ LIBER ✦

Parameterized complexity of finding small degree-constrained subgraphs

✍ Scribed by Omid Amini; Ignasi Sau; Saket Saurabh

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parameterized computational complexity o

✍ Alexander Schäfer, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 231 KB

A note on the complexity of finding regu

✍ J. Plesník 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 308 KB

Parameterized complexity of connected ev

✍ Fomin, Fedor V.; Golovach, Petr A. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 923 KB

On the approximability of some degree-co

✍ Omid Amini; David Peleg; Stéphane Pérennes; Ignasi Sau; Saket Saurabh 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 389 KB

A note on degree-constrained star subgra

✍ Harold N. Gabow 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 666 KB

On the Parameterized Complexity of Findi

✍ Heggernes, Pinar; van ’t Hof, Pim; Marx, Dániel; Misra, Neeldhara; Villanger, Yn 📂 Article 📅 2014 🏛 Springer 🌐 English ⚖ 915 KB