Mark Jones

activity

20092023

most citedSystems of Linear Equations over

F_{2}

and Problems Parameterized Above Average

38 citations · 173 across the 47 of their papers we have counts for

collaborators

Showing 2015 · cs.DSShow all

3 papers · 2 filters

cs.DS2015★ 2 cited

Chinese Postman Problem on Edge-Colored Multigraphs

Gregory Gutin, Mark Jones, Bin Sheng +2

It is well-known that the Chinese postman problem on undirected and directed graphs is polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in…

cs.DS2015

Linear-Vertex Kernel for the Problem of Packing $r$ -Stars into a Graph without Long Induced Paths

Florian Barbero, Gregory Gutin, Mark Jones +2

Let integers $r \geq 2$ and $d \geq 3$ be fixed. Let $G_{d}$ be the set of graphs with no induced path on $d$ vertices. We study the problem of packing $k$ vertex-disjoint copies…

cs.DS2015★ 19 cited

Algorithms for the workflow satisfiability problem engineered for counting constraints

D. Cohen, J. Crampton, A. Gagarin +2

The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification that satisfies the constraints in the…

Chinese Postman Problem on Edge-Colored Multigraphs

Linear-Vertex Kernel for the Problem of Packing r-Stars into a Graph without Long Induced Paths

Algorithms for the workflow satisfiability problem engineered for counting constraints

Linear-Vertex Kernel for the Problem of Packing $r$ -Stars into a Graph without Long Induced Paths