( en | de | ru )

 

Disambiguation of "Fernández-Baca, David"

Author of the publication

copydeleteadd this publication to your clipboard
Using Sparsification for Parametric Minimum Spanning Tree Problems.

, , and . SWAT, volume 1097 of Lecture Notes in Computer Science, page 149-160. Springer, (1996)

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.

Bárbara Fernández Fernández

Fernando Fernández

Victoria Fernández

Asunción Fernández

Pablo Fernández

 

Other publications of authors with the same name

Constructing Majority-Rule Supertrees., , and . WABI, volume 5724 of Lecture Notes in Computer Science, page 73-84. Springer, (2009)Constructing the minimization diagram of a two-parameter problem., and . Oper. Res. Lett., 10 (2): 87-93 (1991)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)Parametric Problems on Graphs of Bounded Tree-Width., and . SWAT, volume 621 of Lecture Notes in Computer Science, page 304-316. Springer, (1992)EvoZip: Efficient Compression of Large Collections of Evolutionary Trees., , , and . CoRR, (2019)Characterizing compatibility and agreement of unrooted trees via cuts in graphs., and . Algorithms Mol. Biol., (2014)Incompatible quartets, triplets, and characters., , and . Algorithms Mol. Biol., (2013)Constructing and Employing Tree Alignment Graphs for Phylogenetic Synthesis., , and . CoRR, (2015)Fast Compatibility Testing for Rooted Phylogenetic Trees., and . Algorithmica, 80 (8): 2453-2477 (2018)Parametric analysis for ungapped Markov models of evolution., and . ACM Trans. Algorithms, 5 (4): 44:1-44:20 (2009)