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 cs.CCShow all

3 papers · 1 filter

cs.CC2014

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 $G$ ( $G$ may have both edges and arcs), our aim is to find a minimum weight closed walk traversing each ed…

cs.CC2011

Parameterized Complexity of Satisfying Almost All Linear Equations over $F_{2}$

R. Crowston, G. Gutin, M. Jones +1

The problem MaxLin2 can be stated as follows. We are given a system $S$ of $m$ equations in variables $x_{1}, ..., x_{n}$ , where each equation is $\sum_{i \in I_{j}} x_{i} = b_{j}$ is assigned…

cs.CC2011★ 1 cited

Parameterized Complexity of MaxSat Above Average

Robert Crowston, Gregory Gutin, Mark Jones +2

In MaxSat, we are given a CNF formula $F$ with $n$ variables and $m$ clauses and asked to find a truth assignment satisfying the maximum number of clauses. Let $r_{1}, ..., r_{m}$ be th…

Structural Parameterizations of the Mixed Chinese Postman Problem

Parameterized Complexity of Satisfying Almost All Linear Equations over F2​

Parameterized Complexity of MaxSat Above Average

Parameterized Complexity of Satisfying Almost All Linear Equations over $F_{2}$