Harold N. Gabow

发表

Efficient Algorithms for a Family of Matroid Intersection Problems

Robert E. Tarjan, Harold N. Gabow, R. Tarjan, 1984, J. Algorithms.

On the L∞-norm of extreme points for crossing supermodular directed network LPs

Harold N. Gabow, H. Gabow, 2007, Math. Program..

Forests, frames, and games: algorithms for matroid sums and applications

Harold N. Gabow, Herbert H. Westermann, 1988, STOC '88.

A Linear-Time Algorithm for a Special Case of Disjoint Set Union

Robert E. Tarjan, Harold N. Gabow, 1985, J. Comput. Syst. Sci..

Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings

Piotr Sankowski, Marek Cygan, Harold N. Gabow, 2012, FOCS.

A combinatoric interpretation of dual variables for weighted matching and f-factors

Harold N. Gabow, H. Gabow, 2012, Theor. Comput. Sci..

Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs

Harold N. Gabow, K. S. Manu, 1995, IPCO.

A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest

Robert E. Tarjan, Harold N. Gabow, 1988, Inf. Process. Lett..

Approximating the smallest k‐edge connected spanning subgraph by LP‐rounding

Éva Tardos, David P. Williamson, Michel X. Goemans, 2005, SODA '05.

A Data Structure for Nearest Common Ancestors with Linking

Harold N. Gabow, H. Gabow, 2016, ACM Trans. Algorithms.

A Counting Approach to Lower Bounds for Selection Problems

Harold N. Gabow, Frank Fussenegger, H. Gabow, 1979, JACM.

An efficient approximation algorithm for the survivable network design problem

David P. Williamson, Michel X. Goemans, Harold N. Gabow, 1998, Math. Program..

Efficient Implementation of Graph Algorithms Using Contraction

Zvi Galil, Harold N. Gabow, Thomas H. Spencer, 1984, FOCS.

A Note on Degree-Constrained Star Subgraphs of Bipartite Graphs

Harold N. Gabow, H. Gabow, 1976, Inf. Process. Lett..

Unique maximum matching algorithms

Haim Kaplan, Robert E. Tarjan, Harold N. Gabow, 1999, STOC '99.

The Minset-Poset Approach to Representations of Graph Connectivity

Harold N. Gabow, H. Gabow, 2016, ACM Trans. Algorithms.

Using expander graphs to find vertex connectivity

Harold N. Gabow, 2006, JACM.

Fast Algorithms for Transversal Matroid Intersection Problems

Ying Xu, Harold N. Gabow, H. Gabow, 1994, ISAAC.

On the Linfinity-Norm of Extreme Points for Crossing Supermodular Directed Network LPs

Harold N. Gabow, 2005, IPCO.

Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors

Piotr Sankowski, Harold N. Gabow, H. Gabow, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

An Almost-Linear Algorithm for Two-Processor Scheduling

Harold N. Gabow, H. Gabow, 1982, JACM.

Packing algorithms for arborescences (and spanning trees) in capacitated graphs

Harold N. Gabow, K. S. Manu, H. Gabow, 1995, Math. Program..

Bipartition constrained edge-splitting in directed graphs

Tibor Jordán, Harold N. Gabow, 2001, Discret. Appl. Math..

Algorithms for Two Bottleneck Optimization Problems

Robert E. Tarjan, Harold N. Gabow, R. Tarjan, 1988, J. Algorithms.

The limits of input-queued switch performance with future packet arrival information

Timothy X. Brown, Harold N. Gabow, 2003, Comput. Networks.

An RNA folding method capable of identifying pseudoknots and base triples

Gary D. Stormo, Harold N. Gabow, Jack E. Tabaska, 1998, Bioinform..

Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings

Piotr Sankowski, Marek Cygan, Harold N. Gabow, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Scheduling UET Systems on Two Uniform Processors and Length Two Pipelines

Harold N. Gabow, H. Gabow, 1988, SIAM J. Comput..

