- Publications
- Influence
Share This Author
The complexity of surjective homomorphism problems - a survey
- M. Bodirsky, J. Kára, B. Martin
- MathematicsDiscret. Appl. Math.
- 27 April 2011
Tight rank lower bounds for the Sherali-Adams proof system
- Stefan S. Dantchev, B. Martin, Mark Nicholas Charles Rhodes
- MathematicsTheor. Comput. Sci.
- 1 May 2009
Parameterized Proof Complexity
- Stefan S. Dantchev, B. Martin, Stefan Szeider
- Mathematics, Computer Science48th Annual IEEE Symposium on Foundations of…
- 21 October 2007
TLDR
The computational complexity of disconnected cut and 2K2-partition
- B. Martin, D. Paulusma
- MathematicsJ. Comb. Theory, Ser. B
- 25 April 2011
The Complexity of Positive First-order Logic without Equality
- B. Martin, Jos Martin
- Mathematics24th Annual IEEE Symposium on Logic In Computer…
- 11 August 2009
TLDR
Towards a Trichotomy for Quantified H-Coloring
- B. Martin, Florent R. Madelaine
- MathematicsCiE
- 30 June 2006
TLDR
The packing chromatic number of the infinite square lattice is between 13 and 15
- B. Martin, F. Raimondi, Taolue Chen, Jos Martin
- Computer ScienceDiscret. Appl. Math.
- 8 October 2015
Discrete Temporal Constraint Satisfaction Problems
- M. Bodirsky, B. Martin, Antoine Mottet
- Computer Science, MathematicsJ. ACM
- 30 March 2015
TLDR
Containment, Equivalence and Coreness from CSP to QCSP and beyond
- Florent R. Madelaine, B. Martin
- Computer ScienceCP
- 26 April 2012
TLDR
Quantified Constraints in Twenty Seventeen
- B. Martin
- Computer ScienceThe Constraint Satisfaction Problem
- 2017
I present a survey of recent advances in the algorithmic and computational complexity theory of non-Boolean Quantified Constraint Satisfaction Problems, incorporating some more modern research…
...
...