( en | de | ru )

 

Disambiguation of "Gusfield, Dan"

Author of the publication

copydeleteadd this publication to your clipboard
A Fast Algorithm for Optimally Increasing the Edge Connectivity.

, , and . SIAM J. Comput., 26 (4): 1139-1165 (1997)

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.

Marius Dan

Dan Wang

Dan Bauer

Dan Tidten

Dan Brüllmann

 

Other publications of authors with the same name

Gödel for Goldilocks: A Rigorous, Streamlined Proof of Gödel's First Incompleteness Theorem, Requiring Minimal Background.. CoRR, (2014)Haplotyping as perfect phylogeny: conceptual framework and efficient solutions.. RECOMB, page 166-175. ACM, (2002)Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event., , and . WABI, volume 3692 of Lecture Notes in Computer Science, page 152-164. Springer, (2005)Efficient and Practical Algorithms for Deducing the History of Recombination in Populations.. International Conference on Computational Science (2), volume 3992 of Lecture Notes in Computer Science, page 618-619. Springer, (2006)Haplotype Inference by Pure Parsimony.. CPM, volume 2676 of Lecture Notes in Computer Science, page 144-155. Springer, (2003)A new recombination lower bound and the minimum perfect phylogenetic forest problem., and . J. Comb. Optim., 16 (3): 229-247 (2008)Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test., and . SIAM J. Discret. Math., 6 (3): 460-476 (1993)Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination., , and . J. Bioinform. Comput. Biol., 2 (1): 173-214 (2004)A Faster Parametric Minimum-Cut Algorithm., and . Algorithmica, 11 (3): 278-290 (1994)Bounds for Naive Multiple Machine Scheduling with Release Times and Deadlines.. J. Algorithms, 5 (1): 1-6 (1984)