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 2011 · cs.DSShow all

3 papers · 2 filters

cs.DS2011

Max-Cut Parameterized Above the Edwards-Erdős Bound

Robert Crowston, Mark Jones, Matthias Mnich

We study the boundary of tractability for the Max-Cut problem in graphs. Our main result shows that Max-Cut above the Edwards-Erdős bound is fixed-parameter tractable: we give an a…

cs.DS2011★ 1 cited

Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments

Robert Crowston, Gregory Gutin, Mark Jones +1

In the problem {\sc Min-DESC}, we are given a digraph $D$ and an integer $k$ , and asked if there exists a set $A^{'}$ of at most $k$ arcs in $D$ , such that if we remove the arcs of $A…

cs.DS2011★ 15 cited

Simultaneously Satisfying Linear Equations Over $F_{2}$ : MaxLin2 and Max- $r$ -Lin2 Parameterized Above Average

R. Crowston, M. Fellows, G. Gutin +4

In the parameterized problem \textsc{MaxLin2-AA}[ $k$ ], we are given a system with variables $x_{1}, ..., x_{n}$ consisting of equations of the form $\prod_{i \in I} x_{i} = b$ , where $x_i,b…

Max-Cut Parameterized Above the Edwards-Erdős Bound

Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments

Simultaneously Satisfying Linear Equations Over F2​: MaxLin2 and Max-r-Lin2 Parameterized Above Average

Simultaneously Satisfying Linear Equations Over $F_{2}$ : MaxLin2 and Max- $r$ -Lin2 Parameterized Above Average