Data structures for weighted matching and nearest common ancestors with linking

Harold N. Gabow, H. Gabow, 1990, SODA '90.

Algorithms for Edge Coloring Bipartite Graphs and Multigraphs

Harold N. Gabow, Oded Kariv, O. Kariv, 1982, SIAM J. Comput..

A matroid approach to finding edge connectivity and packing arborescences

Harold N. Gabow, H. Gabow, 1991, STOC '91.

Scaling algorithms for network problems

Harold N. Gabow, H. Gabow, 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

Maximum flow-life curve for a wireless ad hoc network

Qi Zhang, Timothy X. Brown, Harold N. Gabow, 2001, MobiHoc '01.

Parallel tetrahedral mesh adaptation with dynamic load balancing

Leonid Oliker, Rupak Biswas, Harold N. Gabow, 2013, Parallel Comput..

Introduction to SODA 2002 and 2003 special issue

Michael A. Bender, Harold N. Gabow, Martin Farach-Colton, 2007, TALG.

Unique maximum matching algorithms

Haim Kaplan, Robert E. Tarjan, Harold N. Gabow, 1999, STOC '99.

Faster scaling algorithms for general graph matching problems

Robert E. Tarjan, Harold N. Gabow, R. Tarjan, 1991, JACM.

Set-merging for the Matching Algorithm of Micali and Vazirani pdf

Harold N. Gabow, 2015, ArXiv.

Centroids, Representations, and Submodular Flows

Harold N. Gabow, 1995, J. Algorithms.

An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a Multigraph

Harold N. Gabow, H. Gabow, 2005, SIAM J. Discret. Math..

Robert E. Tarjan, Harold N. Gabow, Jon Louis Bentley, 1984, STOC '84.

Some Improved Bounds on the Number of 1-Factors of n-Connected Graphs

Harold N. Gabow, 1976, Inf. Process. Lett..

Efficient Algorithms for Independent Assignment on Graphic Matroids ; CU-CS-468-90

Ying Xu, Harold N. Gabow, 1990 .

Efficient implementation of graph algorithms using contraction

Zvi Galil, Harold N. Gabow, Thomas H. Spencer, 1984, JACM.

Using computer trees to derive lower bounds for selection problems

Harold N. Gabow, Frank Fussenegger, 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms

Seth Pettie, Harold N. Gabow, H. Gabow, 2002, SWAT.

An augmenting path algorithm for linear matroid parity

Harold N. Gabow, Matthias F. Stallmann, H. Gabow, 1986, Comb..

A Linear-Time Recognition Algorithm for Interval Dags

Harold N. Gabow, 1981, Inf. Process. Lett..

Algorithmic proofs of two relations between connectivity and the 1-factors of a graph

Harold N. Gabow, 1979, Discret. Math..

Coloring Algorithms On Subcubic Graphs

Harold N. Gabow, San Skulrattanakulchai, 2004, Int. J. Found. Comput. Sci..

Finding Long Paths, Cycles and Circuits

Harold N. Gabow, Shuxin Nie, 2008, ISAAC.

Using expander graphs to find vertex connectivity

Harold N. Gabow, H. Gabow, 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

Edge-connectivity augmentation with partition constraints

Tibor Jordán, Jørgen Bang-Jensen, Zoltán Szigeti, 1998, SODA '98.

Graphs in Computer Science

Roberto Tamassia, Camil Demetrescu, Craig A. Tovey, 2003, Handbook of Graph Theory.

The Weighted Matching Approach to Maximum Cardinality Matching pdf

Harold N. Gabow, H. Gabow, 2017, Fundam. Informaticae.

A good algorithm for smallest spanning trees with a degree constraint

Harold N. Gabow, 1978, Networks.

On Two Problems in the Generation of Program Test Paths

Leon J. Osterweil, Harold N. Gabow, Shachindra N. Maheswari, 1976, IEEE Transactions on Software Engineering.

Perfect arborescence packing in preflow mincut graphs

