Graph triangulations and the compatibility of unrooted phylogenetic trees

The complexity of reconstructing trees from qualitative characters and subtrees

Journal of Classification · 1992 · 529 citations

Computing, Computer Science, Evolutionary Biology +12

Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions

A. V. Aho, Yehoshua Sagiv, Thomas G. Szymanski et al. · SIAM Journal on Computing · 1981 · 413 citations

Computing, Computer Science, Algebra +12

A characterisation of rigid circuit graphs

Peter Buneman · Discrete Mathematics · 1974 · 323 citations

Natural Sciences, Computer Science, Mathematics +8

Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves

A. D. Gordon · Journal of Classification · 1986 · 198 citations

Life Sciences, Plant Sciences, Plant Anatomy +4

Triangulating Vertex-Colored Graphs

F.R. McMorris, Tandy Warnow, Thomas Wimer · SIAM Journal on Discrete Mathematics · 1994 · 74 citations

Computing, Computer Science, Algorithms +7