Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT
Crossref DOI link: https://doi.org/10.1007/s00453-016-0189-9
Published Online: 2016-08-22
Published Print: 2017-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Jansen, Bart M. P.
Pieterse, Astrid http://orcid.org/0000-0003-3721-6721
Funding for this research was provided by:
“NWO Veni grant “Frontiers in Parameterized Preprocessing” (639.021.437)
“NWO Gravitation grant “Networks” (024.002.003)
License valid from 2016-08-22