Harold N. Gabow

Harold N. Gabow, Piotr Sankowski: Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and f-Factors. CoRR abs/1304.6740 (2013)

Harold N. Gabow, Suzanne Gallagher: Iterated Rounding Algorithms for the Smallest k-Edge Connected Spanning Subgraph. SIAM J. Comput. 41(1): 61-103 (2012)

Harold N. Gabow: A combinatoric interpretation of dual variables for weighted matching and f-factors. Theor. Comput. Sci. 454: 136-163 (2012)

Jessica Chang, Harold N. Gabow, Samir Khuller: A Model for Minimizing Active Processor Time. ESA 2012: 289-300

Marek Cygan, Harold N. Gabow, Piotr Sankowski: Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings. FOCS 2012: 531-540

Marek Cygan, Harold N. Gabow, Piotr Sankowski: Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings. CoRR abs/1204.1616 (2012)

Jessica Chang, Harold N. Gabow, Samir Khuller: A Model for Minimizing Active Processor Time. CoRR abs/1208.0312 (2012)

Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson: Approximating the smallest k-edge connected spanning subgraph by LP-rounding. Networks 53(4): 345-357 (2009)

Harold N. Gabow: Foreword to special issue on SODA 2007. ACM Transactions on Algorithms 5(3) (2009)

Harold N. Gabow, Shuxin Nie: Finding a long directed cycle. ACM Transactions on Algorithms 4(1) (2008)

Harold N. Gabow, Shuxin Nie: Finding Long Paths, Cycles and Circuits. ISAAC 2008: 752-763

Harold N. Gabow, Suzanne Gallagher: Iterated rounding algorithms for the smallest k-edge connected spanning subgraph. SODA 2008: 550-559

Harold N. Gabow: On the L_infinity-norm of extreme points for crossing supermodular directed network LPs. Math. Program. 110(1): 111-144 (2007)

Harold N. Gabow: Finding Paths and Cycles of Superpolylogarithmic Length. SIAM J. Comput. 36(6): 1648-1671 (2007)

Harold N. Gabow, Michael A. Bender, Martin Farach-Colton: Introduction to SODA 2002 and 2003 special issue. ACM Transactions on Algorithms 3(4) (2007)

Roderick Bloem, Harold N. Gabow, Fabio Somenzi: An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps. Formal Methods in System Design 28(1): 37-56 (2006)

Harold N. Gabow: Using expander graphs to find vertex connectivity. J. ACM 53(5): 800-844 (2006)

Harold N. Gabow: Upper degree-constrained partial orientations. SODA 2006: 554-563

Harold N. Gabow: An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a Multigraph. SIAM J. Discrete Math. 19(1): 1-18 (2005)

Harold N. Gabow: Editor's foreword. ACM Transactions on Algorithms 1(1): 1 (2005)

Harold N. Gabow: On the L_infinity-Norm of Extreme Points for Crossing Supermodular Directed Network LPs. IPCO 2005: 392-406

Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson: Approximating the smallest k-edge connected spanning subgraph by LP-rounding. SODA 2005: 562-571

Harold N. Gabow, Ronald Fagin (Eds.): Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005. ACM 2005, isbn 1-58113-960-8

San Skulrattanakulchai, Harold N. Gabow: Coloring Algorithms On Subcubic Graphs. Int. J. Found. Comput. Sci. 15(1): 21-40 (2004)

Harold N. Gabow: An Ear Decomposition Approach to Approximating the Smallest 3-Edge Connected Spanning Subgraph of a Multigraph. SIAM J. Discrete Math. 18(1): 41-70 (2004)

Harold N. Gabow, Shuxin Nie: Finding a long directed cycle. SODA 2004: 49-58

Harold N. Gabow: Special edges, and approximating the smallest directed k-edge connected spanning subgraph. SODA 2004: 234-243

Harold N. Gabow: Finding paths and cycles of superpolylogarithmic length. STOC 2004: 407-416

