No. Title Author Year
1 Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs Bok, Jan et al. 2020
2 Colouring H-Free Graphs of Bounded Diameter Martin, Barnaby et al. 2019
3 Resolution and the Binary Encoding of Combinatorial Principles Dantchev, Stefan et al. 2019
4 Consistency for Counting Quantifiers Madelaine, Florent R. et al. 2018
5 Disconnected Cuts in Claw-free Graphs Martin, Barnaby et al. 2018
6 Surjective H-Colouring over Reflexive Digraphs Larose, Benoit et al. 2018
7 The Complexity of Disjunctive Linear Diophantine Constraints Bodirsky, Manuel et al. 2018
8 Quantified Constraints in Twenty Seventeen Martin, Barnaby 2017
9 The Complexity of Quantified Constraints Using the Algebraic Formulation Carvalho, Catarina et al. 2017
10 Constraint Satisfaction Problems for Reducts of Homogeneous Graphs Bodirsky, Manuel et al. 2016
11 First-Order Queries on Finite Abelian Groups Bova, Simone et al. 2015
12 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: 12


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