Mark Jones
Orcid: 0000-0002-4091-7089Affiliations:
- Delft University of Technology, The Netherlands
- University of London, Royal Holloway, Egham, Surrey, UK (PhD 2013)
According to our database1,
Mark Jones
authored at least 74 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
J. Comput. Syst. Sci., March, 2024
Maximizing Phylogenetic Diversity under Time Pressure: Planning with Extinctions Ahead.
CoRR, 2024
CoRR, 2024
2023
Proceedings of the 23rd International Workshop on Algorithms in Bioinformatics, 2023
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023
2022
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees.
Algorithmica, 2022
New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees.
Algorithmica, 2022
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022
2021
Maximum parsimony distance on phylogenetic trees: A linear kernel and constant factor approximation algorithm.
J. Comput. Syst. Sci., 2021
A unifying characterization of tree-based networks and orchard networks using cherry covers.
Adv. Appl. Math., 2021
2020
Polynomial-Time Algorithms for Phylogenetic Inference Problems Involving Duplication and Reticulation.
IEEE ACM Trans. Comput. Biol. Bioinform., 2020
Maximum parsimony distance on phylogenetictrees: a linear kernel and constant factor approximation algorithm.
CoRR, 2020
Proceedings of the Algorithms for Computational Biology, 2020
2019
J. Graph Algorithms Appl., 2019
2018
Proceedings of the Algorithms for Computational Biology - 5th International Conference, 2018
2017
SIAM J. Discret. Math., 2017
J. Comput. Syst. Sci., 2017
Cryptographic enforcement of information flow policies without public information via tree partitions.
J. Comput. Secur., 2017
CoRR, 2017
CoRR, 2017
Algorithmica, 2017
Proceedings of the String Processing and Information Retrieval, 2017
2016
On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations.
ACM Trans. Priv. Secur., 2016
SIAM J. Discret. Math., 2016
Algorithms for the workflow satisfiability problem engineered for counting constraints.
J. Comb. Optim., 2016
Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths.
Inf. Process. Lett., 2016
2015
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015
Proceedings of the Algorithms - ESA 2015, 2015
Optimal Constructions for Chain-Based Cryptographic Enforcement of Information Flow Policies.
Proceedings of the Data and Applications Security and Privacy XXIX, 2015
Proceedings of the Applied Cryptography and Network Security, 2015
2014
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach.
J. Comput. Syst. Sci., 2014
J. Artif. Intell. Res., 2014
Algorithmica, 2014
Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014
Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints.
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014
2013
Theor. Comput. Sci., 2013
Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$.
Theory Comput. Syst., 2013
Inf. Comput., 2013
Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound.
CoRR, 2013
Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013
2012
SIAM J. Discret. Math., 2012
Inf. Process. Lett., 2012
Note on Existence and Non-Existence of Large Subsets of Binary Vectors with Similar Distances
CoRR, 2012
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications.
Algorithmica, 2012
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012
2011
Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems.
Theor. Comput. Sci., 2011
Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_2$
CoRR, 2011
CoRR, 2011
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011
2010
Linear-Number-of-Variables Kernel for Unit-Conflict-Free-Max-Sat Parameterized Above Expectation
CoRR, 2010
Systems of Linear Equations over F<sub>2</sub> and Problems Parameterized above Average.
Proceedings of the Algorithm Theory, 2010
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010