default search action
Simone Linz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j28]Janosch Döcker, Simone Linz
:
On the existence of funneled orientations for classes of rooted phylogenetic networks. Theor. Comput. Sci. 1023: 114908 (2025) - 2024
- [j27]Janosch Döcker, Simone Linz
Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks. Adv. Appl. Math. 152: 102595 (2024) - [j26]Steven Kelk, Simone Linz
Deep kernelization for the Tree Bisection and Reconnection (TBR) distance in phylogenetics. J. Comput. Syst. Sci. 142: 103519 (2024) - [i19]Janosch Döcker, Simone Linz:
On the existence of funneled orientations for classes of rooted phylogenetic networks. CoRR abs/2401.05611 (2024) - 2023
- [j25]Steven Kelk, Simone Linz
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance. Inf. Process. Lett. 180: 106336 (2023) - [j24]Michael J. Dinneen, Pankaj S. Ghodla, Simone Linz
A QUBO formulation for the Tree Containment problem. Theor. Comput. Sci. 940(Part): 60-79 (2023) - [c3]Christian Komusiewicz, Simone Linz
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. CPM 2023: 18:1-18:18 - 2022
- [j23]Rim van Wersch, Steven Kelk, Simone Linz
Reflections on kernelizing and computing unrooted agreement forests. Ann. Oper. Res. 309(1): 425-451 (2022) - [j22]Simone Linz
Non-essential arcs in phylogenetic networks. J. Comput. Syst. Sci. 128: 1-17 (2022) - [j21]Magnus Bordewich
On the Maximum Agreement Subtree Conjecture for Balanced Trees. SIAM J. Discret. Math. 36(1): 336-354 (2022) - [i18]Steven Kelk, Simone Linz, Ruben Meuwese:
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance. CoRR abs/2202.09904 (2022) - [i17]Michael J. Dinneen, Pankaj S. Ghodla, Simone Linz:
A QUBO formulation for the Tree Containment problem. CoRR abs/2202.11234 (2022) - [i16]Steven Kelk, Simone Linz, Ruben Meuwese:
Deep kernelization for the Tree Bisection and Reconnnect (TBR) distance in phylogenetics. CoRR abs/2206.04451 (2022) - [i15]Janosch Döcker, Simone Linz, Charles Semple
Hypercubes and Hamiltonian Cycles of Display Sets of Rooted Phylogenetic Networks. CoRR abs/2211.06549 (2022) - 2021
- [j20]Janosch Döcker, Simone Linz
Display Sets of Normal and Tree-Child Networks. Electron. J. Comb. 28(1): 1 (2021) - 2020
- [j19]Janosch Döcker, Britta Dorn, Simone Linz
Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy. Theor. Comput. Sci. 822: 72-91 (2020) - [c2]Nguyet Tran, Michael J. Dinneen, Simone Linz:
Computing Close to Optimal Weighted Shortest Paths in Practice. ICAPS 2020: 291-299 - [c1]Nguyet Tran, Michael J. Dinneen, Simone Linz
Close Weighted Shortest Paths on 3D Terrain Surfaces. SIGSPATIAL/GIS 2020: 597-607 - [i14]Simone Linz, Charles Semple:
Caterpillars on three and four leaves are sufficient to reconstruct normal networks. CoRR abs/2002.00483 (2020) - [i13]Katharina T. Huber, Simone Linz, Vincent Moulton:
Weakly displaying trees in temporal tree-child network. CoRR abs/2004.02634 (2020) - [i12]Rim van Wersch, Steven Kelk, Simone Linz, Georgios Stamoulis:
Reflections on kernelizing and computing unrooted agreement forests. CoRR abs/2012.07354 (2020)
2010 – 2019
- 2019
- [j18]Simone Linz
Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies. Adv. Appl. Math. 105: 102-129 (2019) - [j17]Jonathan Klawitter
On the Subnet Prune and Regraft Distance. Electron. J. Comb. 26(2): 2 (2019) - [j16]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: 131-143 (2019) - [j15]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): 1556-1574 (2019) - [j14]Janosch Döcker, Simone Linz
Displaying trees across two phylogenetic networks. Theor. Comput. Sci. 796: 129-146 (2019) - [i11]Steven Kelk, Simone Linz:
New reduction rules for the tree bisection and reconnection distance. CoRR abs/1905.01468 (2019) - [i10]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 abs/1908.05361 (2019) - [i9]Magnus Bordewich, Britta Dorn, Simone Linz
Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443). Dagstuhl Reports 9(10): 134-151 (2019) - 2018
- [j13]Daniel H. Huson
Autumn Algorithm - Computation of Hybridization Networks for Realistic Phylogenetic Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 15(2): 398-410 (2018) - [j12]Janosch Döcker, Simone Linz
On the existence of a cherry-picking sequence. Theor. Comput. Sci. 714: 36-50 (2018) - [i8]Jonathan Klawitter, Simone Linz:
On the Subnet Prune and Regraft Distance. CoRR abs/1805.07839 (2018) - [i7]Steven Kelk, Simone Linz:
A tight kernel for computing the tree bisection and reconnection distance between two phylogenetic trees. CoRR abs/1811.06892 (2018) - 2017
- [i6]Janosch Döcker, Leo van Iersel, Steven Kelk, Simone Linz:
Deciding the existence of a cherry-picking sequence is hard on two trees. CoRR abs/1712.02965 (2017) - [i5]Janosch Döcker, Simone Linz:
On the existence of a cherry-picking sequence. CoRR abs/1712.04127 (2017) - [i4]Simone Linz, Charles Semple:
Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies. CoRR abs/1712.04131 (2017) - 2016
- [j11]Leo van Iersel, Steven Kelk, Nela Lekic, Simone Linz
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees. Theor. Comput. Sci. 609: 1-21 (2016) - 2014
- [i3]Leo van Iersel, Steven Kelk, Nela Lekic, Simone Linz:
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees. CoRR abs/1410.2371 (2014) - 2013
- [j10]Peter J. Humphries, Simone Linz
On the complexity of computing the temporal hybridization number for two phylogenies. Discret. Appl. Math. 161(7-8): 871-880 (2013) - [j9]Leo van Iersel, Simone Linz
A quadratic kernel for computing the hybridization number of multiple trees. Inf. Process. Lett. 113(9): 318-323 (2013) - [j8]Simone Linz
Counting Trees in a Phylogenetic Network Is \#P-Complete. SIAM J. Comput. 42(4): 1768-1776 (2013) - [j7]Simone Linz
Optimizing tree and character compatibility across several phylogenetic trees. Theor. Comput. Sci. 513: 129-136 (2013) - 2012
- [j6]Céline Scornavacca, Simone Linz
A First Step Toward Computing All Hybridization Networks For Two Rooted Binary Phylogenetic Trees. J. Comput. Biol. 19(11): 1227-1242 (2012) - [j5]Steven Kelk, Leo van Iersel, Nela Lekic, Simone Linz
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): 1635-1656 (2012) - [j4]Maria Luisa Bonet
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility. IEEE ACM Trans. Comput. Biol. Bioinform. 9(1): 273-285 (2012) - 2011
- [j3]Joshua Collins, Simone Linz
Quantifying Hybridization in Realistic Time. J. Comput. Biol. 18(10): 1305-1318 (2011) - [i2]Maria Luisa Bonet, Simone Linz, Katherine St. John:
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility. CoRR abs/1101.2170 (2011) - [i1]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 abs/1112.5359 (2011)
2000 – 2009
- 2009
- [j2]Simone Linz
Hybridization in Nonbinary Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 6(1): 30-45 (2009) - 2003
- [j1]Richard Münch, Karsten Hiller
PRODORIC: prokaryotic database of gene regulation. Nucleic Acids Res. 31(1): 266-269 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: