Fingerprint
Dive into the research topics of 'Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
7
Scopus
citations