Parameterized Algorithmics: Experimental Research
by Gregory Gutin, Daniel Karapetyan
Abstract:
In this note, we'd like to talk about a recent paper (Karapetyan, Parkes, Gutin, Gagarin, Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints, J. AI Research, 66 (2019) 85-122) which, in our view, made an important contribution to the experimental research. While the paper is on a problem in information security, some of its findings are of much wider interest. Since the paper is freely available from the JAIR website, we'll only very briefly outline some of its findings.
Reference:
Parameterized Algorithmics: Experimental Research (Gregory Gutin, Daniel Karapetyan), Parameterized Complexity News 18, 3-4, 2021.
Bibtex Entry:
@Article{Gutin2021,
author = {Gregory Gutin and Daniel Karapetyan},
journal = {Parameterized Complexity News},
title = {Parameterized Algorithmics: Experimental Research},
year = {2021},
issn = {2203-109X},
number = {1},
pages = {3-4},
volume = {18},
abstract = {In this note, we'd like to talk about a recent paper (Karapetyan, Parkes, Gutin, Gagarin, Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints, J. AI Research, 66 (2019) 85-122) which, in our view, made an important contribution to the experimental research. While the paper is on a problem in information security, some of its findings are of much wider interest. Since the paper is freely available from the JAIR website, we'll only very briefly outline some of its findings.},
comment = {[<a href="http://ssrn.com/abstract=4174198">preprint</a>]},
url = {http://fpt.wdfiles.com/local--files/fpt-news:the-parameterized-complexity-newsletter/2021March},
}