Steven Kelk
Orcid: 0000-0002-9518-4724
According to our database1,
Steven Kelk
authored at least 79 papers
between 2002 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs.
Discret. Appl. Math., 2025
2024
Theor. Comput. Sci., 2024
Deep kernelization for the Tree Bisection and Reconnection (TBR) distance in phylogenetics.
J. Comput. Syst. Sci., 2024
CoRR, 2024
CoRR, 2024
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024
2023
Inf. Process. Lett., August, 2023
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance.
Inf. Process. Lett., 2023
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
Electron. J. Comb., 2022
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
J. Graph Algorithms Appl., 2019
Discret. Appl. Math., 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
On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems.
Algorithmica, 2018
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
Adv. Appl. Math., 2017
Proceedings of the Advances in Artificial Intelligence: From Theory to Practice, 2017
2016
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
SIAM J. Discret. Math., 2016
J. Graph Algorithms Appl., 2016
J. Comput. Syst. Sci., 2016
2015
SIAM J. Discret. Math., 2015
2014
SIAM J. Discret. Math., 2014
J. Graph Algorithms Appl., 2014
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
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
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
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
IEEE ACM Trans. Comput. Biol. Bioinform., 2011
IEEE ACM Trans. Comput. Biol. Bioinform., 2011
CoRR, 2011
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
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
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
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005
2004
SIAM J. Comput., 2004
2003
2002
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002