Solving d-SAT via Backdoors to Small Treewidth

DOI10.1137/1.9781611973730.43zbMath1372.68122OpenAlexW4241194700MaRDI QIDQ5363089

Saket Saurabh, M. S. Ramanujan, Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973730.43

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (7)

A Retrospective on (Meta) Kernelization ⋮ Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel ⋮ Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel ⋮ Backdoor Sets for CSP. ⋮ On the Parameterized Complexity of Clique Elimination Distance ⋮ Bidimensionality and Kernels ⋮ A Linear-Time Parameterized Algorithm for Node Unique Label Cover

This page was built for publication: Solving d-SAT via Backdoors to Small Treewidth