Harold N. Gabow | Academic Influence

Harold N. Gabow's AcademicInfluence.com Rankings

Harold N. Gabow

Computer Science

#4012

World Rank

#4219

Historical Rank

Database

#3691

World Rank

#3843

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Harold N. Gabow's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University

Similar Degrees You Can Earn

Why Is Harold N. Gabow Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Harold N. Gabow is an American computer scientist known for his research on graph algorithms and data structures. He is a professor emeritus at the University of Colorado Boulder, and the former founding editor-in-chief of ACM Transactions on Algorithms.

(See a Problem?)

Harold N. Gabow's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A linear-time algorithm for a special case of disjoint set union (1983) (747)
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (1986) (552)
Scaling and related techniques for geometry problems (1984) (527)
Data structures for weighted matching and nearest common ancestors with linking (1990) (473)
Faster Scaling Algorithms for Network Problems (1989) (432)
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs (1976) (343)
Faster scaling algorithms for general graph matching problems (1991) (319)
An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems (1983) (270)
A matroid approach to finding edge connectivity and packing arborescences (1991) (256)
Scaling algorithms for network problems (1983) (238)
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation (1988) (222)
Implementation of algorithms for maximum matching on nonbipartite graphs (1973) (210)
Forests, frames, and games: Algorithms for matroid sums and applications (1992) (197)
On Two Problems in the Generation of Program Test Paths (1976) (186)
Finding All Spanning Trees of Directed and Undirected Graphs (1978) (182)
Algorithms for Two Bottleneck Optimization Problems (1988) (178)
Path-based depth-first search for strong and biconnected components (2000) (171)
An RNA folding method capable of identifying pseudoknots and base triples (1998) (170)
Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs (1982) (158)
Protein domain decomposition using a graph-theoretic approach (2000) (150)
Two Algorithms for Generating Weighted Spanning Trees in Order (1977) (150)
Computing vertex connectivity: new bounds from old techniques (1996) (140)
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps (2000) (139)
Algorithms for Edge Coloring Bipartite Graphs and Multigraphs (1982) (136)
A scaling algorithm for weighted matching on general graphs (1985) (113)
Efficient implementation of graph algorithms using contraction (1984) (111)
Applications of a poset representation to edge connectivity and graph rigidity (1991) (100)
An Almost-Linear Algorithm for Two-Processor Scheduling (1982) (99)
An efficient approximation algorithm for the survivable network design problem (1998) (84)
Efficient Algorithms for a Family of Matroid Intersection Problems (1984) (84)
Maximum flow-life curve for a wireless ad hoc network (2001) (74)
An augmenting path algorithm for linear matroid parity (1986) (68)
Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract) (1985) (65)
Unique maximum matching algorithms (1999) (64)
Using expander graphs to find vertex connectivity (2000) (63)
Packing algorithms for arborescences (and spanning trees) in capacitated graphs (1995) (63)
An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs (1994) (60)
Efficient splitting off algorithms for graphs (1994) (60)
A Counting Approach to Lower Bounds for Selection Problems (1979) (58)
A representation for crossing set families with applications to submodular flow problems (1993) (57)
Parallel tetrahedral mesh adaptation with dynamic load balancing (2013) (54)
Approximating the smallest k‐edge connected spanning subgraph by LP‐rounding (2005) (52)
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings (2012) (50)
Almost-optimum speed-ups of algorithms for bipartite matching and related problems (1988) (50)
Edge-connectivity augmentation with partition constraints (1999) (49)
Using euler partitions to edge color bipartite multigraphs (1976) (48)
Finding paths and cycles of superpolylogarithmic length (2004) (45)
A good algorithm for smallest spanning trees with a degree constraint (1978) (44)
Finding a long directed cycle (2004) (39)
Algorithms for graphic polymatroids and parametric s-Sets (1995) (38)
Data Structures for Weighted Matching and Extensions to b-matching and f-factors (2016) (37)
Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems (1996) (34)
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005) (33)
Iterated rounding algorithms for the smallest k-edge connected spanning subgraph (2008) (31)
Efficient Algorithms for Graphic Intersection and Parity (Extended Abstract) (1985) (31)
Centroids, Representations, and Submodular Flows (1995) (30)
The Minset-Poset Approach to Representations of Graph Connectivity (2016) (29)
Algorithms for edge coloring bipartite graphs (1978) (28)
A Model for Minimizing Active Processor Time (2012) (27)
Finding Long Paths, Cycles and Circuits (2008) (25)
Decomposing symmetric exchanges in matroid bases (1976) (24)
Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors (2013) (20)
Efficient algorithms for independent assignment on graphic and linear matroids (1989) (19)
A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest (1988) (18)
An efficient implementation of Edmonds'' maximum matching algorithm. (1972) (18)
On the L∞-norm of extreme points for crossing supermodular directed network LPs (2007) (18)
Approximating the smallest k-edge connected spanning subgraph by LP-rounding (2009) (18)
A Linear-Time Recognition Algorithm for Interval Dags (1981) (17)
The Weighted Matching Approach to Maximum Cardinality Matching (2017) (17)
An E cient Approximation Algorithmfor the Survivable Network Design Problem (1993) (14)
A framework for cost-scaling algorithms for submodular flow problems (1993) (14)
An Augmenting Path Algorithm for the Parity Problem on Linear Matroids (1984) (14)
A Model for Minimizing Active Processor Time (2014) (14)
Scheduling UET Systems on Two Uniform Processors and Length Two Pipelines (1988) (12)
Fibonacci Heaps with Applications to Parallel Computation (1988) (11)
An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a Multigraph (2005) (11)
How to make a square grid framework with cables rigid (2000) (11)
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms (2002) (11)
Upper degree-constrained partial orientations (2006) (11)
An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph (2002) (11)
An Efficient Implementation of Edmonds' Algorithm for Maximum Weight Matching on Graphs ; CU-CS-075-75 (1975) (10)
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 (2005) (9)
Using computer trees to derive lower bounds for selection problems (1976) (9)
A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis (2001) (9)
Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph (2003) (8)
Coloring Algorithms On Subcubic Graphs (2002) (7)
Efficient algorithms for simple matroid intersection problems (1979) (7)
Performance Analysis and Portability of the PLUM Load Balancing System (1998) (6)
Incrementing Bipartite Digraph Edge-Connectivity (2000) (6)
Special edges, and approximating the smallest directed k-edge connected spanning subgraph (2004) (5)
A Data Structure for Nearest Common Ancestors with Linking (2016) (5)
A combinatoric interpretation of dual variables for weighted matching and f-factors (2012) (5)
Bipartition constrained edge-splitting in directed graphs (2001) (5)
Relaxed Heaps: An Alternative to Fibonacci Heaps, (1987) (4)
On the Linfinity-Norm of Extreme Points for Crossing Supermodular Directed Network LPs (2005) (3)
Graphs in Computer Science (2003) (3)
Algorithmic proofs of two relations between connectivity and the 1-factors of a graph (1979) (3)
Some Improved Bounds on the Number of 1-Factors of n-Connected Graphs (1976) (2)
Finding All Spanning Trees of Undirected and Directed Graphs ; CU-CS-103-77 (1977) (2)
Perfect arborescence packing in preflow mincut graphs (1996) (2)
Set-merging for the Matching Algorithm of Micali and Vazirani (2014) (2)
How to gracefully number certain symmetric trees (1975) (2)
Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors (2021) (2)
Scaling Algorithms for Network Problems ; CU-CS-266-84 (1984) (2)
A Note on Degree-Constrained Star Subgraphs of Bipartite Graphs (1976) (2)
Incrementing Bipartite Digraph Edge-Connectivity ; CU-CS-889-99 (1999) (1)
Choosing a Set of Partitions to Collect in a Connectivity-Based Garbage Collector ; CU-CS-958-03 (2003) (1)
Fast Algorithms for Transversal Matroid Intersection Problems (1994) (1)
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007 (2007) (1)
Using Expander Graphs to Find Vertex Connectivity ; CU-CS-908-00 (2000) (1)
Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems ; CU-CS-252-83 (1982) (1)
A Linear-Time Algorithm for a Special Case of Disjoint Set Union ; CU-CS-261-82 (1984) (1)
Introduction to SODA 2002 and 2003 special issue (2007) (1)
Efficient Algorithms for Independent Assignment on Graphic Matroids ; CU-CS-468-90 (1990) (1)
Almost-Optimum Parallel Speed-Ups of Algorithms for Bipartite Matching and Related Problems ; CU-CS-425-89 (1989) (1)
A Weight-scaling Algorithm for f-factors of Multigraphs (2020) (1)
A Combinatoric Interpretation of Dual Variables for Weighted Matching Problems (2012) (0)
Approximating The Minimum Equivalent Digraph (1995) (0)
5. Conclusion and Open Problems Step 4.3 for Each Internal Node Build Tablem , 1 for Array M in M , Level of the Tree Number of Children per Node (0)
Two Lower Bounds on Chomsky Normal Form ; CU-CS-239-82 (1982) (0)
Editor's foreword (2005) (0)
Alenex workshop preface (2005) (0)
Editor's Foreword: Special Issur on Network Flow Algorithms. (1994) (0)
Centroids, Representations and Submodular Flows ; CU-CS-660-93 (1993) (0)
A Good Algorithm for Minimum Spanning Trees with a Degree Constraint ; CU-CS-105-77 (1977) (0)
Algorithms on long paths and cycles in graphs (2008) (0)
The limits of input-queued switch performance with future packet arrival information (2003) (0)
Perfect Arborescence Packing in Preflow Minicut Graphs ; CU-CS-790-95 (1995) (0)
Data Flow Analysis in Software Reliability ; CU-CS-087-76 (1976) (0)
Using Blossoms to Find Maximum Matchings on Graphs ; CU-CS-056-74 (1974) (0)
Guest Editor's ForewordGUEST EDITOR'S FOREWORD (1998) (0)
A Note on Exchanges in Matroid Bases (1974) (0)
An Algorithm for Strongly Conne tedComponent Analysis in n log n Symboli Steps ? (2000) (0)
Algorithms for Edge Coloring Bipartite Graphs ; CU-CS-123-78 (1978) (0)
Editor's foreword (2005) (0)
Improved Bounds on the Number of 1-Factors on n-Connected Perfect Graphs ; CU-CS-086-76 (1976) (0)
Exact and Approximate Algorithms for Scheduling UET Systems on Two Uniform Processors ; CU-CS-225-82 (1982) (0)
Blocking Trails for f-factors of Multigraphs (2021) (0)
Decomposing Symmetric Exchanges in Matroid Bases ; CU-CS-053-74 (1974) (0)
Finding the Best Solutions: The Cost of ls C Problem and Finding Matchings ; CU-CS-139-78 (1978) (0)
Graph connectivity: approximation algorithms and applications to protein-protein interaction networks (2010) (0)
An Improved Method for Finding the K Smallest Cost Assignments in Order ; CU-CS-124-78 (1977) (0)
Foreword to special issue on SODA 2007 (2009) (0)
Verifying Concurrent Processes Using (2006) (0)
Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths (2021) (0)

This paper list is powered by the following services:

Other Resources About Harold N. Gabow

en.wikipedia.org

What Schools Are Affiliated With Harold N. Gabow?

Harold N. Gabow is affiliated with the following schools: