Steven Kelk

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 54

Top Topics

Independent Set

Tree Decompositions

Phylogenetic Trees

Maximum Parsimony

Top Venues

SIAM J. Discret. Math.

Theor. Comput. Sci.

J. Graph Algorithms Appl.

Publications

Steven Kelk, Ruben Meuwese, Stephan Wagner
Convex Characters, Algorithms, and Matchings. SIAM J. Discret. Math. 38 (1) (2024)
Steven Kelk, Simone Linz, Ruben Meuwese
Deep kernelization for the Tree Bisection and Reconnection (TBR) distance in phylogenetics. J. Comput. Syst. Sci. 142 (2024)
Steven Kelk, Ruben Meuwese
Agreement forests of caterpillar trees: Complexity, kernelization and branching. Theor. Comput. Sci. 1003 (2024)
Virginia Ardévol Martínez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis
Relaxed Agreement Forests. SOFSEM (2024)
Steven Chaplick, Martin Frohn, Steven Kelk, Johann Lottermoser, Matús Mihalák
Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs. CoRR (2024)
Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis
Snakes and Ladders: a Treewidth Story. CoRR (2023)
Virginia Aardevol Martinez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis
Relaxed Agreement Forests. CoRR (2023)
Miguel Bosch Calvo, Steven Kelk
An improved kernel for the flip distance problem on simple convex polygons. Inf. Process. Lett. 182 (2023)
Steven Kelk, Ruben Meuwese
Agreement forests of caterpillar trees: complexity, kernelization and branching. CoRR (2023)
Steven Kelk, Simone Linz, Ruben Meuwese
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance. Inf. Process. Lett. 180 (2023)
Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis
Snakes and Ladders: A Treewidth Story. WG (2023)
Steven Kelk, Simone Linz, Ruben Meuwese
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance. CoRR (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)
Steven Kelk, Ruben Meuwese
Sharp Upper and Lower Bounds on a Restricted Class of Convex Characters. Electron. J. Comb. 29 (1) (2022)
Rim van Wersch, Steven Kelk, Simone Linz, Georgios Stamoulis
Reflections on kernelizing and computing unrooted agreement forests. Ann. Oper. Res. 309 (1) (2022)
Steven Kelk, Simone Linz, Ruben Meuwese
Deep kernelization for the Tree Bisection and Reconnnect (TBR) distance in phylogenetics. CoRR (2022)
Miguel Bosch Calvo, Steven Kelk
An Improved Kernel for the Flip Distance Problem on Simple Convex Polygons. CCCG (2021)
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)
Rim van Wersch, Steven Kelk, Simone Linz, Georgios Stamoulis
Reflections on kernelizing and computing unrooted agreement forests. CoRR (2020)
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)
Mark Jones, Steven Kelk, Leen Stougie
Maximum parsimony distance on phylogenetictrees: a linear kernel and constant factor approximation algorithm. CoRR (2020)
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)
Steven Kelk, Simone Linz
A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees. SIAM J. Discret. Math. 33 (3) (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)
Cameron Browne, Dennis J. N. J. Soemers, Éric Piette, Matthew Stephenson, Michael Conrad, Walter Crist, Thierry Depaulis, Eddie Duggan, Fred Horn, Steven Kelk, Simon M. Lucas, João Pedro Neto, David Parlett, Abdallah Saffidine, Ulrich Schädler, Jorge Nuno Silva, Alex de Voogt, Mark H. M. Winands
Foundations of Digital Archæoludology. CoRR (2019)
Borislav Slavchev, Evelina Masliankova, Steven Kelk
A Machine Learning Approach to Algorithm Selection for Exact Computation of Treewidth. Algorithms 12 (10) (2019)
Ricards Marcinkevics, Steven Kelk, Carlo Galuzzi, Berthold Stegemann
Discovery of Important Subsequences in Electrocardiogram Beats Using the Nearest Neighbour Algorithm. CoRR (2019)
Steven Kelk, Georgios Stamoulis
Integrality gaps for colorful matchings. Discret. Optim. 32 (2019)
Janosch Döcker, Leo van Iersel, Steven Kelk, Simone Linz
Deciding the existence of a cherry-picking sequence is hard on two trees. Discret. Appl. Math. 260 (2019)
Steven Kelk, Simone Linz
New reduction rules for the tree bisection and reconnection distance. CoRR (2019)
Axel Goblet, Steven Kelk, Matús Mihalák, Georgios Stamoulis
On a Fixed Haplotype Variant of the Minimum Error Correction Problem. COCOON (2018)
Leo van Iersel, Mark Jones, Steven Kelk
A third strike against perfect phylogeny. CoRR (2018)
Leo van Iersel, Steven Kelk, Georgios Stamoulis, Leen Stougie, Olivier Boes
On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems. Algorithmica 80 (11) (2018)
Remie Janssen, Mark Jones, Steven Kelk, Georgios Stamoulis, Taoyang Wu
Treewidth of display graphs: bounds, brambles and applications. CoRR (2018)
Steven Kelk, Georgios Stamoulis
Integrality Gaps for Bounded Color Matchings. CoRR (2018)
Steven Kelk, Georgios Stamoulis, Taoyang Wu
Treewidth distance on phylogenetic trees. Theor. Comput. Sci. 731 (2018)
Steven Kelk, Simone Linz
A tight kernel for computing the tree bisection and reconnection distance between two phylogenetic trees. CoRR (2018)
Janosch Döcker, Leo van Iersel, Steven Kelk, Simone Linz
Deciding the existence of a cherry-picking sequence is hard on two trees. CoRR (2017)
Steven Kelk, Georgios Stamoulis
A note on convex characters, Fibonacci numbers and exponential-time algorithms. Adv. Appl. Math. 84 (2017)
Julia Matsieva, Steven Kelk, Céline Scornavacca, Chris Whidden, Dan Gusfield
A Resolution of the Static Formulation Question for the Problem of Computing the History Bound. IEEE ACM Trans. Comput. Biol. Bioinform. 14 (2) (2017)
Steven Kelk, Fabio Pardi, Céline Scornavacca, Leo van Iersel
Finding the most parsimonious or likely tree in a network with respect to an alignment. CoRR (2017)
Olivier Boes, Mareike Fischer, Steven Kelk
A Linear Bound on the Number of States in Optimal Convex Characters for Maximum Parsimony Distance. IEEE ACM Trans. Comput. Biol. Bioinform. 14 (2) (2017)
Rim van Wersch, Steven Kelk
ToTo: An open database for computation, storage and retrieval of tree decompositions. Discret. Appl. Math. 217 (2017)
Steven Kelk, Georgios Stamoulis, Taoyang Wu
Treewidth distance on phylogenetic trees. CoRR (2017)
Fabian Braun, Olivier Caelen, Evgueni N. Smirnov, Steven Kelk, Bertrand Lebichot
Improving Card Fraud Detection Through Suspicious Pattern Discovery. IEA/AIE (2) (2017)
Leo van Iersel, Steven Kelk, Nela Lekic, Simone Linz
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees. Theor. Comput. Sci. 609 (2016)
Steven Kelk
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 47 (3) (2016)
Philippe Gambette, Leo van Iersel, Steven Kelk, Fabio Pardi, Céline Scornavacca
Do branch lengths help to locate a tree in a phylogenetic network? CoRR (2016)
Steven Kelk, Mareike Fischer, Vincent Moulton, Taoyang Wu
Reduction rules for the maximum parsimony distance on phylogenetic trees. Theor. Comput. Sci. 646 (2016)
Leo van Iersel, Steven Kelk, Georgios Stamoulis, Leen Stougie, Olivier Boes
On unrooted and root-uncertain variants of several well-known phylogenetic network problems. CoRR (2016)
Steven Kelk
Review of ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks by Dan Gusfield. SIGACT News 47 (1) (2016)
Steven Kelk, Leo van Iersel, Céline Scornavacca, Mathias Weller
Phylogenetic incongruence through the lens of Monadic Second Order logic. J. Graph Algorithms Appl. 20 (2) (2016)
Leo van Iersel, Steven Kelk, Nela Lekic, Chris Whidden, Norbert Zeh
Hybridization Number on Three Rooted Binary Trees is EPT. SIAM J. Discret. Math. 30 (3) (2016)
Leo van Iersel, Steven Kelk, Céline Scornavacca
Kernelizations for the hybridization number problem on multiple nonbinary trees. J. Comput. Syst. Sci. 82 (6) (2016)
Steven Kelk
A note on convex characters and Fibonacci numbers. CoRR (2015)
Steven Kelk, Mareike Fischer, Vincent Moulton, Taoyang Wu
Reduction rules for the maximum parsimony distance on phylogenetic trees. CoRR (2015)
Olivier Boes, Mareike Fischer, Steven Kelk
A linear bound on the number of states in optimal convex characters for maximum parsimony distance. CoRR (2015)
Alexander Grigoriev, Steven Kelk, Nela Lekic
On Low Treewidth Graphs and Supertrees. J. Graph Algorithms Appl. 19 (1) (2015)
Steven Kelk, Leo van Iersel, Céline Scornavacca
Phylogenetic incongruence through the lens of Monadic Second Order logic. CoRR (2015)
Mareike Fischer, Leo van Iersel, Steven Kelk, Céline Scornavacca
On Computing the Maximum Parsimony Score of a Phylogenetic Network. SIAM J. Discret. Math. 29 (1) (2015)
Leo van Iersel, Steven Kelk, Nela Lekic, Simone Linz
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees. CoRR (2014)
Leo van Iersel, Steven Kelk, Nela Lekic, Leen Stougie
Approximation Algorithms for Nonbinary Agreement Forests. SIAM J. Discret. Math. 28 (1) (2014)
Leo van Iersel, Steven Kelk
Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees. WG (2014)
Leo van Iersel, Steven Kelk, Nela Lekic, Chris Whidden, Norbert Zeh
Hybridization Number on Three Trees. CoRR (2014)
Alexander Grigoriev, Steven Kelk, Nela Lekic
On Low Treewidth Graphs and Supertrees. AlCoB (2014)
Leo van Iersel, Steven Kelk, Nela Lekic, Céline Scornavacca
A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees. BMC Bioinform. 15 (2014)
Steven Kelk, Mareike Fischer
On the complexity of computing MP distance between binary phylogenetic trees. CoRR (2014)
Céline Scornavacca, Leo van Iersel, Steven Kelk, David Bryant
The agreement problem for unrooted phylogenetic trees is FPT. J. Graph Algorithms Appl. 18 (3) (2014)
Steven Kelk, Céline Scornavacca
Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable. Algorithmica 68 (4) (2014)
Alexander Grigoriev, Steven Kelk, Nela Lekic
On low treewidth graphs and supertrees. CoRR (2014)
Teresa Piovesan, Steven Kelk
A Simple Fixed Parameter Tractable Algorithm for Computing the Hybridization Number of Two (Not Necessarily Binary) Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 10 (1) (2013)
Leo van Iersel, Steven Kelk
Kernelizations for the hybridization number problem on multiple nonbinary trees. CoRR (2013)
Leo van Iersel, Steven Kelk, Nela Lekic, Céline Scornavacca
A Practical Approximation Algorithm for Solving Massive Instances of Hybridization Number. WABI (2012)
Steven Kelk, Céline Scornavacca
Towards the fixed parameter tractability of constructing minimal phylogenetic networks from arbitrary sets of nonbinary trees CoRR (2012)
Steven Kelk, Leo van Iersel, Nela Lekic, Simone Linz, Céline Scornavacca, Leen Stougie
Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set. SIAM J. Discret. Math. 26 (4) (2012)
Steven Kelk, Céline Scornavacca, Leo van Iersel
On the Elusiveness of Clusters. IEEE ACM Trans. Comput. Biol. Bioinform. 9 (2) (2012)
Leo van Iersel, Steven Kelk, Nela Lekic, Leen Stougie
Computing nonbinary agreement forests CoRR (2012)
Steven Kelk
A note on efficient computation of hybridization number via softwired clusters CoRR (2011)
Steven Kelk, Céline Scornavacca, Leo van Iersel
On the elusiveness of clusters CoRR (2011)
Katharina T. Huber, Leo van Iersel, Steven Kelk, Radoslaw Suchecki
A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 8 (3) (2011)
Leo van Iersel, Steven Kelk
Constructing the Simplest Possible Phylogenetic Network from Triplets. Algorithmica 60 (2) (2011)
Steven Kelk, Céline Scornavacca
Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable CoRR (2011)
Harry Buhrman, Peter T. S. van der Gulik, Steven Kelk, Wouter M. Koolen, Leen Stougie
Some Mathematical Refinements Concerning Error Minimization in the Genetic Code. IEEE ACM Trans. Comput. Biol. Bioinform. 8 (5) (2011)
Steven Kelk, Leo van Iersel, Nela Lekic, Simone Linz, Céline Scornavacca, Leen Stougie
Cycle killer... qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set. CoRR (2011)
Leo van Iersel, Steven Kelk, Regula Rupp, Daniel H. Huson
Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters. Bioinform. 26 (12) (2010)
Jaroslaw Byrka, Pawel Gawrychowski, Katharina T. Huber, Steven Kelk
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks. J. Discrete Algorithms 8 (1) (2010)
Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, Ferry Hagen, Teun Boekhout
Constructing Level-2 Phylogenetic Networks from Triplets. IEEE ACM Trans. Comput. Biol. Bioinform. 6 (4) (2009)
Leo van Iersel, Steven Kelk, Matthias Mnich
Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks. J. Bioinform. Comput. Biol. 7 (4) (2009)
Leo van Iersel, Steven Kelk
Constructing the Simplest Possible Phylogenetic Network from Triplets. ISAAC (2008)
Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie
Shorelines of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems. IEEE ACM Trans. Comput. Biol. Bioinform. 5 (2) (2008)
Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, Ferry Hagen, Teun Boekhout
Constructing Level-2 Phylogenetic Networks from Triplets. RECOMB (2008)
Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John Tromp
The Complexity of the Single Individual SNP Haplotyping Problem. Algorithmica 49 (1) (2007)
Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp
Prefix Reversals on Binary and Ternary Strings. AB (2007)
Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp
Prefix Reversals on Binary and Ternary Strings. SIAM J. Discret. Math. 21 (3) (2007)
Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie
Beaches of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems. WABI (2006)
Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John Tromp
On the Complexity of Several Haplotyping Problems. WABI (2005)
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random. SIAM J. Comput. 33 (2) (2004)
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
The complexity of choosing an H-colouring (nearly) uniformly at random. STOC (2002)