Skip to main content

and
  1. No Access

    Article

    Fast Compatibility Testing for Rooted Phylogenetic Trees

    We present a new graph-based approach to the following basic problem in phylogenetic tree construction. Let $$\mathcal {P}= \{T_1, \ld...

    Yun Deng, David Fernández-Baca in Algorithmica (2018)

  2. Article

    Editorial

    David Fernández-Baca in Algorithmica (2014)

  3. No Access

    Article

    On the efficiency of maximum-flow algorithms on networks with small integer capacities

    The performance of maximum-flow algoirthms that work in phases is studied as a function of the maximum arc capacity,C, of the network and a quantity we call thetotal potential, P, of the network, which is related...

    David Fernández-Baca, Charles U. Martel in Algorithmica (1989)