Connectivity and Edge-Disjoint Spanning Trees. - Dan Gusfield (Inf. Process. Lett., 1983)

A note on Arc tolerances in sparse shortest-path and network flow problems. - Dan Gusfield (Networks, 1983)

Simple Construction for Multi-Terminal Network Flow Synthesis. - Dan Gusfield (SIAM J. Comput., 1983)

Parametric Combinatorial Computing and a Problem of Program Module Distribution - Dan Gusfield (J. ACM, 1983)

Matroid optimization with the interleaving of two ordered sets. - Dan Gusfield (Discret. Appl. Math., 1984)

Bounds for Naive Multiple Machine Scheduling with Release Times and Deadlines. - Dan Gusfield (J. Algorithms, 1984)

Data structures and algorithms, by A. Aho, J. Hopcroft, and J. Ullman, Addison-Wesley, Reading, Mass., 1983, 427 pp. Price: $28.85. - Dan Gusfield (Networks, 1985)

Equivalent Approximation Algorithms for Node Cover. - Dan Gusfield; Leonard Pitt (Inf. Process. Lett., 1986)

An efficient algorithm for the "optimal" stable marriage. - Robert W. Irving; Paul Leather; Dan Gusfield (J. ACM, 1987)

Every finite distributive lattice is a set of stable matchings for a small stable marriage instance. - Dan Gusfield; Robert W. Irving; Paul Leather; Michael E. Saks (J. Comb. Theory A, 1987)

Three Fast Algorithms for Four Problems in Stable Marriage. - Dan Gusfield (SIAM J. Comput., 1987)

Optimal Mixed Graph Augmentation. - Dan Gusfield (SIAM J. Comput., 1987)

Fast Algorithms for Bipartite Network Flow. - Dan Gusfield; Charles U. Martel; David Fernández-Baca (SIAM J. Comput., 1987)

A Graph Theoretic Approach to Statistical Data Security. - Dan Gusfield (SIAM J. Comput., 1988)

The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments. - Dan Gusfield (SIAM J. Comput., 1988)

The Stable marriage problem - structure and algorithms. - Dan Gusfield; Robert W. Irving (MIT Press, 1989)

Parametric Stable Marriage and Minimum Cuts. - Dan Gusfield; Robert W. Irving (Inf. Process. Lett., 1989)

A Fast Parallel Quicksort Algorithm. - Charles U. Martel; Dan Gusfield (Inf. Process. Lett., 1989)

A Little Knowledge Goes a Long Way: Faster Detection of Compromised Data in 2-D Tables. - Dan Gusfield (S&P, 1990)

Very Simple Methods for All Pairs Network Flow Analysis. - Dan Gusfield (SIAM J. Comput., 1990)

Efficient algorithms for inferring evolutionary trees. - Dan Gusfield (Networks, 1991)

Efficient algorithms for generalized cut-trees. - Dan Gusfield; Dalit Naor (Networks, 1991)

Computing the Strength of a Graph. - Dan Gusfield (SIAM J. Comput., 1991)

Потоковые Алгоритмы (Flow Algorithms) (G. M. Adel'son-Vel'ski, E. A. Dinits, and A. V. Karzanov). - Andrew V. Goldberg; Dan Gusfield (SIAM Rev., 1991)

A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications. - Dan Gusfield; Charles U. Martel (Algorithmica, 1992)

A Bounded Approximation for the Minimum Cost 2-Sat Problem. - Dan Gusfield; Leonard Pitt (Algorithmica, 1992)

An Efficient Algorithm for the All Pairs Suffix-Prefix Problem. - Dan Gusfield; Gad M. Landau; Baruch Schieber (Inf. Process. Lett., 1992)

Extracting Maximal Information About Sets of Minimum Cuts. - Dan Gusfield; Dalit Naor (Algorithmica, 1993)

Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test. - Ming-Yang Kao; Dan Gusfield (SIAM J. Discret. Math., 1993)

Parametric Optimization of Sequence Alignment. - Dan Gusfield; K. Balasubramanian; Dalit Naor (Algorithmica, 1994)

A Faster Parametric Minimum-Cut Algorithm. - Dan Gusfield; Éva Tardos (Algorithmica, 1994)

