
Valued Authorization Policy Existence Problem: Theory and Experiments
Recent work has shown that many problems of satisfiability and resilienc...
read it

Solving the Workflow Satisfiability Problem using General Purpose Solvers
The workflow satisfiability problem (WSP) is a wellstudied problem in a...
read it

Perfect Forests in Graphs and Their Extensions
Let G be a graph on n vertices. For i∈{0,1} and a connected graph G, a s...
read it

Towards Better Understanding of User Authorization Query Problem via Multivariable Complexity Analysis
User authorization queries in the context of rolebased access control h...
read it

Lower Bounds for Maximum Weighted Cut
While there have been many results on lower bounds for Max Cut in unweig...
read it

Kings in Multipartite Hypertournaments
In his paper "Kings in Bipartite Hypertournaments" (Graphs & Combinatori...
read it

pEdge/VertexConnected Vertex Cover: Parameterized and Approximation Algorithms
We introduce and study two natural generalizations of the Connected Vert...
read it

Approximation algorithms for general cluster routing problem
Graph routing problems have been investigated extensively in operations ...
read it

Proximity and Remoteness in Directed and Undirected Graphs
Let D be a strongly connected digraph. The average distance σ̅(v) of a v...
read it

Parameterized Precoloring Extension and List Coloring Problems
Golovach, Paulusma and Song (Inf. Comput. 2014) asked to determine the p...
read it

Arcdisjoint in and outbranchings rooted at the same vertex in compositions of digraphs
A digraph D=(V, A) has a good pair at a vertex r if D has a pair of arc...
read it

Bounded and Approximate Strong Satisfiability in Workflows
There has been a considerable amount of interest in recent years in the ...
read it

Arcdisjoint Strong Spanning Subdigraphs of Semicomplete Compositions
A strong arc decomposition of a digraph D=(V,A) is a decomposition of it...
read it

Arcdisjoint strong spanning subdigraphs in compositions and products of digraphs
A digraph D=(V,A) has a good decomposition if A has two disjoint sets A_...
read it

Strong Subgraph Connectivity of Digraphs: A Survey
In this survey we overview known results on the strong subgraph kconnec...
read it

On rSimple kPath and Related Problems Parameterized by k/r
Abasi et al. (2014) and Gabizon et al. (2015) studied the following prob...
read it

Strong subgraph karcconnectivity
Two previous papers, arXiv:1803.00284 and arXiv:1803.00281, introduced a...
read it

Lower and Upper Bound for Computing the Size of All Second Neighbourhoods
We consider the problem of computing the size of each rneighbourhood fo...
read it

Alternative parameterizations of Metric Dimension
A set of vertices W in a graph G is called resolving if for any two dist...
read it

Strong Subgraph kconnectivity
Generalized connectivity introduced by Hager (1985) has been studied ext...
read it

Strong subgraph kconnectivity bounds
Let D=(V,A) be a digraph of order n, S a subset of V of size k and 2< k≤...
read it

Searching for Maximum OutDegree Vertices in Tournaments
A vertex x in a tournament T is called a king if for every vertex y of T...
read it
Gregory Gutin
is this you? claim profile