Mark Jones

According to our database1, Mark Jones authored at least 87 papers between 1987 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Polynomial-Time Algorithms for Phylogenetic Inference Problems Involving Duplication and Reticulation.
IEEE/ACM Trans. Comput. Biology Bioinform., 2020

2019
Treewidth of display graphs: bounds, brambles and applications.
J. Graph Algorithms Appl., 2019

Combining Networks using Cherry Picking Sequences.
CoRR, 2019

Cutting an alignment with Ockham's razor.
CoRR, 2019

A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees.
CoRR, 2019

Rooting for phylogenetic networks.
CoRR, 2019

Modelling Airway Geometry as Stock Market Data Using Bayesian Changepoint Detection.
Proceedings of the Machine Learning in Medical Imaging - 10th International Workshop, 2019

2018
A third strike against perfect phylogeny.
CoRR, 2018

Does Industry 4.0 Pose a Challenge for the SME Machine Builder? A Case Study and Reflection of Readiness for a UK SME.
Proceedings of the Precision Assembly in the Digital Age, 2018

Polynomial-Time Algorithms for Phylogenetic Inference Problems.
Proceedings of the Algorithms for Computational Biology - 5th International Conference, 2018

2017
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs.
SIAM J. Discrete Math., 2017

Rearrangement moves on rooted phylogenetic networks.
PLoS Computational Biology, 2017

Parameterized complexity of the k-arc Chinese Postman Problem.
J. Comput. Syst. Sci., 2017

Cryptographic enforcement of information flow policies without public information via tree partitions.
Journal of Computer Security, 2017

Acyclicity in edge-colored graphs.
Discret. Math., 2017

Chinese Postman Problem on edge-colored multigraphs.
Discret. Appl. Math., 2017

Exploring the tiers of rooted phylogenetic network space using tail moves.
CoRR, 2017

Consistency of orthology and paralogy constraints in the presence of gene transfers.
CoRR, 2017

Constructing a Consensus Phylogeny from a Leaf-Removal Distance.
CoRR, 2017

Parameterized and Approximation Algorithms for the Load Coloring Problem.
Algorithmica, 2017

Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract).
Proceedings of the String Processing and Information Retrieval, 2017

2016
Kernelization, Max-Cut Above Tight Bounds.
Encyclopedia of Algorithms, 2016

On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations.
ACM Trans. Priv. Secur., 2016

The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth.
SIAM J. Discrete 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

On the consistency of orthology relationships.
BMC Bioinformatics, 2016

Parameterizations of Test Cover with Bounded Test Sizes.
Algorithmica, 2016

2015
Group Equivariant Singularity Theory in the Bifurcation of Interfacial Wilton Ripples.
I. J. Bifurcation and Chaos, 2015

Max-Cut Parameterized Above the Edwards-Erdős Bound.
Algorithmica, 2015

On the Workflow Satisfiability Problem with Class-independent Constraints.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

Structural Parameterizations of the Mixed Chinese Postman Problem.
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

Cryptographic Enforcement of Information Flow Policies Without Public Information.
Proceedings of the Applied Cryptography and Network Security, 2015

2014
RADIUS Attributes for IEEE 802 Networks.
RFC, July, 2014

Satisfying more than half of a system of linear equations over GF(2): A multivariate approach.
J. Comput. Syst. Sci., 2014

Iterative Plan Construction for the Workflow Satisfiability Problem.
J. Artif. Intell. Res., 2014

Parameterized algorithms for load coloring problem.
Inf. Process. Lett., 2014

Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables.
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

Recovery Spaces: An Enhanced Learning Technology for Treatment and Rehabilitation Centres.
Proceedings of the Sixth IEEE International Conference on Technology for Education, 2014

Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints.
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

What's happening in 'their space'? Exploring the borders of formal and informal learning with undergraduate students of education in the age of mobile technologies.
Proceedings of BIIML 2014 Symposium, Bristol, United Kingdom, March 6-7, 2014., 2014

2013
Parameterized complexity of MaxSat Above Average.
Theor. Comput. Sci., 2013

Maximum balanced subgraph problem parameterized above lower bound.
Theor. Comput. Sci., 2013

Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$.
Theory Comput. Syst., 2013

A new bound for 3-satisfiable MaxSat and its algorithmic application.
Inf. Comput., 2013

Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound.
CoRR, 2013

Pattern-Based Plan Construction for the Workflow Satisfiability Problem.
CoRR, 2013

Best practices in short animation production in private/public partnerships: an agile approach.
Proceedings of the International Conference on Computer Graphics and Interactive Techniques, 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
Note on Large Subsets of Binary Vectors with Similar Distances.
SIAM J. Discrete Math., 2012

Parameterized Eulerian strong component arc deletion problem on tournaments.
Inf. Process. Lett., 2012

Directed Acyclic Subgraph Problem Parameterized above Raman-Saurabh Bound
CoRR, 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

Parameterized Study of the Test Cover Problem.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011
Diameter Straightforward-Naming Authority Pointer (S-NAPTR) Usage.
RFC, November, 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

Lower Bound for Max-$r$-Lin2 and its Applications in Algorithmics and Graph Theory
CoRR, 2011

The Vocal Expression of Emotion: An Acoustic Analysis of Anxiety.
Proceedings of the 17th International Congress of Phonetic Sciences, 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

A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010
Traffic Classification and Quality of Service (QoS) Attributes for Diameter.
RFC, February, 2010

Note on Max Lin-2 above Average.
Inf. Process. Lett., 2010

MetaWire: Using FPGA configuration circuitry to emulate a network-on-chip.
IET Computers & Digital Techniques, 2010

Linear-Number-of-Variables Kernel for Unit-Conflict-Free-Max-Sat Parameterized Above Expectation
CoRR, 2010

Systems of Linear Equations over F2 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

2009
Clarifications on the Routing of Diameter Requests Based on the Username and the Realm.
RFC, December, 2009

Carrying Location Objects in RADIUS and Diameter.
RFC, August, 2009

Diameter Command Code Registration for the Third Generation Partnership Project (3GPP) Evolved Packet System (EPS).
RFC, April, 2009

Negative binomial mixed models for analysis of stuttering rates.
Comput. Stat. Data Anal., 2009

2007
Education At The Edge: Preparing Students To Build Quality Systems.
Proceedings of the 2007 International Conference on Software Engineering Research & Practice, 2007

2005
Software certificate management (SoftCeMent'05).
Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering (ASE 2005), 2005

The pedagogic opportunities of touch-screen voting.
Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2005

2004
Human computer (sexual) interactions.
Interactions, 2004

A Reconfigurable Approach to Structural Engineering Design Computations.
Proceedings of the International Conference on Engineering of Reconfigurable Systems and Algorithms, 2004

2000
A Run-Time Reconfigurable Plug-In for the Winamp MP3 Player.
Proceedings of the 8th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2000), 2000

1999
Implementing an API for Distributed Adaptive Computing Systems.
Proceedings of the 7th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM '99), 1999

1998
The Design, Development and Use of a CD-ROM Resource Library for an Open University Course.
BJET, 1998

Express link-up.
Proceedings of the ACM SIGGRAPH 98 Conference Abstracts and Applications, 1998

1991
Protocol design for large group multicasting: the message distribution protocol.
Comput. Commun., 1991

1987
Performance of a Parallel Algorithm for Standard Cell Placement on the Intel Hypercube.
Proceedings of the 24th ACM/IEEE Design Automation Conference. Miami Beach, FL, USA, June 28, 1987


  Loading...