Timothy X. Brown, Harold N. Gabow: The limits of input-queued switch performance with future packet arrival information. Computer Networks 42(4): 441-460 (2003)

Harold N. Gabow: Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph. SODA 2003: 460-469

Harold N. Gabow, San Skulrattanakulchai: Coloring Algorithms on Subcubic Graphs. COCOON 2002: 67-76

Harold N. Gabow: An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph. SODA 2002: 84-93

Harold N. Gabow, Seth Pettie: The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms. SWAT 2002: 190-199

Harold N. Gabow, Tibor Jordán: Bipartition constrained edge-splitting in directed graphs. Discrete Applied Mathematics 115(1-3): 49-62 (2001)

Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan: Unique Maximum Matching Algorithms. J. Algorithms 40(2): 159-183 (2001)

Harold N. Gabow, Tadayoshi Kohno: A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis. ACM Journal of Experimental Algorithmics 6: 3 (2001)

Timothy X. Brown, Harold N. Gabow, Qi Zhang: Maximum flow-life curve for a wireless ad hoc network. MobiHoc 2001: 128-136

Ying Xu, Dong Xu, Harold N. Gabow: Protein domain decomposition using a graph-theoretic approach. Bioinformatics 16(12): 1091-1104 (2000)

Harold N. Gabow: Path-based depth-first search for strong and biconnected components. Inf. Process. Lett. 74(3-4): 107-114 (2000)

Monika Rauch Henzinger, Satish Rao, Harold N. Gabow: Computing Vertex Connectivity: New Bounds from Old Techniques. J. Algorithms 34(2): 222-250 (2000)

Harold N. Gabow, Tibor Jordán: Incrementing Bipartite Digraph Edge-Connectivity. J. Comb. Optim. 4(4): 449-486 (2000)

Leonid Oliker, Rupak Biswas, Harold N. Gabow: Parallel tetrahedral mesh adaptation with dynamic load balancing. Parallel Computing 26(12): 1583-1608 (2000)

Harold N. Gabow, Tibor Jordán: How to Make a Square Grid Framework with Cables Rigid. SIAM J. Comput. 30(2): 649-680 (2000)

Roderick Bloem, Harold N. Gabow, Fabio Somenzi: An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps. FMCAD 2000: 37-54

Harold N. Gabow: Using Expander Graphs to Find Vertex Connectivity. FOCS 2000: 410-420

Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti: Edge-Connectivity Augmentation with Partition Constraints. SIAM J. Discrete Math. 12(2): 160-207 (1999)

Harold N. Gabow, Tibor Jordán: How to Make a Square Grid Framework with Cables Rigid. SODA 1999: 356-365

Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan: Unique Maximum Matching Algorithms. STOC 1999: 70-78

Jack E. Tabaska, Robert B. Cary, Harold N. Gabow, Gary D. Stormo: An RNA folding method capable of identifying pseudoknots and base triples. Bioinformatics 14(8): 691-699 (1998)

Harold N. Gabow: Algorithms for Graphic Polymatroids and Parametris s-Sets. J. Algorithms 26(1): 48-86 (1998)

Harold N. Gabow, Michel X. Goemans, David P. Williamson: An efficient approximation algorithm for the survivable network design problem. Math. Program. 82: 13-40 (1998)

Harold N. Gabow, K. S. Manu: Packing algorithms for arborescences (and spanning trees) in capacitated graphs. Math. Program. 82: 83-109 (1998)

Leonid Oliker, Rupak Biswas, Harold N. Gabow: Performance Analysis and Portability of the PLUM Load Balancing System. Euro-Par 1998: 307-317

Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti: Edge-Connectivity Augmentation with Partition Constraints. SODA 1998: 306-315

Harold N. Gabow, Ying Xu: Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems. J. Comput. Syst. Sci. 53(1): 129-147 (1996)

Monika Rauch Henzinger, Satish Rao, Harold N. Gabow: Computing Vertex Connectivity: New Bounds from Old Techniques. FOCS 1996: 462-471