Faster Implementation of a Shortest Superstring Approximation. - Dan Gusfield (Inf. Process. Lett., 1994)

Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology - Dan Gusfield (Cambridge University Press, 1997)

Improved Approximation Algorithms for Tree Alignment. - Lusheng Wang 001; Dan Gusfield (J. Algorithms, 1997)

A Fast Algorithm for Optimally Increasing the Edge Connectivity. - Dalit Naor; Dan Gusfield; Charles U. Martel (SIAM J. Comput., 1997)

Algorithms on Stings, Trees, and Sequences: Computer Science and Computational Biology. - Dan Gusfield (SIGACT News, 1997)

Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version). - Jens Stoye; Dan Gusfield (CPM, 1998)

New uses for uniform lifted alignments. - Dan Gusfield; Lusheng Wang 001 (Mathematical Support for Molecular Biology, 1998)

Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem. - Dan Gusfield; Richard M. Karp; Lusheng Wang 001; Paul Stelling (Discret. Appl. Math., 1998)

Reconstructing a History of Recombinations From a Set of Sequences. - John D. Kececioglu; Dan Gusfield (Discret. Appl. Math., 1998)

Constructing Additive Trees When the Error Is Small. - Lusheng Wang 001; Dan Gusfield (J. Comput. Biol., 1998)

Tresholds for Sports Elimination Numbers Algorithms and Complexity. - Dan Gusfield; Charles U. Martel (WADS, 1999)

Guest Editors' Foreword. - Dan Gusfield; Ming-Yang Kao (Algorithmica, 1999)

A Practical Algorithm for Optimal Inference of Haplotypes from Diploid Populations. - Dan Gusfield (ISMB, 2000)

A More Efficient Approximation Scheme for Tree Alignment. - Lusheng Wang 001; Tao Jiang 001; Dan Gusfield (SIAM J. Comput., 2000)

Inference of Haplotypes from Samples of Diploid Populations: Complexity and Algorithms. - Dan Gusfield (J. Comput. Biol., 2001)

Suffix Trees (and Relatives) Come of Age in Bioinformatics. - Dan Gusfield (CSB, 2002)

Haplotyping as perfect phylogeny: conceptual framework and efficient solutions. - Dan Gusfield (RECOMB, 2002)

An Overview of Combinatorial Methods for Haplotype Inference. - Dan Gusfield (Computational Methods for SNPs and Haplotype Inference, 2002)

String barcoding: uncovering optimal virus signatures. - Sam Rash; Dan Gusfield (RECOMB, 2002)

The Structure and Complexity of Sports Elimination Numbers. - Dan Gusfield; Charles U. Martel (Algorithmica, 2002)

Partition-distance: A problem and class of perfect graphs arising in clustering. - Dan Gusfield (Inf. Process. Lett., 2002)

Simple and flexible detection of contiguous repeats using a suffix tree. - Jens Stoye; Dan Gusfield (Theor. Comput. Sci., 2002)

Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers. - Ren Hua Chung; Dan Gusfield (COCOON, 2003)

Haplotype Inference by Pure Parsimony. - Dan Gusfield (CPM, 2003)

Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination. - Dan Gusfield; Satish Eddhu; Charles H. Langley (CSB, 2003)

An Overview of Haplotyping via Perfect Phylogeny: Theory, Algorithms and Programs. - Dan Gusfield (ICTAI, 2003)

Perfect phylogeny haplotyper: haplotype inferral using a tree model. - Ren Hua Chung; Dan Gusfield (Bioinform., 2003)

Haplotyping as Perfect Phylogeny: A Direct Approach. - Vineet Bafna; Dan Gusfield; Giuseppe Lancia; Shibu Yooseph (J. Comput. Biol., 2003)

On the Complexity of Fundamental Computational Problems in Pedigree Analysis. - Antonio Piccolboni; Dan Gusfield (J. Comput. Biol., 2003)

Neuroanatomical term generation and comparison between two terminologies. - Prashanti R. Srinivas; Daniel Gusfield; Oliver Mason; Michael Gertz 001; Michael A. Hogarth; James M. Stone; Edward G. Jones; Fredric Gorin (Neuroinformatics, 2003)

Invited Talk: Phylogenetic Networks with Constrained and Unconstrained Recombination. - Dan Gusfield (German Conference on Bioinformatics, 2004)

