No. Title Author Year
1 Depth Lower Bounds in Stabbing Planes for Combinatorial Principles Dantchev, Stefan et al. 2022
2 Partitioning H-Free Graphs of Bounded Diameter Brause, Christoph et al. 2021
3 QCSP on Reflexive Tournaments Larose, BenoƮt et al. 2021
4 Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs Bok, Jan et al. 2020
5 Colouring H-Free Graphs of Bounded Diameter Martin, Barnaby et al. 2019
6 Resolution and the Binary Encoding of Combinatorial Principles Dantchev, Stefan et al. 2019
7 Consistency for Counting Quantifiers Madelaine, Florent R. et al. 2018
8 Disconnected Cuts in Claw-free Graphs Martin, Barnaby et al. 2018
9 Surjective H-Colouring over Reflexive Digraphs Larose, Benoit et al. 2018
10 The Complexity of Disjunctive Linear Diophantine Constraints Bodirsky, Manuel et al. 2018
11 Quantified Constraints in Twenty Seventeen Martin, Barnaby 2017
12 The Complexity of Quantified Constraints Using the Algebraic Formulation Carvalho, Catarina et al. 2017
13 Constraint Satisfaction Problems for Reducts of Homogeneous Graphs Bodirsky, Manuel et al. 2016
14 First-Order Queries on Finite Abelian Groups Bova, Simone et al. 2015
15 The complexity of positive first-order logic without equality II: The four-element case Martin, Barnaby et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 15

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI