Steven Kelk

Orcid: 0000-0002-9518-4724

According to our database1, Steven Kelk authored at least 74 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Convex Characters, Algorithms, and Matchings.
SIAM J. Discret. Math., March, 2024

Relaxed Agreement Forests.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023
An improved kernel for the flip distance problem on simple convex polygons.
Inf. Process. Lett., August, 2023

Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance.
Inf. Process. Lett., 2023

Relaxed Agreement Forests.
CoRR, 2023

Agreement forests of caterpillar trees: complexity, kernelization and branching.
CoRR, 2023

Snakes and Ladders: A Treewidth Story.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2022
Deep kernelization for the Tree Bisection and Reconnnect (TBR) distance in phylogenetics.
CoRR, 2022

Sharp Upper and Lower Bounds on a Restricted Class of Convex Characters.
Electron. J. Comb., 2022

Reflections on kernelizing and computing unrooted agreement forests.
Ann. Oper. Res., 2022

New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees.
Algorithmica, 2022

2021
Maximum parsimony distance on phylogenetic trees: A linear kernel and constant factor approximation algorithm.
J. Comput. Syst. Sci., 2021

2020
Maximum parsimony distance on phylogenetictrees: a linear kernel and constant factor approximation algorithm.
CoRR, 2020

2019
A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees.
SIAM J. Discret. Math., 2019

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

Integrality gaps for colorful matchings.
Discret. Optim., 2019

Deciding the existence of a cherry-picking sequence is hard on two trees.
Discret. Appl. Math., 2019

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

Foundations of Digital Archæoludology.
CoRR, 2019

New reduction rules for the tree bisection and reconnection distance.
CoRR, 2019

Discovery of Important Subsequences in Electrocardiogram Beats Using the Nearest Neighbour Algorithm.
CoRR, 2019

A Machine Learning Approach to Algorithm Selection for Exact Computation of Treewidth.
Algorithms, 2019

2018
Treewidth distance on phylogenetic trees.
Theor. Comput. Sci., 2018

A third strike against perfect phylogeny.
CoRR, 2018

Integrality Gaps for Bounded Color Matchings.
CoRR, 2018

On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems.
Algorithmica, 2018

On a Fixed Haplotype Variant of the Minimum Error Correction Problem.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
A Resolution of the Static Formulation Question for the Problem of Computing the History Bound.
IEEE ACM Trans. Comput. Biol. Bioinform., 2017

A Linear Bound on the Number of States in Optimal Convex Characters for Maximum Parsimony Distance.
IEEE ACM Trans. Comput. Biol. Bioinform., 2017

ToTo: An open database for computation, storage and retrieval of tree decompositions.
Discret. Appl. Math., 2017

Finding the most parsimonious or likely tree in a network with respect to an alignment.
CoRR, 2017

A note on convex characters, Fibonacci numbers and exponential-time algorithms.
Adv. Appl. Math., 2017

Improving Card Fraud Detection Through Suspicious Pattern Discovery.
Proceedings of the Advances in Artificial Intelligence: From Theory to Practice, 2017

2016
Reduction rules for the maximum parsimony distance on phylogenetic trees.
Theor. Comput. Sci., 2016

Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees.
Theor. Comput. Sci., 2016

Review of: Genome-Scale Algorithm Design (Biological sequence analysis in the era of high-throughput sequencing) by Veli Mäkinen, Djamal Belazzougui, Fabio Cunial and Alexandru I. Tomescu.
SIGACT News, 2016

Review of ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks by Dan Gusfield.
SIGACT News, 2016

Hybridization Number on Three Rooted Binary Trees is EPT.
SIAM J. Discret. Math., 2016

Phylogenetic incongruence through the lens of Monadic Second Order logic.
J. Graph Algorithms Appl., 2016

Kernelizations for the hybridization number problem on multiple nonbinary trees.
J. Comput. Syst. Sci., 2016

Do branch lengths help to locate a tree in a phylogenetic network?
CoRR, 2016

2015
On Computing the Maximum Parsimony Score of a Phylogenetic Network.
SIAM J. Discret. Math., 2015

On Low Treewidth Graphs and Supertrees.
J. Graph Algorithms Appl., 2015

Phylogenetic incongruence through the lens of Monadic Second Order logic.
CoRR, 2015

A note on convex characters and Fibonacci numbers.
CoRR, 2015

2014
Approximation Algorithms for Nonbinary Agreement Forests.
SIAM J. Discret. Math., 2014

The agreement problem for unrooted phylogenetic trees is FPT.
J. Graph Algorithms Appl., 2014

On the complexity of computing MP distance between binary phylogenetic trees.
CoRR, 2014

Hybridization Number on Three Trees.
CoRR, 2014

A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees.
BMC Bioinform., 2014

Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable.
Algorithmica, 2014

Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2013
A Simple Fixed Parameter Tractable Algorithm for Computing the Hybridization Number of Two (Not Necessarily Binary) Trees.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013

2012
On the Elusiveness of Clusters.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set.
SIAM J. Discret. Math., 2012

Computing nonbinary agreement forests
CoRR, 2012

Towards the fixed parameter tractability of constructing minimal phylogenetic networks from arbitrary sets of nonbinary trees
CoRR, 2012

A Practical Approximation Algorithm for Solving Massive Instances of Hybridization Number.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

2011
A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Some Mathematical Refinements Concerning Error Minimization in the Genetic Code.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

A note on efficient computation of hybridization number via softwired clusters
CoRR, 2011

Constructing the Simplest Possible Phylogenetic Network from Triplets.
Algorithmica, 2011

2010
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks.
J. Discrete Algorithms, 2010

Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters.
Bioinform., 2010

2009
Constructing Level-2 Phylogenetic Networks from Triplets.
IEEE ACM Trans. Comput. Biol. Bioinform., 2009

Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks.
J. Bioinform. Comput. Biol., 2009

2008
Shorelines of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems.
IEEE ACM Trans. Comput. Biol. Bioinform., 2008

2007
Prefix Reversals on Binary and Ternary Strings.
SIAM J. Discret. Math., 2007

The Complexity of the Single Individual SNP Haplotyping Problem.
Algorithmica, 2007

2006
Beaches of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

2005
On the Complexity of Several Haplotyping Problems.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

2004
The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random.
SIAM J. Comput., 2004

2003
On the relative complexity of approximately counting H-colourings.
PhD thesis, 2003

2002
The complexity of choosing an H-colouring (nearly) uniformly at random.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002


  Loading...