Harold N. Gabow: Perfect Arborescence Packing in Preflow Mincut Graphs. SODA 1996: 528-538

Harold N. Gabow: Centroids, Representations, and Submodular Flows. J. Algorithms 18(3): 586-628 (1995)

Harold N. Gabow: A Matroid Approach to Finding Edge Connectivity and Packing Arborescences. J. Comput. Syst. Sci. 50(2): 259-273 (1995)

Harold N. Gabow, K. S. Manu: Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs. IPCO 1995: 388-402

Harold N. Gabow: Algorithms for Graphic Polymatroids and Parametric s-Sets. SODA 1995: 88-97

Harold N. Gabow: Editor's Foreword: Special Issur on Network Flow Algorithms. Algorithmica 11(3): 197-199 (1994)

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): 283-294 (1994)

Ying Xu, Harold N. Gabow: Fast Algorithms for Transversal Matroid Intersection Problems. ISAAC 1994: 625-633

Harold N. Gabow: Efficient splitting off algorithms for graphs. STOC 1994: 696-705

Harold N. Gabow: A Framework for Cost-scaling Algorithms for Submodular Flow Problems. FOCS 1993: 449-458

Harold N. Gabow, Michel X. Goemans, David P. Williamson: An efficient approximation algorithm for the survivable network design problem. IPCO 1993: 57-74

Harold N. Gabow: A Representation for Crossing Set Families with Applications to Submodular Flow Problems. SODA 1993: 202-211

Harold N. Gabow, Herbert H. Westermann: Forests, Frames, and Games: Algorithms for Matroid Sums and Applications. Algorithmica 7(5&6): 465-497 (1992)

Harold N. Gabow, Robert Endre Tarjan: Faster Scaling Algorithms for General Graph-Matching Problems. J. ACM 38(4): 815-853 (1991)

Harold N. Gabow: Applications of a Poset Representation to Edge Connectivity and Graph Rigidity. FOCS 1991: 812-821

Harold N. Gabow: A Matroid Approach to Finding Edge Connectivity and Packing Arborescences. STOC 1991: 112-122

Harold N. Gabow: Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. SODA 1990: 434-443

Harold N. Gabow, Zvi Galil, Thomas H. Spencer: Efficient implementation of graph algorithms using contraction. J. ACM 36(3): 540-572 (1989)

Harold N. Gabow, Robert Endre Tarjan: Faster Scaling Algorithms for Network Problems. SIAM J. Comput. 18(5): 1013-1036 (1989)

Harold N. Gabow, Ying Xu: Efficient Algorithms for Independent Assignments on Graphic and Linear Matroids. FOCS 1989: 106-111

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): 1343-1354 (1988)

Harold N. Gabow, Robert Endre Tarjan: A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest. Inf. Process. Lett. 27(5): 259-263 (1988)

Harold N. Gabow, Robert Endre Tarjan: Algorithms for Two Bottleneck Optimization Problems. J. Algorithms 9(3): 411-417 (1988)

Harold N. Gabow: Scheduling UET Systems on Two Uniform Processors and Length Two Pipelines. SIAM J. Comput. 17(4): 810-829 (1988)

Harold N. Gabow, Herbert H. Westermann: Forests, Frames and Games: Algorithms for Matroid Sums and Applications. STOC 1988: 407-421

Harold N. Gabow, Robert Endre Tarjan: Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems. STOC 1988: 514-527

Harold N. Gabow, Zvi Galil, Thomas H. Spencer, Robert Endre Tarjan: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6(2): 109-122 (1986)

Harold N. Gabow, Matthias F. M. Stallmann: An augmenting path algorithm for linear matroid parity. Combinatorica 6(2): 123-150 (1986)

Zvi Galil, Silvio Micali, Harold N. Gabow: An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs. SIAM J. Comput. 15(1): 120-130 (1986)