Harold N. Gabow, 1996, SODA '96.

An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps

Fabio Somenzi, Harold N. Gabow, Roderick Bloem, 2000, Formal Methods Syst. Des..

A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis

Tadayoshi Kohno, Harold N. Gabow, H. Gabow, 2001, JEAL.

An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

Harold N. Gabow, H. Gabow, 1976, JACM.

A Model for Minimizing Active Processor Time

Samir Khuller, Harold N. Gabow, Jessica Chang, 2013, Algorithmica.

Incrementing Bipartite Digraph Edge-Connectivity

Tibor Jordán, Harold N. Gabow, H. Gabow, 2000, J. Comb. Optim..

Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs

Silvio Micali, Zvi Galil, Harold N. Gabow, 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

Applications of a poset representation to edge connectivity and graph rigidity

Harold N. Gabow, H. Gabow, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

A representation for crossing set families with applications to submodular flow problems

Harold N. Gabow, H. Gabow, 1993, SODA '93.

Iterated rounding algorithms for the smallest k-edge connected spanning subgraph

Harold N. Gabow, Suzanne Gallagher, H. Gabow, 2008, SODA '08.

Almost-optimum speed-ups of algorithms for bipartite matching and related problems

Robert E. Tarjan, Harold N. Gabow, 1988, STOC '88.

An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs

Andrzej Ehrenfeucht, Ross M. McConnell, Harold N. Gabow, 1994, J. Algorithms.

Performance Analysis and Portability of the PLUM Load Balancing System

Leonid Oliker, Rupak Biswas, Harold N. Gabow, 1998, Euro-Par.

A matroid approach to finding edge connectivity and packing arborescences

Harold N. Gabow, 1991, STOC '91.

Editor's foreword

Harold N. Gabow, 2005, TALG.

Two Algorithms for Generating Weighted Spanning Trees in Order

Harold N. Gabow, H. Gabow, 1977, SIAM J. Comput..

Upper degree-constrained partial orientations

Harold N. Gabow, H. Gabow, 2006, SODA '06.

Finding a long directed cycle

Harold N. Gabow, Shuxin Nie, 2004, SODA '04.

How to make a square grid framework with cables rigid

Tibor Jordán, Harold N. Gabow, H. Gabow, 2000, SODA '99.

Forests, frames, and games: Algorithms for matroid sums and applications

Harold N. Gabow, Herbert H. Westermann, H. Gabow, 1992, STOC '88.

Maximum flow-life curve for a wireless ad hoc network

Qi Zhang, Harold N. Gabow, Timthoy X. Brown, 2001, MobiHoc '01.

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007

Harold N. Gabow, 2007, SODA.

Computing Vertex Connectivity: New Bounds from Old Techniques

Satish Rao, Monika Henzinger, Harold N. Gabow, 2000, J. Algorithms.

An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph

Harold N. Gabow, H. Gabow, 2002, SODA '02.

Efficient splitting off algorithms for graphs

Harold N. Gabow, H. Gabow, 1994, STOC '94.

Finding All Spanning Trees of Directed and Undirected Graphs

Eugene W. Myers, Harold N. Gabow, E. Myers, 1978, SIAM J. Comput..

Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph

Harold N. Gabow, 2003, SODA '03.

Path-based depth-first search for strong and biconnected components

Harold N. Gabow, H. Gabow, 2000, Inf. Process. Lett..

An Augmenting Path Algorithm for the Parity Problem on Linear Matroids

Harold N. Gabow, Matthias F. Stallmann, H. Gabow, 1984, FOCS.

Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs

Silvio Micali, Zvi Galil, Harold N. Gabow, 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

A scaling algorithm for weighted matching on general graphs

Harold N. Gabow, H. Gabow, 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems

Harold N. Gabow, H. Gabow, 1983, STOC.

Coloring Algorithms On Subcubic Graphs

Harold N. Gabow, San Skulrattanakulchai, H. Gabow, 2002, Int. J. Found. Comput. Sci..

