Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Diptapriyo Majumdar"'
Publikováno v:
Algorithms, Vol 16, Iss 3, p 144 (2023)
In parameterized complexity, it is well-known that a parameterized problem is fixed-parameter tractable if and only if it has a kernel—an instance equivalent to the input instance, whose size is just a function of the parameter. The size of the ker
Externí odkaz:
https://doaj.org/article/70cad170ef9140329416ef82af118d1c
Publikováno v:
Proceedings of the 27th ACM on Symposium on Access Control Models and Technologies.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90e27094b65b91e482c1c662f19663de
https://doi.org/10.1145/3532105.3535024
https://doi.org/10.1145/3532105.3535024
Publikováno v:
Theory of Computing Systems. 65:515-540
Set Cover is one of the well-known classical NP-hard problems. We study the conflict-free version of the Set Cover problem. Here we have a universe $\mathcal {U}$ , a family $\mathcal {F}$ of subsets of $\mathcal {U}$ and a graph $G_{\mathcal {F}}$ o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df51f2579b9ed0811ca2324b99d6505d
https://doi.org/10.1007/s00224-020-10022-9
https://doi.org/10.1007/s00224-020-10022-9
Let $\Pi$ be a hereditary graph class. The problem of deletion to $\Pi$, takes as input a graph $G$ and asks for a minimum number (or a fixed integer $k$) of vertices to be deleted from $G$ so that the resulting graph belongs to $\Pi$. This is a well
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1da24633c218cdce15db311659dabbe
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783031159138
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eef5d19d6fcdde315f1bac8ab97ccb73
https://doi.org/10.1007/978-3-031-15914-5_15
https://doi.org/10.1007/978-3-031-15914-5_15
Recent work has shown that many problems of satisfiability and resiliency in workflows may be viewed as special cases of the authorization policy existence problem (APEP), which returns an authorization policy if one exists and 'No' otherwise. Howeve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b917ca62826219dc7bf16b296431b1a
http://arxiv.org/abs/2106.05761
http://arxiv.org/abs/2106.05761
User authorization queries in the context of role-based access control have attracted considerable interest in the last 15 years. Such queries are used to determine whether it is possible to allocate a set of roles to a user that enables the user to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::517f1186b8a4ce875ca1123c16e671b1
http://arxiv.org/abs/2104.05983
http://arxiv.org/abs/2104.05983
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030895426
COCOON
COCOON
We study a constrained version of the Geometric Hitting Set problem where we are given a set of points, partitioned into disjoint subsets, and a set of intervals. The objective is to hit all the intervals with a minimum number of points such that if
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af40103be35f62ba2c8e6875f98ac469
https://doi.org/10.1007/978-3-030-89543-3_50
https://doi.org/10.1007/978-3-030-89543-3_50
Publikováno v:
Fundamentals of Computation Theory ISBN: 9783030865924
FCT
FCT
Let \(\varPi \) be a hereditary graph class. The problem of deletion to \(\varPi \), takes as input a graph G and asks for a minimum number (or a fixed integer k) of vertices to be deleted from G so that the resulting graph belongs to \(\varPi \). Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87235d23e022deeca4b22904f894c521
https://doi.org/10.1007/978-3-030-86593-1_22
https://doi.org/10.1007/978-3-030-86593-1_22
We introduce and study two natural generalizations of the Connected VertexCover (VC) problem: the $p$-Edge-Connected and $p$-Vertex-Connected VC problem (where $p \geq 2$ is a fixed integer). Like Connected VC, both new VC problems are FPT, but do no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fe69d19439ddaf93174d4c22e7f2b26c