Combining Treewidth and Backdoors for CSP

Abstract

Full Citation:

Robert Ganian, M. S. Ramanujan, Stefan Szeider. Combining Treewidth and Backdoors for CSP. 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) (Heribert Vollmer and Vall' ee), volume 66 of Leibniz International Proceedings in Informatics (LIPIcs), pages 36:1-36:17, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.

Robert Ganian

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

Stefan Szeider

Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.