38 citations · 173 across the 47 of their papers we have counts for
5 papers · 1 filter
Parameterized and Approximation Algorithms for the Load Coloring Problem
F. Barbero, G. Gutin, M. Jones +1
Let be two positive integers and let be a graph. The -Load Coloring Problem (denoted -LCP) asks whether there is a -coloring $φ: V \rightarrow [c]…
Cryptographic Enforcement of Information Flow Policies without Public Information
Jason Crampton, Naomi Farley, Gregory Gutin +2
Cryptographic access control has been studied for over 30 years and is now a mature research topic. When symmetric cryptographic primitives are used, each protected resource is enc…
Structural Parameterizations of the Mixed Chinese Postman Problem
Gregory Gutin, Mark Jones, Magnus Wahlstrom
In the Mixed Chinese Postman Problem (MCPP), given a weighted mixed graph ( may have both edges and arcs), our aim is to find a minimum weight closed walk traversing each ed…
Parameterized Complexity of the -Arc Chinese Postman Problem
Gregory Gutin, Mark Jones, Bin Sheng
In the Mixed Chinese Postman Problem (MCPP), given an edge-weighted mixed graph ( may have both edges and arcs), our aim is to find a minimum weight closed walk traversing e…
Parameterized Directed -Chinese Postman Problem and Arc-Disjoint Cycles Problem on Euler Digraphs
Gregory Gutin, Mark Jones, Bin Sheng +1
In the Directed -Chinese Postman Problem (-DCPP), we are given a connected weighted digraph and asked to find non-empty closed directed walks covering all arcs of …