58 citations · 239 across the 47 of their papers we have counts for
3 papers · 1 filter
Backdoors into Heterogeneous Classes of SAT and CSP
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak +2
In this paper we extend the classical notion of strong and weak backdoor sets for SAT and CSP by allowing that different instantiations of the backdoor variables result in instance…
FO Model Checking on Posets of Bounded Width
Jakub Gajarský, Petr Hliněný, Daniel Lokshtanov +4
Over the past two decades the main focus of research into first-order (FO) model checking algorithms have been sparse relational structures-culminating in the FPT-algorithm by Groh…
First order limits of sparse graphs: Plane trees and path-width
Jakub Gajarsky, Petr Hlineny, Tomas Kaiser +5
Nesetril and Ossona de Mendez introduced the notion of first order convergence as an attempt to unify the notions of convergence for sparse and dense graphs. It is known that there…