no code implementations • 25 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}$.
no code implementations • 6 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.
no code implementations • 14 Oct 2022 • Gregory Gutin, Anders Yeo
A graph $H$ is a clique graph if $H$ is a vertex-disjoin union of cliques.
no code implementations • 8 Apr 2022 • Gregory Gutin, Philip R. Neary, Anders Yeo
In this paper we consider stable matchings that are subject to assignment constraints.
no code implementations • 7 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.
no code implementations • 7 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
no code implementations • 6 May 2020 • Gregory Gutin, Tomohiro Hirano, Sung-Ha Hwang, Philip R. Neary, Alexis Akira Toda
How does social distancing affect the reach of an epidemic in social networks?
no code implementations • 5 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.
no code implementations • 19 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.