Search Results for author: Gregory Gutin

Found 9 papers, 0 papers with code

Bi-objective Optimization in Role Mining

no code implementations25 Mar 2024 Jason Crampton, Eduard Eiben, Gregory Gutin, Daniel Karapetyan, Diptapriyo Majumdar

We show that the Pareto front of this bi-objective optimization problem (BO-GNRM) can be computed in fixed-parameter tractable time with parameter $\bar{r}+\bar{k}$.

Relation

Some coordination problems are harder than others

no code implementations6 Nov 2023 Argyrios Deligkas, Eduard Eiben, Gregory Gutin, Philip R. Neary, Anders Yeo

Objectives (i) and (iii) are tractable problems in pure coordination games, but for anti-coordination games are NP-hard.

(1,1)-Cluster Editing is Polynomial-time Solvable

no code implementations14 Oct 2022 Gregory Gutin, Anders Yeo

A graph $H$ is a clique graph if $H$ is a vertex-disjoin union of cliques.

Finding all stable matchings with assignment constraints

no code implementations8 Apr 2022 Gregory Gutin, Philip R. Neary, Anders Yeo

In this paper we consider stable matchings that are subject to assignment constraints.

Solving the Workflow Satisfiability Problem using General Purpose Solvers

no code implementations7 May 2021 Daniel Karapetyan, Gregory Gutin

The workflow satisfiability problem (WSP) is a well-studied problem in access control seeking allocation of authorised users to every step of the workflow, subject to workflow specification constraints.

The smallest number of vertices in a 2-arc-strong digraph which has no good pair

no code implementations7 Dec 2020 Ran Gu, Gregory Gutin, Shasha Li, Yongtang Shi, Zhenyu Taoqiu

They also proved that every digraph on at most 6 vertices and arc-connectivity at least 2 has a good pair and gave an example of a 2-arc-strong digraph $D$ on 10 vertices with independence number 4 that has no good pair.

Combinatorics

Public goods in networks with constraints on sharing

no code implementations5 May 2019 Stefanie Gerke, Gregory Gutin, Sung-Ha Hwang, Philip Neary

This paper considers incentives to provide goods that are partially shareable along social links.

Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints

no code implementations19 Apr 2016 Daniel Karapetyan, Andrew J. Parkes, Gregory Gutin, Andrei Gagarin

We also introduce new pseudo-Boolean (PB) and Constraint Satisfaction (CSP) formulations of the WSP with UI constraints which efficiently exploit this new decomposition of the problem and raise the novel issue of how to use general-purpose solvers to tackle FPT problems in a fashion that meets FPT efficiency expectations.

Cannot find the paper you are looking for? You can Submit a new open access paper.