Using euler partitions to edge color bipartite multigraphs

Harold N. Gabow, H. Gabow, 1976, International Journal of Computer & Information Sciences.

Almost-Optimum Parallel Speed-Ups of Algorithms for Bipartite Matching and Related Problems ; CU-CS-425-89

Robert E. Tarjan, Harold N. Gabow, R. Tarjan, 1989 .

Computing vertex connectivity: new bounds from old techniques

Satish Rao, Monika Henzinger, Harold N. Gabow, 1996, Proceedings of 37th Conference on Foundations of Computer Science.

Editor's foreword

Harold N. Gabow, 1994, Algorithmica.

Efficient algorithms for independent assignment on graphic and linear matroids

Ying Xu, Harold N. Gabow, H. Gabow, 1989, 30th Annual Symposium on Foundations of Computer Science.

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Robert E. Tarjan, Zvi Galil, Harold N. Gabow, 1986, Comb..

Algorithms for edge coloring bipartite graphs

Harold N. Gabow, Oded Kariv, 1978, STOC '78.

A framework for cost-scaling algorithms for submodular flow problems

Harold N. Gabow, 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

A linear-time algorithm for a special case of disjoint set union

Robert E. Tarjan, Harold N. Gabow, R. Tarjan, 1983, J. Comput. Syst. Sci..

Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems

Ying Xu, Harold N. Gabow, H. Gabow, 1996, J. Comput. Syst. Sci..

Finding paths and cycles of superpolylogarithmic length

Harold N. Gabow, H. Gabow, 2004, STOC '04.

Efficient Algorithms for Graphic Intersection and Parity (Extended Abstract)

Harold N. Gabow, Matthias F. Stallmann, 1985 .

Finding Paths and Cycles of Superpolylogarithmic Length

Harold N. Gabow, 2007, SIAM J. Comput..

Protein domain decomposition using a graph-theoretic approach

Ying Xu, Dong Xu, Harold N. Gabow, 2000, Bioinform..

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005

Ronald Fagin, Harold N. Gabow, Ronald Fagin, 2005, STOC.

An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps

Fabio Somenzi, Harold N. Gabow, Roderick Bloem, 2006, Formal Methods Syst. Des..

Algorithms for graphic polymatroids and parametric s-Sets

Harold N. Gabow, H. Gabow, 1995, SODA '95.

Scaling Algorithms for Network Problems

Harold N. Gabow, 1985, J. Comput. Syst. Sci..

Faster Scaling Algorithms for Network Problems

Robert E. Tarjan, Harold N. Gabow, R. Tarjan, 1989, SIAM J. Comput..

Special edges, and approximating the smallest directed k-edge connected spanning subgraph

Harold N. Gabow, 2004, SODA '04.

Efficient algorithms for simple matroid intersection problems

Robert E. Tarjan, Harold N. Gabow, R. Tarjan, 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation

Robert E. Tarjan, Harold N. Gabow, James R. Driscoll, 1988, CACM.

Data Structures for Weighted Matching and Extensions to b-matching and f-factors

Harold N. Gabow, H. Gabow, 2016, ACM Trans. Algorithms.

Foreword to special issue on SODA 2007

Harold N. Gabow, 2009, TALG.

Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors

Piotr Sankowski, Harold N. Gabow, 2021, SIAM J. Comput..

Blocking Trails for f-factors of Multigraphs pdf

Harold N. Gabow, H. Gabow, 2021, Algorithmica.

Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths

Piotr Sankowski, Harold N. Gabow, 2021, SIAM J. Comput..

Fibonacci Heaps with Applications to Parallel Computation

Robert E. Tarjan, Harold N. Gabow, Ruth Shrairman, 1988 .

A Linear-Time Algorithm for a Special Case of Disjoint Set Union ; CU-CS-261-82

Robert E. Tarjan, Harold N. Gabow, R. Tarjan, 1984 .