The Fine Structure of Galls in Phylogenetic Networks. - Dan Gusfield; Satish Eddhu; Charles H. Langley (INFORMS J. Comput., 2004)

Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination. - Dan Gusfield; Satish Eddhu; Charles H. Langley (J. Bioinform. Comput. Biol., 2004)

A Note on Efficient Computation of Haplotypes via Perfect Phylogeny. - Vineet Bafna; Dan Gusfield; Sridhar Hannenhalli; Shibu Yooseph (J. Comput. Biol., 2004)

Linear time algorithms for finding and representing all the tandem repeats in a string. - Dan Gusfield; Jens Stoye (J. Comput. Syst. Sci., 2004)

Introduction of New Associate Editors. - Dan Gusfield (IEEE ACM Trans. Comput. Biol. Bioinform., 2004)

Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution. - Yun S. Song; Yufeng Wu; Dan Gusfield (ISMB (Supplement of Bioinformatics), 2005)

A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters. - Dan Gusfield; Vikas Bansal 001 (RECOMB, 2005)

Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event. - Yun S. Song; Yufeng Wu; Dan Gusfield (WABI, 2005)

Preface: Special RECOMB 2004 Issue. - Dan Gusfield (J. Comput. Biol., 2005)

Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination. - Dan Gusfield (J. Comput. Syst. Sci., 2005)

Editorial-State of the Transaction. - Dan Gusfield (IEEE ACM Trans. Comput. Biol. Bioinform., 2005)

Efficient and Practical Algorithms for Deducing the History of Recombination in Populations. - Dan Gusfield (International Conference on Computational Science (2), 2006)

A Linear-Time Algorithm for the Perfect Phylogeny Haplotyping (PPH) Problem. - Zhihong Ding; Vladimir Filkov; Dan Gusfield (J. Comput. Biol., 2006)

State of the Journal. - Dan Gusfield (IEEE ACM Trans. Comput. Biol. Bioinform., 2006)

Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data. - Dan Gusfield; Yelena Frid; Daniel G. Brown 001 (COCOON, 2007)

Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants. - Yufeng Wu; Dan Gusfield (CPM, 2007)

An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study. - Dan Gusfield; Dean Hickerson; Satish Eddhu (Discret. Appl. Math., 2007)

Efficient Computation of Minimum Recombination with genotypes (not Haplotypes). - Yufeng Wu; Dan Gusfield (J. Bioinform. Comput. Biol., 2007)

A Decomposition Theory for Phylogenetic Networks and Incompatible Characters. - Dan Gusfield; Vikas Bansal 001; Vineet Bafna; Yun S. Song (J. Comput. Biol., 2007)

Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations. - Yun S. Song; Zhihong Ding; Dan Gusfield; Charles H. Langley; Yufeng Wu (J. Comput. Biol., 2007)

Associate Editor Appreciation and Welcome. - Dan Gusfield (IEEE ACM Trans. Comput. Biol. Bioinform., 2007)

ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations. - Dan Gusfield (CPM, 2008)

A new recombination lower bound and the minimum perfect phylogenetic forest problem. - Yufeng Wu; Dan Gusfield (J. Comb. Optim., 2008)

EIC Editorial. - Dan Gusfield (IEEE ACM Trans. Comput. Biol. Bioinform., 2008)

A Simple, Practical and Complete O( fracn3 logn)O( frac{n^3}{ log n})-Time Algorithm for RNA Folding Using the Four-Russians Speedup. - Yelena Frid; Dan Gusfield (WABI, 2009)

Generalizing the Four Gamete Condition and Splits Equivalence Theorem: Perfect Phylogeny on Three State Characters. - Fumei Lam; Dan Gusfield; Srinath Sridhar 001 (WABI, 2009)

Editorial. - Dan Gusfield; Anna Tramontano (Bioinform., 2009)

The Three-state Perfect Phylogeny Problem Reduces to 2-SAT. - Dan Gusfield; Yufeng Wu (Commun. Inf. Syst., 2009)

Final, Five-Year End, Editorial. - Dan Gusfield (IEEE ACM Trans. Comput. Biol. Bioinform., 2009)

Outgoing EIC Editorial for this Special Section of TCBB with the Theme of Phylogenetics. - Dan Gusfield (IEEE ACM Trans. Comput. Biol. Bioinform., 2009)

