Publications (30)
Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound
Robert Crowston, Gregory Gutin, Mark Jones
A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application
Gregory Gutin, Mark Jones, Dominik Scheder +1
Note on Max Lin-2 above Average
Robert Crowston, Gregory Gutin, Mark Jones
Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies
Jason Crampton, Naomi Farley, Gregory Gutin +1
Treewidth of display graphs: bounds, brambles and applications
Remie Janssen, Mark Jones, Steven Kelk +2
Parameterized Complexity of MaxSat Above Average
Robert Crowston, Gregory Gutin, Mark Jones +2
On the Workflow Satisfiability Problem with Class-Independent Constraints
Jason Crampton, Andrei Gagarin, Gregory Gutin +2
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees
Leo van Iersel, Remie Janssen, Mark Jones +2
Cryptographic Enforcement of Information Flow Policies without Public Information via Tree Partitions
Jason Crampton, Naomi Farley, Gregory Gutin +2
Linear-Vertex Kernel for the Problem of Packing $r$-Stars into a Graph without Long Induced Paths
Florian Barbero, Gregory Gutin, Mark Jones +2
Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments
Robert Crowston, Gregory Gutin, Mark Jones +1
Parameterized Directed $k$-Chinese Postman Problem and $k$ Arc-Disjoint Cycles Problem on Euler Digraphs
Gregory Gutin, Mark Jones, Bin Sheng +1
A third strike against perfect phylogeny
Leo van Iersel, Mark Jones, Steven Kelk
Chinese Postman Problem on Edge-Colored Multigraphs
Gregory Gutin, Mark Jones, Bin Sheng +2
Note on Existence and Non-Existence of Large Subsets of Binary Vectors with Similar Distances
Gregory Gutin, Mark Jones
Polynomial-Time Algorithms for Phylogenetic Inference Problems involving duplication and reticulation
Leo van Iersel, Remie Janssen, Mark Jones +2
The paper presents polynomial‑time algorithms for two phylogenetic inference problems—one minimizing duplication episodes and another minimizing reticulation events—by using a stru…
A Planned Jefferson Lab Experiment on Spin-Flavor Decomposition
Xiaodong Jiang, Peter Bosted, Mark Jones +1
Kernels for Below-Upper-Bound Parameterizations of the Hitting Set and Directed Dominating Set Problems
Gregory Gutin, Mark Jones, Anders Yeo
Reconstructing Tree-Child Networks from Reticulate-Edge-Deleted Subnetworks
Yukihiro Murakami, Leo van Iersel, Remie Janssen +2
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
Mark Jones, Daniel Lokshtanov, M. S. Ramanujan +2
Parameterized Algorithms for Load Coloring Problem
Gregory Gutin, Mark Jones
Iterative Plan Construction for the Workflow Satisfiability Problem
David Cohen, Jason Crampton, Andrei Gagarin +2
Max-Cut Parameterized Above the Edwards-ErdÅs Bound
Robert Crowston, Mark Jones, Matthias Mnich
Parameterized Complexity of the $k$-Arc Chinese Postman Problem
Gregory Gutin, Mark Jones, Bin Sheng
Constructing a Consensus Phylogeny from a Leaf-Removal Distance
Cedric Chauve, Mark Jones, Manuel Lafond +2
Structural Parameterizations of the Mixed Chinese Postman Problem
Gregory Gutin, Mark Jones, Magnus Wahlstrom
Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-TurzÃk Bound
Robert Crowston, Mark Jones, Gabriele Muciaccia +3
Acyclicity in Edge-Colored Graphs
Gregory Gutin, Mark Jones, Bin Sheng +2
Cryptographic Enforcement of Information Flow Policies without Public Information
Jason Crampton, Naomi Farley, Gregory Gutin +2
Parameterizations of Test Cover with Bounded Test Sizes
Robert Crowston, Gregory Gutin, Mark Jones +2