Author of the publication

Fast Local Search for Unrooted Robinson-Foulds Supertrees.

, , and . ISBRA, volume 6674 of Lecture Notes in Computer Science, page 184-196. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Constructing and Employing Tree Alignment Graphs for Phylogenetic Synthesis., , and . CoRR, (2015)Simple Algorithms for Perfect Phylogeny and Triangulating Colored Graphs., and . Int. J. Found. Comput. Sci., 7 (1): 11-22 (1996)Fast Algorithms for Inferring Evolutionary Trees., , and . J. Comput. Biol., 2 (3): 397-407 (1995)Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs., and . LATIN, volume 911 of Lecture Notes in Computer Science, page 257-271. Springer, (1995)Constructing the minimization diagram of a two-parameter problem., and . Oper. Res. Lett., 10 (2): 87-93 (1991)Parametric Problems on Graphs of Bounded Tree-Width., and . SWAT, volume 621 of Lecture Notes in Computer Science, page 304-316. Springer, (1992)Constructing Majority-Rule Supertrees., , and . WABI, volume 5724 of Lecture Notes in Computer Science, page 73-84. Springer, (2009)Testing the Agreement of Trees with Internal Labels., and . ISBRA, volume 12304 of Lecture Notes in Computer Science, page 127-139. Springer, (2020)Graph triangulations and the compatibility of unrooted phylogenetic trees., and . Appl. Math. Lett., 24 (5): 719-723 (2011)Fast Compatibility Testing for Rooted Phylogenetic Trees., and . CPM, volume 54 of LIPIcs, page 12:1-12:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)