default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarold N. Gabow
Person information
- affiliation: University of Colorado, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j73]Harold N. Gabow
:
Blocking Trails for f-factors of Multigraphs. Algorithmica 85(10): 3168-3213 (2023)- [j72]Harold N. Gabow:
A Weight-Scaling Algorithm for f-Factors of Multigraphs. Algorithmica 85(10): 3214-3289 (2023) - [i10]Harold N. Gabow:
Maximum Cardinality f-Matching in Time O(n2/3m). CoRR abs/2311.14236 (2023) - 2021
- [j71]Harold N. Gabow, Piotr Sankowski:
Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors. SIAM J. Comput. 50(2): 440-486 (2021) - [j70]Harold N. Gabow, Piotr Sankowski:
Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths. SIAM J. Comput. 50(2): 555-601 (2021) - [i9]Harold N. Gabow:
Blocking Trails for f-factors of Multigraphs. CoRR abs/2112.04096 (2021) - 2020
- [i8]Harold N. Gabow:
A Weight-scaling Algorithm for f-factors of Multigraphs. CoRR abs/2010.01102 (2020)
2010 – 2019
- 2018
- [j69]Harold N. Gabow:
Data Structures for Weighted Matching and Extensions to b-matching and f-factors. ACM Trans. Algorithms 14(3): 39:1-39:80 (2018) - 2017
- [j68]Harold N. Gabow:
The Weighted Matching Approach to Maximum Cardinality Matching. Fundam. Informaticae 154(1-4): 109-130 (2017) - [j67]Harold N. Gabow:
A Data Structure for Nearest Common Ancestors with Linking. ACM Trans. Algorithms 13(4): 45:1-45:28 (2017) - [i7]Harold N. Gabow:
The Weighted Matching Approach to Maximum Cardinality Matching. CoRR abs/1703.03998 (2017) - 2016
- [j66]Harold N. Gabow:
The Minset-Poset Approach to Representations of Graph Connectivity. ACM Trans. Algorithms 12(2): 24:1-24:73 (2016) - [i6]Harold N. Gabow:
A Data Structure for Nearest Common Ancestors with Linking. CoRR abs/1611.07055 (2016) - [i5]Harold N. Gabow:
Data Structures for Weighted Matching and Extensions to $b$-matching and $f$-factors. CoRR abs/1611.07541 (2016) - 2015
- [j65]Marek Cygan, Harold N. Gabow, Piotr Sankowski:
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings. J. ACM 62(4): 28:1-28:30 (2015) - [i4]Harold N. Gabow:
Set-merging for the Matching Algorithm of Micali and Vazirani. CoRR abs/1501.00212 (2015) - 2014
- [j64]Jessica Chang, Harold N. Gabow, Samir Khuller:
A Model for Minimizing Active Processor Time. Algorithmica 70(3): 368-405 (2014) - 2013
- [c49]Harold N. Gabow, Piotr Sankowski:
Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors. FOCS 2013: 137-146 - [i3]Harold N. Gabow, Piotr Sankowski:
Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and f-Factors. CoRR abs/1304.6740 (2013) - 2012
- [j63]Harold N. Gabow, Suzanne Gallagher:
Iterated Rounding Algorithms for the Smallest k-Edge Connected Spanning Subgraph. SIAM J. Comput. 41(1): 61-103 (2012) - [j62]Harold N. Gabow:
A combinatoric interpretation of dual variables for weighted matching and f-factors. Theor. Comput. Sci. 454: 136-163 (2012) - [c48]Jessica Chang, Harold N. Gabow, Samir Khuller:
A Model for Minimizing Active Processor Time. ESA 2012: 289-300 - [c47]Marek Cygan, Harold N. Gabow, Piotr Sankowski:
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings. FOCS 2012: 531-540 - [i2]Marek Cygan, Harold N. Gabow, Piotr Sankowski:
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings. CoRR abs/1204.1616 (2012) - [i1]Jessica Chang, Harold N. Gabow, Samir Khuller:
A Model for Minimizing Active Processor Time. CoRR abs/1208.0312 (2012)
2000 – 2009
- 2009
- [j61]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) - [j60]Harold N. Gabow:
Foreword to special issue on SODA 2007. ACM Trans. Algorithms 5(3): 25:1 (2009) - 2008
- [j59]Harold N. Gabow, Shuxin Nie:
Finding a long directed cycle. ACM Trans. Algorithms 4(1): 7:1-7:21 (2008) - [c46]Harold N. Gabow, Shuxin Nie:
Finding Long Paths, Cycles and Circuits. ISAAC 2008: 752-763 - [c45]Harold N. Gabow, Suzanne Gallagher:
Iterated rounding algorithms for the smallest k-edge connected spanning subgraph. SODA 2008: 550-559 - 2007
- [j58]Harold N. Gabow:
On the Linfinity-norm of extreme points for crossing supermodular directed network LPs. Math. Program. 110(1): 111-144 (2007) - [j57]Harold N. Gabow:
Finding Paths and Cycles of Superpolylogarithmic Length. SIAM J. Comput. 36(6): 1648-1671 (2007) - [j56]Harold N. Gabow, Michael A. Bender, Martin Farach-Colton:
Introduction to SODA 2002 and 2003 special issue. ACM Trans. Algorithms 3(4): 36 (2007) - 2006
- [j55]Roderick Bloem, Harold N. Gabow, Fabio Somenzi:
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps. Formal Methods Syst. Des. 28(1): 37-56 (2006) - [j54]Harold N. Gabow:
Using expander graphs to find vertex connectivity. J. ACM 53(5): 800-844 (2006) - [c44]Harold N. Gabow:
Upper degree-constrained partial orientations. SODA 2006: 554-563 - 2005
- [j53]Harold N. Gabow:
An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a Multigraph. SIAM J. Discret. Math. 19(1): 1-18 (2005) - [j52]Harold N. Gabow:
Editor's foreword. ACM Trans. Algorithms 1(1): 1 (2005) - [c43]Harold N. Gabow:
On the Linfinity-Norm of Extreme Points for Crossing Supermodular Directed Network LPs. IPCO 2005: 392-406 - [c42]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 - [e1]Harold N. Gabow, Ronald Fagin:
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 [contents] - 2004
- [j51]San Skulrattanakulchai, Harold N. Gabow:
Coloring Algorithms On Subcubic Graphs. Int. J. Found. Comput. Sci. 15(1): 21-40 (2004) - [j50]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): 41-70 (2004) - [c41]Harold N. Gabow, Shuxin Nie:
Finding a long directed cycle. SODA 2004: 49-58 - [c40]Harold N. Gabow:
Special edges, and approximating the smallest directed k-edge connected spanning subgraph. SODA 2004: 234-243 - [c39]Harold N. Gabow:
Finding paths and cycles of superpolylogarithmic length. STOC 2004: 407-416 - 2003
- [j49]Timothy X. Brown, Harold N. Gabow:
The limits of input-queued switch performance with future packet arrival information. Comput. Networks 42(4): 441-460 (2003) - [c38]Harold N. Gabow:
Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph. SODA 2003: 460-469 - [p1]Harold N. Gabow, Camil Demetrescu, Irene Finocchi, Giuseppe Francesco Italiano, Giuseppe Liotta, Roberto Tamassia, Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Graphs in Computer Science. Handbook of Graph Theory 2003: 952-1073 - 2002
- [c37]Harold N. Gabow, San Skulrattanakulchai:
Coloring Algorithms on Subcubic Graphs. COCOON 2002: 67-76 - [c36]Harold N. Gabow:
An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph. SODA 2002: 84-93 - [c35]Harold N. Gabow, Seth Pettie:
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms. SWAT 2002: 190-199 - 2001
- [j48]Harold N. Gabow, Tibor Jordán:
Bipartition constrained edge-splitting in directed graphs. Discret. Appl. Math. 115(1-3): 49-62 (2001) - [j47]Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan:
Unique Maximum Matching Algorithms. J. Algorithms 40(2): 159-183 (2001) - [j46]Harold N. Gabow, Tadayoshi Kohno:
A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis. ACM J. Exp. Algorithmics 6: 3 (2001) - [c34]Timothy X. Brown, Harold N. Gabow, Qi Zhang:
Maximum flow-life curve for a wireless ad hoc network. MobiHoc 2001: 128-136 - 2000
- [j45]Ying Xu, Dong Xu, Harold N. Gabow:
Protein domain decomposition using a graph-theoretic approach. Bioinform. 16(12): 1091-1104 (2000) - [j44]Harold N. Gabow:
Path-based depth-first search for strong and biconnected components. Inf. Process. Lett. 74(3-4): 107-114 (2000) - [j43]Monika Rauch Henzinger, Satish Rao, Harold N. Gabow:
Computing Vertex Connectivity: New Bounds from Old Techniques. J. Algorithms 34(2): 222-250 (2000) - [j42]Harold N. Gabow, Tibor Jordán:
Incrementing Bipartite Digraph Edge-Connectivity. J. Comb. Optim. 4(4): 449-486 (2000) - [j41]Leonid Oliker, Rupak Biswas, Harold N. Gabow:
Parallel tetrahedral mesh adaptation with dynamic load balancing. Parallel Comput. 26(12): 1583-1608 (2000) - [j40]Harold N. Gabow, Tibor Jordán:
How to Make a Square Grid Framework with Cables Rigid. SIAM J. Comput. 30(2): 649-680 (2000) - [c33]Roderick Bloem, Harold N. Gabow, Fabio Somenzi:
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps. FMCAD 2000: 37-54 - [c32]Harold N. Gabow:
Using Expander Graphs to Find Vertex Connectivity. FOCS 2000: 410-420
1990 – 1999
- 1999
- [j39]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): 160-207 (1999) - [c31]Harold N. Gabow, Tibor Jordán:
How to Make a Square Grid Framework with Cables Rigid. SODA 1999: 356-365 - [c30]Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan:
Unique Maximum Matching Algorithms. STOC 1999: 70-78 - 1998
- [j38]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): 691-699 (1998) - [j37]Harold N. Gabow:
Algorithms for Graphic Polymatroids and Parametris s-Sets. J. Algorithms 26(1): 48-86 (1998) - [j36]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) - [j35]Harold N. Gabow, K. S. Manu:
Packing algorithms for arborescences (and spanning trees) in capacitated graphs. Math. Program. 82: 83-109 (1998) - [c29]Leonid Oliker, Rupak Biswas, Harold N. Gabow:
Performance Analysis and Portability of the PLUM Load Balancing System. Euro-Par 1998: 307-317 - [c28]Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti:
Edge-Connectivity Augmentation with Partition Constraints. SODA 1998: 306-315 - 1996
- [j34]Harold N. Gabow, Ying Xu:
Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems. J. Comput. Syst. Sci. 53(1): 129-147 (1996) - [c27]Monika Rauch Henzinger, Satish Rao, Harold N. Gabow:
Computing Vertex Connectivity: New Bounds from Old Techniques. FOCS 1996: 462-471 - [c26]Harold N. Gabow:
Perfect Arborescence Packing in Preflow Mincut Graphs. SODA 1996: 528-538 - 1995
- [j33]Harold N. Gabow:
Centroids, Representations, and Submodular Flows. J. Algorithms 18(3): 586-628 (1995) - [j32]Harold N. Gabow:
A Matroid Approach to Finding Edge Connectivity and Packing Arborescences. J. Comput. Syst. Sci. 50(2): 259-273 (1995) - [c25]Harold N. Gabow, K. S. Manu:
Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs. IPCO 1995: 388-402 - [c24]Harold N. Gabow:
Algorithms for Graphic Polymatroids and Parametric s-Sets. SODA 1995: 88-97 - 1994
- [j31]Harold N. Gabow:
Editor's Foreword: Special Issur on Network Flow Algorithms. Algorithmica 11(3): 197-199 (1994) - [j30]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) - [c23]Ying Xu, Harold N. Gabow:
Fast Algorithms for Transversal Matroid Intersection Problems. ISAAC 1994: 625-633 - [c22]Harold N. Gabow:
Efficient splitting off algorithms for graphs. STOC 1994: 696-705 - 1993
- [c21]Harold N. Gabow:
A Framework for Cost-scaling Algorithms for Submodular Flow Problems. FOCS 1993: 449-458 - [c20]Harold N. Gabow, Michel X. Goemans, David P. Williamson:
An efficient approximation algorithm for the survivable network design problem. IPCO 1993: 57-74 - [c19]Harold N. Gabow:
A Representation for Crossing Set Families with Applications to Submodular Flow Problems. SODA 1993: 202-211 - 1992
- [j29]Harold N. Gabow, Herbert H. Westermann:
Forests, Frames, and Games: Algorithms for Matroid Sums and Applications. Algorithmica 7(5&6): 465-497 (1992) - 1991
- [j28]Harold N. Gabow, Robert Endre Tarjan:
Faster Scaling Algorithms for General Graph-Matching Problems. J. ACM 38(4): 815-853 (1991) - [c18]Harold N. Gabow:
Applications of a Poset Representation to Edge Connectivity and Graph Rigidity. FOCS 1991: 812-821 - [c17]Harold N. Gabow:
A Matroid Approach to Finding Edge Connectivity and Packing Arborescences. STOC 1991: 112-122 - 1990
- [c16]Harold N. Gabow:
Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. SODA 1990: 434-443
1980 – 1989
- 1989
- [j27]Harold N. Gabow, Zvi Galil, Thomas H. Spencer:
Efficient implementation of graph algorithms using contraction. J. ACM 36(3): 540-572 (1989) - [j26]Harold N. Gabow, Robert Endre Tarjan:
Faster Scaling Algorithms for Network Problems. SIAM J. Comput. 18(5): 1013-1036 (1989) - [c15]Harold N. Gabow, Ying Xu:
Efficient Algorithms for Independent Assignments on Graphic and Linear Matroids. FOCS 1989: 106-111 - 1988
- [j25]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) - [j24]Harold N. Gabow, Robert Endre Tarjan:
A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest. Inf. Process. Lett. 27(5): 259-263 (1988) - [j23]Harold N. Gabow, Robert Endre Tarjan:
Algorithms for Two Bottleneck Optimization Problems. J. Algorithms 9(3): 411-417 (1988) - [j22]Harold N. Gabow:
Scheduling UET Systems on Two Uniform Processors and Length Two Pipelines. SIAM J. Comput. 17(4): 810-829 (1988) - [c14]Harold N. Gabow, Herbert H. Westermann:
Forests, Frames and Games: Algorithms for Matroid Sums and Applications. STOC 1988: 407-421 - [c13]Harold N. Gabow, Robert Endre Tarjan:
Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems. STOC 1988: 514-527 - 1986
- [j21]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): 109-122 (1986) - [j20]Harold N. Gabow, Matthias F. M. Stallmann:
An augmenting path algorithm for linear matroid parity. Comb. 6(2): 123-150 (1986) - [j19]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) - 1985
- [j18]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) - [j17]Harold N. Gabow:
Scaling Algorithms for Network Problems. J. Comput. Syst. Sci. 31(2): 148-168 (1985) - [c12]Harold N. Gabow:
A Scaling Algorithm for Weighted Matching on General Graphs. FOCS 1985: 90-100 - [c11]Harold N. Gabow, Matthias F. M. Stallmann:
Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract). ICALP 1985: 210-220 - 1984
- [j16]Harold N. Gabow, Robert Endre Tarjan:
Efficient Algorithms for a Family of Matroid Intersection Problems. J. Algorithms 5(1): 80-131 (1984) - [c10]Matthias F. M. Stallmann, Harold N. Gabow:
An Augmenting Path Algorithm for the Parity Problem on Linear Matroids. FOCS 1984: 217-228 - [c9]Harold N. Gabow, Zvi Galil, Thomas H. Spencer:
Efficient Implementation of Graph Algorithms Using Contraction. FOCS 1984: 347-357 - [c8]Harold N. Gabow, Jon Louis Bentley, Robert Endre Tarjan:
Scaling and Related Techniques for Geometry Problems. STOC 1984: 135-143 - 1983
- [c7]Harold N. Gabow:
Scaling Algorithms for Network Problems. FOCS 1983: 248-257 - [c6]Harold N. Gabow, Robert Endre Tarjan:
A Linear-Time Algorithm for a Special Case of Disjoint Set Union. STOC 1983: 246-251 - [c5]Harold N. Gabow:
An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems. STOC 1983: 448-456 - 1982
- [j15]Harold N. Gabow:
An Almost-Linear Algorithm for Two-Processor Scheduling. J. ACM 29(3): 766-780 (1982) - [j14]Harold N. Gabow, Oded Kariv:
Algorithms for Edge Coloring Bipartite Graphs and Multigraphs. SIAM J. Comput. 11(1): 117-129 (1982) - [c4]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 - 1981
- [j13]Harold N. Gabow:
A Linear-Time Recognition Algorithm for Interval Dags. Inf. Process. Lett. 12(1): 20-22 (1981)
1970 – 1979
- 1979
- [j12]Harold N. Gabow:
Algorithmic proofs of two relations between connectivity and the 1-factors of a graph. Discret. Math. 26(1): 33-40 (1979) - [j11]Frank Fussenegger, Harold N. Gabow:
A Counting Approach to Lower Bounds for Selection Problems. J. ACM 26(2): 227-238 (1979) - [c3]Harold N. Gabow, Robert Endre Tarjan:
Efficient Algorithms for Simple Matroid Intersection Problems. FOCS 1979: 196-204 - 1978
- [j10]