activity
20102025
most citedPattern Backtracking Algorithm for the Workflow Satisfiability Problem

5 citations · 11 across the 25 of their papers we have counts for

collaborators
Showing cs.DSShow all

6 papers · 1 filter

cs.DS2023

Acceleration for Timing-Aware Gate-Level Logic Simulation with One-Pass GPU Parallelism

Weijie Fang, Yanggeng Fu, Jiaquan Gao +3

Witnessing the advancing scale and complexity of chip design and benefiting from high-performance computation technologies, the simulation of Very Large Scale Integration (VLSI) Ci…

cs.DS2015

Valued Workflow Satisfiability Problem

Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan

A workflow is a collection of steps that must be executed in some specific order to achieve an objective. A computerised workflow management system may enforce authorisation polici…

cs.DS20145 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.DS2014

Parameterized TSP: Beating the Average

Gregory Gutin, Viresh Patel

In the Travelling Salesman Problem (TSP), we are given a complete graph together with an integer weighting on the edges of , and we are asked to find a Hamilton cycl…

cs.DS2010

Note on Maximal Bisection above Tight Lower Bound

Gregory Gutin, Anders Yeo

In a graph , a bisection is a partition of into sets and such that . The size of is the number of edges between and $Y…

cs.DS20103 cited

All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Kernels with Quadratic Numbers of Variables

Gregory Gutin, Leo van Iersel, Matthias Mnich +1

A ternary Permutation-CSP is specified by a subset of the symmetric group . An instance of such a problem consists of a set of variables and a multiset of con…