Gregory Gutin

activity

20102015

most citedAlgorithms for the workflow satisfiability problem engineered for counting constraints

19 citations · 22 across the 9 of their papers we have counts for

collaborators

Showing 2010Show all

2 papers · 1 filter

cs.DS2010

Note on Maximal Bisection above Tight Lower Bound

Gregory Gutin, Anders Yeo

In a graph $G = (V, E)$ , a bisection $(X, Y)$ is a partition of $V$ into sets $X$ and $Y$ such that $∣ X ∣ \leq ∣ Y ∣ \leq ∣ X ∣ + 1$ . The size of $(X, Y)$ is the number of edges between $X$ and $Y…

cs.DS2010★ 3 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 $S_{3}$ . An instance of such a problem consists of a set of variables $V$ and a multiset of con…