24 citations · 166 across the 22 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DM2013★ 10 cited
The probabilistic approach to limited packings in graphs
Andrei Gagarin, Vadim Zverovich
We consider (closed neighbourhood) packings and their generalization in graphs. A vertex set X in a graph G is a k-limited packing if for any vertex , $\left|N[v] \cap X…
cs.DS2013★ 24 cited
Iterative Plan Construction for the Workflow Satisfiability Problem
David Cohen, Jason Crampton, Andrei Gagarin +2
The \emph{Workflow Satisfiability Problem (WSP)} is a problem of practical interest that arises whenever tasks need to be performed by authorized users, subject to constraints defi…