Solving SAT via Treewidth Backdoors in Linear Time: Beyond Sparsity

Abstract

Full Citation:

Jan Dreier, Robert Ganian, Marlene Gründel, Roohani Sharma, Simon Wietheger. Solving SAT via Treewidth Backdoors in Linear Time: Beyond Sparsity. Proceedings of the 2027 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2027. (Note: to appear)

Jan Niclas Dreier

Jan Niclas Dreier was a Postdoctoral Researcher at the Algorithms and Complexity Group.

Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.

Marlene Gründel

Marlene Gründel is a Project Assistant at the Algorithms and Complexity Group.

Simon Wietheger

Simon Wietheger is a Project Assistant at the Algorithms and Complexity Group.