Mark Jones

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 57

Top Venues

CoRR

Algorithmica

J. Comput. Syst. Sci.

IPEC

Publications

Niels Holtgrefe, Leo van Iersel, Mark Jones
Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs. CoRR (2024)
Elise Deen, Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh
A near-linear kernel for bounded-state parsimony distance. J. Comput. Syst. Sci. 140 (2024)
Katharina T. Huber, Leo van Iersel, Remie Janssen, Mark Jones, Vincent Moulton, Yukihiro Murakami, Charles Semple
Orienting undirected phylogenetic networks. J. Comput. Syst. Sci. 140 (2024)
Leo van Iersel, Mark Jones, Jannik Schestag, Céline Scornavacca, Mathias Weller
Maximizing Network Phylogenetic Diversity. CoRR (2024)
Mark Jones, Jannik Schestag
Maximizing Phylogenetic Diversity under Time Pressure: Planning with Extinctions Ahead. CoRR (2024)
Leo van Iersel, Mark Jones, Esther Julien, Yukihiro Murakami
Making a Network Orchard by Adding Leaves. WABI (2023)
Leo van Iersel, Mark Jones, Esther Julien, Yukihiro Murakami
Making a Network Orchard by Adding Leaves. CoRR (2023)
Mark Jones, Jannik Schestag
How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks. IPEC (2023)
Katharina T. Huber, Leo van Iersel, Remie Janssen, Mark Jones, Vincent Moulton, Yukihiro Murakami
Level-2 networks from shortest and longest distances. Discret. Appl. Math. 306 (2022)
Laurent Bulteau, Mark Jones, Rolf Niedermeier, Till Tantau
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. CPM (2022)
Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees. Algorithmica 84 (4) (2022)
Sander Borst, Leo van Iersel, Mark Jones, Steven Kelk
New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees. Algorithmica 84 (7) (2022)
Leo van Iersel, Mark Jones, Mathias Weller
Embedding Phylogenetic Trees in Networks of Low Treewidth. ESA (2022)
Leo van Iersel, Mark Jones, Mathias Weller
Embedding phylogenetic trees in networks of low treewidth. CoRR (2022)
Elise Deen, Leo van Iersel, Remie Janssen, Mark Jones, Yuki Murakami, Norbert Zeh
A Near-Linear Kernel for Two-Parsimony Distance. CoRR (2022)
Mark Jones, Steven Kelk, Leen Stougie
Maximum parsimony distance on phylogenetic trees: A linear kernel and constant factor approximation algorithm. J. Comput. Syst. Sci. 117 (2021)
Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh
A unifying characterization of tree-based networks and orchard networks using cherry covers. Adv. Appl. Math. 129 (2021)
Sander Borst, Leo van Iersel, Mark Jones, Steven Kelk
New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees. CoRR (2020)
Remie Janssen, Mark Jones, Yukihiro Murakami
Combining Networks Using Cherry Picking Sequences. AlCoB (2020)
Mark Jones, Steven Kelk, Leen Stougie
Maximum parsimony distance on phylogenetictrees: a linear kernel and constant factor approximation algorithm. CoRR (2020)
Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh
Polynomial-Time Algorithms for Phylogenetic Inference Problems Involving Duplication and Reticulation. IEEE ACM Trans. Comput. Biol. Bioinform. 17 (1) (2020)
Katharina T. Huber, Leo van Iersel, Remie Janssen, Mark Jones, Vincent Moulton, Yukihiro Murakami, Charles Semple
Rooting for phylogenetic networks. CoRR (2019)
Remie Janssen, Mark Jones, Steven Kelk, Georgios Stamoulis, Taoyang Wu
Treewidth of display graphs: bounds, brambles and applications. J. Graph Algorithms Appl. 23 (4) (2019)
Mark Jones, Philippe Gambette, Leo van Iersel, Remie Janssen, Steven Kelk, Fabio Pardi, Céline Scornavacca
Cutting an alignment with Ockham's razor. CoRR (2019)
Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees. CoRR (2019)
Remie Janssen, Mark Jones, Yukihiro Murakami
Combining Networks using Cherry Picking Sequences. CoRR (2019)
Leo van Iersel, Mark Jones, Steven Kelk
A third strike against perfect phylogeny. CoRR (2018)
Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh
Polynomial-Time Algorithms for Phylogenetic Inference Problems. AlCoB (2018)
Remie Janssen, Mark Jones, Steven Kelk, Georgios Stamoulis, Taoyang Wu
Treewidth of display graphs: bounds, brambles and applications. CoRR (2018)
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
Acyclicity in edge-colored graphs. Discret. Math. 340 (2) (2017)
Mark Jones, Manuel Lafond, Céline Scornavacca
Consistency of orthology and paralogy constraints in the presence of gene transfers. CoRR (2017)
Gregory Z. Gutin, Mark Jones, Bin Sheng
Parameterized complexity of the k-arc Chinese Postman Problem. J. Comput. Syst. Sci. 84 (2017)
Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones, Bertram Poettering
Cryptographic enforcement of information flow policies without public information via tree partitions. J. Comput. Secur. 25 (6) (2017)
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
Chinese Postman Problem on edge-colored multigraphs. Discret. Appl. Math. 217 (2017)
Cédric Chauve, Mark Jones, Manuel Lafond, Céline Scornavacca, Mathias Weller
Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract). SPIRE (2017)
Philippe Gambette, Leo van Iersel, Mark Jones, Manuel Lafond, Fabio Pardi, Céline Scornavacca
Rearrangement moves on rooted phylogenetic networks. PLoS Comput. Biol. 13 (8) (2017)
Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng
Parameterized and Approximation Algorithms for the Load Coloring Problem. Algorithmica 79 (1) (2017)
Remie Janssen, Mark Jones, Péter L. Erdös, Leo van Iersel, Céline Scornavacca
Exploring the tiers of rooted phylogenetic network space using tail moves. CoRR (2017)
Cédric Chauve, Mark Jones, Manuel Lafond, Céline Scornavacca, Mathias Weller
Constructing a Consensus Phylogeny from a Leaf-Removal Distance. CoRR (2017)
Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones, Bertram Poettering
Cryptographic Enforcement of Information Flow Policies without Public Information via Tree Partitions. CoRR (2016)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia, Anders Yeo
Parameterizations of Test Cover with Bounded Test Sizes. Algorithmica 74 (1) (2016)
David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones
Algorithms for the workflow satisfiability problem engineered for counting constraints. J. Comb. Optim. 32 (1) (2016)
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
Acyclicity in Edge-Colored Graphs. CoRR (2016)
Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo
Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths. Inf. Process. Lett. 116 (6) (2016)
Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones, Magnus Wahlström
On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations. ACM Trans. Priv. Secur. 19 (3) (2016)
Gregory Z. Gutin, Mark Jones, Magnus Wahlström
The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth. SIAM J. Discret. Math. 30 (4) (2016)
Gregory Z. Gutin, Mark Jones, Magnus Wahlström
Structural Parameterizations of the Mixed Chinese Postman Problem. ESA (2015)
Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo
Linear-Vertex Kernel for the Problem of Packing r-Stars into a Graph without Long Induced Paths. CoRR (2015)
Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones
Optimal Constructions for Chain-Based Cryptographic Enforcement of Information Flow Policies. DBSec (2015)
Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng
Parameterized and Approximation Algorithms for the Load Coloring Problem. IPEC (2015)
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
Chinese Postman Problem on Edge-Colored Multigraphs. CoRR (2015)
Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones, Bertram Poettering
Cryptographic Enforcement of Information Flow Policies Without Public Information. ACNS (2015)
Robert Crowston, Mark Jones, Matthias Mnich
Max-Cut Parameterized Above the Edwards-Erdős Bound. Algorithmica 72 (3) (2015)
Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones
Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies. CoRR (2015)
Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones
On the Workflow Satisfiability Problem with Class-Independent Constraints. CoRR (2015)
Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones
On the Workflow Satisfiability Problem with Class-independent Constraints. IPEC (2015)
David A. Cohen, Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones
Algorithms for the workflow satisfiability problem engineered for counting constraints. CoRR (2015)
Gregory Z. Gutin, Mark Jones, Bin Sheng
Parameterized Complexity of the $k$-Arc Chinese Postman Problem. CoRR (2014)
David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones
Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints. FAW (2014)
Gregory Z. Gutin, Mark Jones, Bin Sheng
Parameterized Complexity of the k-Arc Chinese Postman Problem. ESA (2014)
Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng
Parameterized and Approximation Algorithms for the Load Coloring Problem. CoRR (2014)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables. Algorithmica 68 (3) (2014)
David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones
Iterative Plan Construction for the Workflow Satisfiability Problem. J. Artif. Intell. Res. 51 (2014)
Gregory Z. Gutin, Mark Jones, Magnus Wahlström
Structural Parameterizations of the Mixed Chinese Postman Problem. CoRR (2014)
Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Fran Rosamond, Imre Z. Ruzsa, Stéphan Thomassé, Anders Yeo
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. J. Comput. Syst. Sci. 80 (4) (2014)
Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones, Bertram Poettering
Cryptographic Enforcement of Information Flow Policies without Public Information. CoRR (2014)
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström
Parameterized Directed $k$-Chinese Postman Problem and $k$ Arc-Disjoint Cycles Problem on Euler Digraphs. CoRR (2014)
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström
Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs. WG (2014)
Gregory Z. Gutin, Mark Jones
Parameterized algorithms for load coloring problem. Inf. Process. Lett. 114 (8) (2014)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia
Maximum Balanced Subgraph Problem Parameterized above Lower Bound. COCOON (2013)
Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh
Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound. CoRR (2013)
David A. Cohen, Jason Crampton, Gregory Z. Gutin, Mark Jones
Pattern-Based Plan Construction for the Workflow Satisfiability Problem. CoRR (2013)
Gregory Z. Gutin, Mark Jones
Parameterized Algorithms for Load Coloring Problem. CoRR (2013)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh
Parameterized complexity of MaxSat Above Average. Theor. Comput. Sci. 511 (2013)
Jason Crampton, Robert Crowston, Gregory Z. Gutin, Mark Jones, M. S. Ramanujan
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints. FAW-AAIM (2013)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia
Maximum balanced subgraph problem parameterized above lower bound. Theor. Comput. Sci. 513 (2013)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$. Theory Comput. Syst. 52 (4) (2013)
Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh
Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound. FSTTCS (2013)
Gregory Z. Gutin, Mark Jones, Dominik Scheder, Anders Yeo
A new bound for 3-satisfiable MaxSat and its algorithmic application. Inf. Comput. 231 (2013)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
Fixed-Parameter Tractability of Satisfying beyond the Number of Variables. SAT (2012)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia
Maximum Balanced Subgraph Problem Parameterized Above Lower Bound CoRR (2012)
Gregory Z. Gutin, Mark Jones
Note on Existence and Non-Existence of Large Subsets of Binary Vectors with Similar Distances CoRR (2012)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
Parameterized Eulerian strong component arc deletion problem on tournaments. Inf. Process. Lett. 112 (6) (2012)
Gregory Z. Gutin, Mark Jones
Note on Large Subsets of Binary Vectors with Similar Distances. SIAM J. Discret. Math. 26 (3) (2012)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh
Parameterized Complexity of MaxSat above Average. LATIN (2012)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo
Parameterized Study of the Test Cover Problem. MFCS (2012)
Robert Crowston, Mark Jones, Matthias Mnich
Max-Cut Parameterized above the Edwards-Erdős Bound. ICALP (1) (2012)
Robert Crowston, Gregory Z. Gutin, Mark Jones
Directed Acyclic Subgraph Problem Parameterized above Raman-Saurabh Bound CoRR (2012)
Jason Crampton, Robert Crowston, Gregory Z. Gutin, Mark Jones, M. S. Ramanujan
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints CoRR (2012)
Robert Crowston, Gregory Z. Gutin, Mark Jones
Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound. FSTTCS (2012)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo
Parameterized Study of the Test Cover Problem CoRR (2012)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
Fixed-parameter tractability of satisfying beyond the number of variables CoRR (2012)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia, Anders Yeo
Parameterizations of Test Cover with Bounded Test Sizes CoRR (2012)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications. Algorithmica 64 (1) (2012)
Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. FSTTCS (2011)
Gregory Z. Gutin, Mark Jones, Anders Yeo
A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application CoRR (2011)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
Lower Bound for Max-$r$-Lin2 and its Applications in Algorithmics and Graph Theory CoRR (2011)
Gregory Z. Gutin, Mark Jones, Anders Yeo
Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems. Theor. Comput. Sci. 412 (41) (2011)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_2$ CoRR (2011)
Gregory Z. Gutin, Mark Jones, Anders Yeo
A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application. FCT (2011)

Mark Jones.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mark Jones