Extensions and Improvements to the Chordal Graph Approach to the Multi-state Perfect Phylogeny Problem. - Rob Gysel; Dan Gusfield (ISBRA, 2010)

A Worst-Case and Practical Speedup for the RNA Co-folding Problem Using the Four-Russians Idea. - Yelena Frid; Dan Gusfield (WABI, 2010)

Reducing Multi-state to Binary Perfect Phylogeny with Applications to Missing, Removable, Inserted, and Deleted Data. - Kristian Stevens; Dan Gusfield (WABI, 2010)

A simple, practical and complete O-time Algorithm for RNA folding using the Four-Russians Speedup. - Yelena Frid; Dan Gusfield (Algorithms Mol. Biol., 2010)

The Multi-State Perfect Phylogeny Problem with Missing and Removable Data: Solutions via Integer-Programming and Chordal Graph Theory. - Dan Gusfield (J. Comput. Biol., 2010)

Untangling Tanglegrams: Comparing Trees by Their Drawings. - Balaji Venkatachalam; Jim Apple; Katherine St. John; Dan Gusfield (IEEE ACM Trans. Comput. Biol. Bioinform., 2010)

Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters. - Fumei Lam; Dan Gusfield; Srinath Sridhar 001 (SIAM J. Discret. Math., 2011)

Extensions and Improvements to the Chordal Graph Approach to the Multistate Perfect Phylogeny Problem. - Rob Gysel; Dan Gusfield (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

Speedup of RNA Pseudoknotted Secondary Structure Recurrence Computation with the Four-Russians Method. - Yelena Frid; Dan Gusfield (COCOA, 2012)

Reducing Problems in Unrooted Tree Compatibility to Restricted Triangulations of Intersection Graphs. - Rob Gysel; Kristian Stevens; Dan Gusfield (WABI, 2012)

Constructing perfect phylogenies and proper triangulations for three-state characters. - Rob Gysel; Fumei Lam; Dan Gusfield (Algorithms Mol. Biol., 2012)

Triangulation heuristics for maximum character compatibility. - Rob Gysel; Dan Gusfield; Kristian Stevens (ICCABS, 2013)

Faster algorithms for RNA-folding using the Four-Russians method. - Balaji Venkatachalam; Dan Gusfield; Yelena Frid (Algorithms Mol. Biol., 2014)

Gödel for Goldilocks: A Rigorous, Streamlined Proof of Gödel's First Incompleteness Theorem, Requiring Minimal Background. - Dan Gusfield (CoRR, 2014)

Persistent phylogeny: a galled-tree and integer linear programming approach. - Dan Gusfield (BCB, 2015)

Construction, enumeration, and optimization of perfect phylogenies on multi-state data. - Michael J. Coulombe; Kristian Stevens; Dan Gusfield (ICCABS, 2015)

A Sparsified Four-Russian Algorithm for RNA Folding. - Yelena Frid; Dan Gusfield (WABI, 2015)

Association Mapping for Compound Heterozygous Traits Using Phenotypic Distance and Integer Programming. - Dan Gusfield; Rasmus Nielsen (WABI, 2015)

Minimum Average Distance Clique Trees. - Shou-Jun Xu; Rob Gysel; Dan Gusfield (SIAM J. Discret. Math., 2015)

An improved Four-Russians method and sparsified Four-Russians algorithm for RNA folding. - Yelena Frid; Dan Gusfield (Algorithms Mol. Biol., 2016)

A Resolution of the Static Formulation Question for the Problem of Computing the History Bound. - Julia Matsieva; Steven Kelk; Céline Scornavacca; Chris Whidden; Dan Gusfield (IEEE ACM Trans. Comput. Biol. Bioinform., 2017)

Integer Linear Programming in Computational and Systems Biology: Tutorial. - Dan Gusfield (BCB, 2019)

Comparing Integer Linear Programming to SAT-Solving for Hard Problems in Computational and Systems Biology. - Hannah Brown; Lei Zuo 004; Dan Gusfield (AlCoB, 2020)

Unified SAT-Solving for Hard Problems of Phylogenetic Network Construction. - Dan Gusfield; Hannah Brown (ICCABS, 2021)

Matrix Chain Multiplication and Polygon Triangulation Revisited and Generalized. - Thong Le; Dan Gusfield (CoRR, 2021)