By Professor Serge Gaspers

Book Chapters

Gaspers S; Ordyniak S; Szeider S, 2017, 'Backdoor Sets for CSP', in Krokhin AA; Zivný S (ed.), The Constraint Satisfaction Problem: Complexity and Approximability, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 137 - 157, http://dx.doi.org/10.4230/dfu.vol7.15301.5

Gaspers S; Walsh T, 2017, 'Preface', in Theory and Applications of Satisfiability Testing – SAT 2017, Springer International Publishing, pp. V - VIII

Gaspers S, 2016, 'Backdoors to SAT.', in Encyclopedia of Algorithms, Springer Science & Business Media, pp. 167 - 170, http://dx.doi.org/10.1007/978-1-4939-2864-4_781

Gaspers S, 2015, 'Backdoors to SAT', in Encyclopedia of Algorithms, Springer Berlin Heidelberg, pp. 1 - 5, http://dx.doi.org/10.1007/978-3-642-27848-8_781-1

Gaspers S; Szeider S, 2012, 'Backdoors to Satisfaction', in Bodlaender HL; Downey R; Fomin FV; Marx D (ed.), The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday, Springer, Berlin, pp. 287 - 317, http://dx.doi.org/10.1007/978-3-642-30891-8_15

Fellows MR; Gaspers S; Rosamond FA, 2011, 'Multivariate Complexity Theory', in Blum EK; Aho AV (ed.), Computer Science: The Hardware, Software and Heart of It, Springer, New York, pp. 269 - 293, http://dx.doi.org/10.1007/978-1-4614-1168-0_13

Back to profile page