38 citations · 173 across the 47 of their papers we have counts for
5 papers · 1 filter
Chinese Postman Problem on Edge-Colored Multigraphs
Gregory Gutin, Mark Jones, Bin Sheng +2
It is well-known that the Chinese postman problem on undirected and directed graphs is polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in…
Linear-Vertex Kernel for the Problem of Packing -Stars into a Graph without Long Induced Paths
Florian Barbero, Gregory Gutin, Mark Jones +2
Let integers and be fixed. Let be the set of graphs with no induced path on vertices. We study the problem of packing vertex-disjoint copies…
Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies
Jason Crampton, Naomi Farley, Gregory Gutin +1
The simple security property in an information flow policy can be enforced by encrypting data objects and distributing an appropriate secret to each user. A user derives a suitable…
Algorithms for the workflow satisfiability problem engineered for counting constraints
D. Cohen, J. Crampton, A. Gagarin +2
The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification that satisfies the constraints in the…
On the Workflow Satisfiability Problem with Class-Independent Constraints
Jason Crampton, Andrei Gagarin, Gregory Gutin +2
A workflow specification defines sets of steps and users. An authorization policy determines for each user a subset of steps the user is allowed to perform. Other security requirem…