37 citations · 52 across the 9 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.CC2011
Constraint Satisfaction with Counting Quantifiers
Florent Madelaine, Barnaby Martin, Juraj Stacho
We initiate the study of constraint satisfaction problems (CSPs) in the presence of counting quantifiers, which may be seen as variants of CSPs in the mould of quantified CSPs (QCS…
cs.DM2011
The vertex leafage of chordal graphs
Steven Chaplick, Juraj Stacho
Every chordal graph can be represented as the intersection graph of a collection of subtrees of a host tree, a so-called {\em tree model} of . The leafage of a con…