Harold N. Gabow, Robert Endre Tarjan: A Linear-Time Algorithm for a Special Case of Disjoint Set Union. J. Comput. Syst. Sci. 30(2): 209-221 (1985)

Harold N. Gabow: Scaling Algorithms for Network Problems. J. Comput. Syst. Sci. 31(2): 148-168 (1985)

Harold N. Gabow: A Scaling Algorithm for Weighted Matching on General Graphs. FOCS 1985: 90-100

Harold N. Gabow, Matthias F. M. Stallmann: Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract). ICALP 1985: 210-220

Harold N. Gabow, Robert Endre Tarjan: Efficient Algorithms for a Family of Matroid Intersection Problems. J. Algorithms 5(1): 80-131 (1984)

Matthias F. M. Stallmann, Harold N. Gabow: An Augmenting Path Algorithm for the Parity Problem on Linear Matroids. FOCS 1984: 217-228

Harold N. Gabow, Zvi Galil, Thomas H. Spencer: Efficient Implementation of Graph Algorithms Using Contraction. FOCS 1984: 347-357

Harold N. Gabow, Jon Louis Bentley, Robert Endre Tarjan: Scaling and Related Techniques for Geometry Problems. STOC 1984: 135-143

Harold N. Gabow: Scaling Algorithms for Network Problems. FOCS 1983: 248-257

Harold N. Gabow, Robert Endre Tarjan: A Linear-Time Algorithm for a Special Case of Disjoint Set Union. STOC 1983: 246-251

Harold N. Gabow: An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems. STOC 1983: 448-456

Harold N. Gabow: An Almost-Linear Algorithm for Two-Processor Scheduling. J. ACM 29(3): 766-780 (1982)

Harold N. Gabow, Oded Kariv: Algorithms for Edge Coloring Bipartite Graphs and Multigraphs. SIAM J. Comput. 11(1): 117-129 (1982)

Zvi Galil, Silvio Micali, Harold N. Gabow: Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs. FOCS 1982: 255-261

Harold N. Gabow: A Linear-Time Recognition Algorithm for Interval Dags. Inf. Process. Lett. 12(1): 20-22 (1981)

Frank Fussenegger, Harold N. Gabow: A Counting Approach to Lower Bounds for Selection Problems. J. ACM 26(2): 227-238 (1979)

Harold N. Gabow, Robert Endre Tarjan: Efficient Algorithms for Simple Matroid Intersection Problems. FOCS 1979: 196-204

Harold N. Gabow: A good algorithm for smallest spanning trees with a degree constraint. Networks 8(3): 201-208 (1978)

Harold N. Gabow, Eugene W. Myers: Finding All Spanning Trees of Directed and Undirected Graphs. SIAM J. Comput. 7(3): 280-287 (1978)

Harold N. Gabow, Oded Kariv: Algorithms for Edge Coloring Bipartite Graphs. STOC 1978: 184-192

Harold N. Gabow: Two Algorithms for Generating Weighted Spanning Trees in Order. SIAM J. Comput. 6(1): 139-150 (1977)

Harold N. Gabow: Using euler partitions to edge color bipartite multigraphs. International Journal of Parallel Programming 5(4): 345-355 (1976)

Harold N. Gabow: Some Improved Bounds on the Number of 1-Factors of n-Connected Graphs. Inf. Process. Lett. 5(4): 113-115 (1976)

Harold N. Gabow: A Note on Degree-Constrained Star Subgraphs of Bipartite Graphs. Inf. Process. Lett. 5(6): 165-167 (1976)

Harold N. Gabow: An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs. J. ACM 23(2): 221-234 (1976)

Harold N. Gabow, Shachindra N. Maheswari, Leon J. Osterweil: On Two Problems in the Generation of Program Test Paths. IEEE Trans. Software Eng. 2(3): 227-231 (1976)

Frank Fussenegger, Harold N. Gabow: Using Comparison Trees to Derive Lower Bounds for Selection Problems. FOCS 1976: 178-182