Harold N. Gabow

ORCID

Publication Activity (10 Years)

Years Active: 1975-2023
Publications (10 Years): 16

Top Venues

CoRR

ACM Trans. Algorithms

Algorithmica

SIAM J. Comput.

Publications

Harold N. Gabow
Blocking Trails for f-factors of Multigraphs. Algorithmica 85 (10) (2023)
Harold N. Gabow
m). CoRR (2023)
Harold N. Gabow
A Weight-Scaling Algorithm for f-Factors of Multigraphs. Algorithmica 85 (10) (2023)
Harold N. Gabow, Piotr Sankowski
-factors and the Special Case of Shortest Paths. SIAM J. Comput. 50 (2) (2021)
Harold N. Gabow, Piotr Sankowski
-factors. SIAM J. Comput. 50 (2) (2021)
Harold N. Gabow
Blocking Trails for f-factors of Multigraphs. CoRR (2021)
Harold N. Gabow
A Weight-scaling Algorithm for f-factors of Multigraphs. CoRR (2020)
Harold N. Gabow
-factors. ACM Trans. Algorithms 14 (3) (2018)
Harold N. Gabow
The Weighted Matching Approach to Maximum Cardinality Matching. CoRR (2017)
Harold N. Gabow
A Data Structure for Nearest Common Ancestors with Linking. ACM Trans. Algorithms 13 (4) (2017)
Harold N. Gabow
The Weighted Matching Approach to Maximum Cardinality Matching. Fundam. Informaticae 154 (1-4) (2017)
Harold N. Gabow
The Minset-Poset Approach to Representations of Graph Connectivity. ACM Trans. Algorithms 12 (2) (2016)
Harold N. Gabow
A Data Structure for Nearest Common Ancestors with Linking. CoRR (2016)
Harold N. Gabow
Data Structures for Weighted Matching and Extensions to $b$-matching and $f$-factors. CoRR (2016)
Marek Cygan, Harold N. Gabow, Piotr Sankowski
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings. J. ACM 62 (4) (2015)
Harold N. Gabow
Set-merging for the Matching Algorithm of Micali and Vazirani. CoRR (2015)
Jessica Chang, Harold N. Gabow, Samir Khuller
A Model for Minimizing Active Processor Time. Algorithmica 70 (3) (2014)
Harold N. Gabow, Piotr Sankowski
Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors. FOCS (2013)
Harold N. Gabow, Piotr Sankowski
Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and f-Factors CoRR (2013)
Harold N. Gabow
A combinatoric interpretation of dual variables for weighted matching and f-factors. Theor. Comput. Sci. 454 (2012)
Jessica Chang, Harold N. Gabow, Samir Khuller
A Model for Minimizing Active Processor Time CoRR (2012)
Harold N. Gabow, Suzanne Gallagher
-Edge Connected Spanning Subgraph. SIAM J. Comput. 41 (1) (2012)
Marek Cygan, Harold N. Gabow, Piotr Sankowski
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings CoRR (2012)
Marek Cygan, Harold N. Gabow, Piotr Sankowski
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings. FOCS (2012)
Jessica Chang, Harold N. Gabow, Samir Khuller
A Model for Minimizing Active Processor Time. ESA (2012)
Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson
-edge connected spanning subgraph by LP-rounding. Networks 53 (4) (2009)
Harold N. Gabow
Foreword to special issue on SODA 2007. ACM Trans. Algorithms 5 (3) (2009)
Harold N. Gabow, Shuxin Nie
Finding Long Paths, Cycles and Circuits. ISAAC (2008)
Harold N. Gabow, Shuxin Nie
Finding a long directed cycle. ACM Trans. Algorithms 4 (1) (2008)
Harold N. Gabow, Suzanne Gallagher
-edge connected spanning subgraph. SODA (2008)
Harold N. Gabow
Finding Paths and Cycles of Superpolylogarithmic Length. SIAM J. Comput. 36 (6) (2007)
Harold N. Gabow, Michael A. Bender, Martin Farach-Colton
Introduction to SODA 2002 and 2003 special issue. ACM Trans. Algorithms 3 (4) (2007)
Harold N. Gabow
-norm of extreme points for crossing supermodular directed network LPs. Math. Program. 110 (1) (2007)
Harold N. Gabow
Using expander graphs to find vertex connectivity. J. ACM 53 (5) (2006)
Harold N. Gabow
Upper degree-constrained partial orientations. SODA (2006)
Roderick Bloem, Harold N. Gabow, Fabio Somenzi
Symbolic Steps. Formal Methods Syst. Des. 28 (1) (2006)
Harold N. Gabow
Editor's foreword. ACM Trans. Algorithms 1 (1) (2005)
Harold N. Gabow
An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a Multigraph. SIAM J. Discret. Math. 19 (1) (2005)
Harold N. Gabow
-Norm of Extreme Points for Crossing Supermodular Directed Network LPs. IPCO (2005)
Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson
-edge connected spanning subgraph by LP-rounding. SODA (2005)
San Skulrattanakulchai, Harold N. Gabow
Coloring Algorithms On Subcubic Graphs. Int. J. Found. Comput. Sci. 15 (1) (2004)
Harold N. Gabow
-edge connected spanning subgraph. SODA (2004)
Harold N. Gabow
An Ear Decomposition Approach to Approximating the Smallest 3-Edge Connected Spanning Subgraph of a Multigraph. SIAM J. Discret. Math. 18 (1) (2004)
Harold N. Gabow
Finding paths and cycles of superpolylogarithmic length. STOC (2004)
Harold N. Gabow, Shuxin Nie
Finding a long directed cycle. SODA (2004)
Harold N. Gabow
Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph. SODA (2003)
Timothy X. Brown, Harold N. Gabow
The limits of input-queued switch performance with future packet arrival information. Comput. Networks 42 (4) (2003)
Harold N. Gabow, Seth Pettie
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms. SWAT (2002)
Harold N. Gabow
An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph. SODA (2002)
Harold N. Gabow, San Skulrattanakulchai
Coloring Algorithms on Subcubic Graphs. COCOON (2002)
Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan
Unique Maximum Matching Algorithms. J. Algorithms 40 (2) (2001)
Timothy X. Brown, Harold N. Gabow, Qi Zhang
Maximum flow-life curve for a wireless ad hoc network. MobiHoc (2001)
Harold N. Gabow, Tibor Jordán
Bipartition constrained edge-splitting in directed graphs. Discret. Appl. Math. 115 (1-3) (2001)
Harold N. Gabow, Tadayoshi Kohno
A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis. ACM J. Exp. Algorithmics 6 (2001)
Harold N. Gabow, Tibor Jordán
How to Make a Square Grid Framework with Cables Rigid. SIAM J. Comput. 30 (2) (2000)
Roderick Bloem, Harold N. Gabow, Fabio Somenzi
Symbolic Steps. FMCAD (2000)
Monika Rauch Henzinger, Satish Rao, Harold N. Gabow
Computing Vertex Connectivity: New Bounds from Old Techniques. J. Algorithms 34 (2) (2000)
Harold N. Gabow, Tibor Jordán
Incrementing Bipartite Digraph Edge-Connectivity. J. Comb. Optim. 4 (4) (2000)
Harold N. Gabow
Using Expander Graphs to Find Vertex Connectivity. FOCS (2000)
Ying Xu, Dong Xu, Harold N. Gabow
Protein domain decomposition using a graph-theoretic approach. Bioinform. 16 (12) (2000)
Leonid Oliker, Rupak Biswas, Harold N. Gabow
Parallel tetrahedral mesh adaptation with dynamic load balancing. Parallel Comput. 26 (12) (2000)
Harold N. Gabow
Path-based depth-first search for strong and biconnected components. Inf. Process. Lett. 74 (3-4) (2000)
Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan
Unique Maximum Matching Algorithms. STOC (1999)
Harold N. Gabow, Tibor Jordán
How to Make a Square Grid Framework with Cables Rigid. SODA (1999)
Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti
Edge-Connectivity Augmentation with Partition Constraints. SIAM J. Discret. Math. 12 (2) (1999)
Harold N. Gabow, K. S. Manu
Packing algorithms for arborescences (and spanning trees) in capacitated graphs. Math. Program. 82 (1998)
Harold N. Gabow
Algorithms for Graphic Polymatroids and Parametris s-Sets. J. Algorithms 26 (1) (1998)
Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti
Edge-Connectivity Augmentation with Partition Constraints. SODA (1998)
Harold N. Gabow, Michel X. Goemans, David P. Williamson
An efficient approximation algorithm for the survivable network design problem. Math. Program. 82 (1998)
Leonid Oliker, Rupak Biswas, Harold N. Gabow
Performance Analysis and Portability of the PLUM Load Balancing System. Euro-Par (1998)
Jack E. Tabaska, Robert B. Cary, Harold N. Gabow, Gary D. Stormo
An RNA folding method capable of identifying pseudoknots and base triples. Bioinform. 14 (8) (1998)
Harold N. Gabow, Ying Xu
Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems. J. Comput. Syst. Sci. 53 (1) (1996)
Monika Rauch Henzinger, Satish Rao, Harold N. Gabow
Computing Vertex Connectivity: New Bounds from Old Techniques. FOCS (1996)
Harold N. Gabow
Perfect Arborescence Packing in Preflow Mincut Graphs. SODA (1996)
Harold N. Gabow
Centroids, Representations, and Submodular Flows. J. Algorithms 18 (3) (1995)
Harold N. Gabow
Algorithms for Graphic Polymatroids and Parametric s-Sets. SODA (1995)
Harold N. Gabow
A Matroid Approach to Finding Edge Connectivity and Packing Arborescences. J. Comput. Syst. Sci. 50 (2) (1995)
Harold N. Gabow, K. S. Manu
Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs. IPCO (1995)
Andrzej Ehrenfeucht, Harold N. Gabow, Ross M. McConnell, Stephen J. Sullivan
An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs. J. Algorithms 16 (2) (1994)
Harold N. Gabow
Editor's Foreword: Special Issur on Network Flow Algorithms. Algorithmica 11 (3) (1994)
Ying Xu, Harold N. Gabow
Fast Algorithms for Transversal Matroid Intersection Problems ISAAC (1994)
Harold N. Gabow
Efficient splitting off algorithms for graphs. STOC (1994)
Harold N. Gabow
A Representation for Crossing Set Families with Applications to Submodular Flow Problems. SODA (1993)
Harold N. Gabow
A Framework for Cost-scaling Algorithms for Submodular Flow Problems FOCS (1993)
Harold N. Gabow, Michel X. Goemans, David P. Williamson
An efficient approximation algorithm for the survivable network design problem. IPCO (1993)
Harold N. Gabow, Herbert H. Westermann
Forests, Frames, and Games: Algorithms for Matroid Sums and Applications. Algorithmica 7 (5&6) (1992)
Harold N. Gabow
A Matroid Approach to Finding Edge Connectivity and Packing Arborescences STOC (1991)
Harold N. Gabow, Robert Endre Tarjan
Faster Scaling Algorithms for General Graph-Matching Problems. J. ACM 38 (4) (1991)
Harold N. Gabow
Applications of a Poset Representation to Edge Connectivity and Graph Rigidity FOCS (1991)
Harold N. Gabow
Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. SODA (1990)
Harold N. Gabow, Robert Endre Tarjan
Faster Scaling Algorithms for Network Problems. SIAM J. Comput. 18 (5) (1989)
Harold N. Gabow, Ying Xu
Efficient Algorithms for Independent Assignments on Graphic and Linear Matroids FOCS (1989)
Harold N. Gabow, Zvi Galil, Thomas H. Spencer
Efficient implementation of graph algorithms using contraction. J. ACM 36 (3) (1989)
Harold N. Gabow, Robert Endre Tarjan
A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest. Inf. Process. Lett. 27 (5) (1988)
James R. Driscoll, Harold N. Gabow, Ruth Shrairman, Robert Endre Tarjan
Relaxed Heaps: An Alternative to Fibonacci Heaps with Applications to Parallel Computation. Commun. ACM 31 (11) (1988)
Harold N. Gabow, Herbert H. Westermann
Forests, Frames and Games: Algorithms for Matroid Sums and Applications STOC (1988)
Harold N. Gabow, Robert Endre Tarjan
Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems STOC (1988)
Harold N. Gabow
Scheduling UET Systems on Two Uniform Processors and Length Two Pipelines. SIAM J. Comput. 17 (4) (1988)
Harold N. Gabow, Robert Endre Tarjan
Algorithms for Two Bottleneck Optimization Problems. J. Algorithms 9 (3) (1988)
Harold N. Gabow, Zvi Galil, Thomas H. Spencer, Robert Endre Tarjan
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Comb. 6 (2) (1986)

Harold N. Gabow.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Harold N. Gabow