24 citations · 166 across the 22 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014★ 5 cited
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem
Daniel Karapetyan, Andrei Gagarin, Gregory Gutin
The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorised users to the steps in a workflow specification, subject to certain constraints on th…
cs.DM2014★ 1 cited
Bounds and algorithms for limited packings in graphs
Andrei Gagarin, Vadim Zverovich
We consider (closed neighbourhood) packings and their generalization in graphs called limited packings. A vertex set X in a graph G is a k-limited packing if for any vertex $v\in V…