Simone Linz

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 36

Top Topics

Phylogenetic Trees

Tree Structures

Top Venues

Theor. Comput. Sci.

J. Comput. Syst. Sci.

Adv. Appl. Math.

Publications

Janosch Döcker, Simone Linz
On the existence of funneled orientations for classes of unrooted phylogenetic networks. CoRR (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)
Janosch Döcker, Simone Linz, Charles Semple
Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks. Adv. Appl. Math. 152 (2024)
Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. CPM (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)
Michael J. Dinneen, Pankaj S. Ghodla, Simone Linz
A QUBO formulation for the Tree Containment problem. Theor. Comput. Sci. 940 (Part) (2023)
Steven Kelk, Simone Linz, Ruben Meuwese
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance. CoRR (2022)
Janosch Döcker, Simone Linz, Charles Semple
Hypercubes and Hamiltonian Cycles of Display Sets of Rooted Phylogenetic Networks. CoRR (2022)
Michael J. Dinneen, Pankaj S. Ghodla, Simone Linz
A QUBO formulation for the Tree Containment problem. CoRR (2022)
Magnus Bordewich, Simone Linz, Megan Owen, Katherine St. John, Charles Semple, Kristina Wicke
On the Maximum Agreement Subtree Conjecture for Balanced Trees. SIAM J. Discret. Math. 36 (1) (2022)
Simone Linz, Charles Semple
Non-essential arcs in phylogenetic networks. J. Comput. Syst. Sci. 128 (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)
Janosch Döcker, Simone Linz, Charles Semple
Display Sets of Normal and Tree-Child Networks. Electron. J. Comb. 28 (1) (2021)
Nguyet Tran, Michael J. Dinneen, Simone Linz
Close Weighted Shortest Paths on 3D Terrain Surfaces. SIGSPATIAL/GIS (2020)
Katharina T. Huber, Simone Linz, Vincent Moulton
Weakly displaying trees in temporal tree-child network. CoRR (2020)
Rim van Wersch, Steven Kelk, Simone Linz, Georgios Stamoulis
Reflections on kernelizing and computing unrooted agreement forests. CoRR (2020)
Simone Linz, Charles Semple
Caterpillars on three and four leaves are sufficient to reconstruct normal networks. CoRR (2020)
Nguyet Tran, Michael J. Dinneen, Simone Linz
Computing Close to Optimal Weighted Shortest Paths in Practice. ICAPS (2020)
Janosch Döcker, Britta Dorn, Simone Linz, Charles Semple
Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy. Theor. Comput. Sci. 822 (2020)
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)
Janosch Döcker, Britta Dorn, Simone Linz, Charles Semple
Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy. CoRR (2019)
Simone Linz, Charles Semple
Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies. Adv. Appl. Math. 105 (2019)
Jonathan Klawitter, Simone Linz
On the Subnet Prune and Regraft Distance. Electron. J. Comb. 26 (2) (2019)
Magnus Bordewich, Britta Dorn, Simone Linz, Rolf Niedermeier
Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443). Dagstuhl Reports 9 (10) (2019)
Janosch Döcker, Simone Linz, Charles Semple
Displaying trees across two phylogenetic networks. Theor. Comput. Sci. 796 (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)
Janosch Döcker, Simone Linz
On the existence of a cherry-picking sequence. Theor. Comput. Sci. 714 (2018)
Jonathan Klawitter, Simone Linz
On the Subnet Prune and Regraft Distance. CoRR (2018)
Daniel H. Huson, Simone Linz
Autumn Algorithm - Computation of Hybridization Networks for Realistic Phylogenetic Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 15 (2) (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)
Janosch Döcker, Simone Linz
On the existence of a cherry-picking sequence. CoRR (2017)
Simone Linz, Charles Semple
Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies. CoRR (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)
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, Simone Linz
A quadratic kernel for computing the hybridization number of multiple trees. Inf. Process. Lett. 113 (9) (2013)
Simone Linz, Katherine St. John, Charles Semple
Counting Trees in a Phylogenetic Network Is \#P-Complete. SIAM J. Comput. 42 (4) (2013)
Peter J. Humphries, Simone Linz, Charles Semple
On the complexity of computing the temporal hybridization number for two phylogenies. Discret. Appl. Math. 161 (7-8) (2013)
Simone Linz, Katherine St. John, Charles Semple
Optimizing tree and character compatibility across several phylogenetic trees. Theor. Comput. Sci. 513 (2013)
Maria Luisa Bonet, Simone Linz, Katherine St. John
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility. IEEE ACM Trans. Comput. Biol. Bioinform. 9 (1) (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)
Céline Scornavacca, Simone Linz, Benjamin Albrecht
A First Step Toward Computing All Hybridization Networks For Two Rooted Binary Phylogenetic Trees. J. Comput. Biol. 19 (11) (2012)
Joshua Collins, Simone Linz, Charles Semple
Quantifying Hybridization in Realistic Time. J. Comput. Biol. 18 (10) (2011)
Maria Luisa Bonet, Simone Linz, Katherine St. John
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility CoRR (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)
Simone Linz, Charles Semple
Hybridization in Nonbinary Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 6 (1) (2009)
Richard Münch, Karsten Hiller, Heiko Barg, Dana Heldt, Simone Linz, Edgar Wingender, Dieter Jahn
PRODORIC: prokaryotic database of gene regulation. Nucleic Acids Res. 31 (1) (2003)