AAAAAA

   
Results: 1-12 |
Results: 12
AN RNA FOLDING METHOD CAPABLE OF IDENTIFYING PSEUDOKNOTS AND BASE TRIPLES
Authors: TABASKA JE CARY RB GABOW HN STORMO GD
Citation: Je. Tabaska et al., AN RNA FOLDING METHOD CAPABLE OF IDENTIFYING PSEUDOKNOTS AND BASE TRIPLES, BIOINFORMATICS, 14(8), 1998, pp. 691-699
ALGORITHMS FOR GRAPHIC POLYMATROIDS AND PARAMETRIC (S)OVER-BAR-SETS
Authors: GABOW HN
Citation: Hn. Gabow, ALGORITHMS FOR GRAPHIC POLYMATROIDS AND PARAMETRIC (S)OVER-BAR-SETS, Journal of algorithms, 26(1), 1998, pp. 48-86
AN EFFICIENT APPROXIMATION ALGORITHM FOR THE SURVIVABLE NETWORK DESIGN PROBLEM
Authors: GABOW HN GOEMANS MX WILLIAMSON DP
Citation: Hn. Gabow et al., AN EFFICIENT APPROXIMATION ALGORITHM FOR THE SURVIVABLE NETWORK DESIGN PROBLEM, Mathematical programming, 82(1-2), 1998, pp. 13-40
PACKING ALGORITHMS FOR ARBORESCENCES (AND SPANNING-TREES) IN CAPACITATED GRAPHS
Authors: GABOW HN MANU KS
Citation: Hn. Gabow et Ks. Manu, PACKING ALGORITHMS FOR ARBORESCENCES (AND SPANNING-TREES) IN CAPACITATED GRAPHS, Mathematical programming, 82(1-2), 1998, pp. 83-109
27TH ANNUAL ACM SYMPOSIUM ON THE THEORY OF COMPUTING (STOC95) - MAY 29 JUNE 1, 1995 - FOREWORD
Authors: GABOW HN
Citation: Hn. Gabow, 27TH ANNUAL ACM SYMPOSIUM ON THE THEORY OF COMPUTING (STOC95) - MAY 29 JUNE 1, 1995 - FOREWORD, Journal of computer and system sciences (Print), 57(1), 1998, pp. 1-1
EFFICIENT THEORETIC AND PRACTICAL ALGORITHMS FOR LINEAR MATROID INTERSECTION PROBLEMS
Authors: GABOW HN XU Y
Citation: Hn. Gabow et Y. Xu, EFFICIENT THEORETIC AND PRACTICAL ALGORITHMS FOR LINEAR MATROID INTERSECTION PROBLEMS, Journal of computer and system sciences, 53(1), 1996, pp. 129-147
CENTROIDS, REPRESENTATIONS, AND SUBMODULAR FLOWS
Authors: GABOW HN
Citation: Hn. Gabow, CENTROIDS, REPRESENTATIONS, AND SUBMODULAR FLOWS, Journal of algorithms, 18(3), 1995, pp. 586-628
A MATROID APPROACH TO FINDING EDGE-CONNECTIVITY AND PACKING ARBORESCENCES
Authors: GABOW HN
Citation: Hn. Gabow, A MATROID APPROACH TO FINDING EDGE-CONNECTIVITY AND PACKING ARBORESCENCES, Journal of computer and system sciences, 50(2), 1995, pp. 259-273
AN O[N(2)] DIVIDE-AND-CONQUER ALGORITHM FOR THE PRIME TREE DECOMPOSITION OF 2-STRUCTURES AND MODULAR DECOMPOSITION OF GRAPHS
Authors: EHRENFEUCHT A GABOW HN MCCONNELL RM SULLIVAN SJ
Citation: A. Ehrenfeucht et al., AN O[N(2)] DIVIDE-AND-CONQUER ALGORITHM FOR THE PRIME TREE DECOMPOSITION OF 2-STRUCTURES AND MODULAR DECOMPOSITION OF GRAPHS, Journal of algorithms, 16(2), 1994, pp. 283-294
NETWORK FLOW ALGORITHMS - FOREWORD
Authors: GABOW HN
Citation: Hn. Gabow, NETWORK FLOW ALGORITHMS - FOREWORD, Algorithmica, 11(3), 1994, pp. 197-199
22ND SYMPOSIUM ON THE THEORY OF COMPUTING - FOREWORD
Authors: GABOW HN
Citation: Hn. Gabow, 22ND SYMPOSIUM ON THE THEORY OF COMPUTING - FOREWORD, Journal of computer and system sciences, 47(3), 1993, pp. 375-375
FORESTS, FRAMES, AND GAMES - ALGORITHMS FOR MATROID SUMS AND APPLICATIONS
Authors: GABOW HN WESTERMANN HH
Citation: Hn. Gabow et Hh. Westermann, FORESTS, FRAMES, AND GAMES - ALGORITHMS FOR MATROID SUMS AND APPLICATIONS, Algorithmica, 7(5-6), 1992, pp. 465-497
Risultati: 1-12 |