37 citations · 52 across the 9 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.LO2013
Constraint Satisfaction with Counting Quantifiers 2
Barnaby Martin, Juraj Stacho
We study constraint satisfaction problems (CSPs) in the presence of counting quantifiers , asserting the existence of distinct witnesses for the variable in q…
math.CO2013★ 4 cited
On edge-sets of bicliques in graphs
Marina Groshaus, Pavol Hell, Juraj Stacho
A biclique is a maximal induced complete bipartite subgraph of a graph. We investigate the intersection structure of edge-sets of bicliques in a graph. Specifically, we study the a…