Harold N. Gabow
According to our database^{1},
Harold N. Gabow
authored at least 99 papers
between 1976 and 2020.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2002, "For contributions to efficient algorithms to flows, connectivity and matching.".
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on dl.acm.org
On csauthors.net:
Bibliography
2020
CoRR, 2020
2018
Data Structures for Weighted Matching and Extensions to <i>b</i>matching and <i>f</i>factors.
ACM Trans. Algorithms, 2018
2017
ACM Trans. Algorithms, 2017
Fundam. Informaticae, 2017
2016
ACM Trans. Algorithms, 2016
Data Structures for Weighted Matching and Extensions to $b$matching and $f$factors.
CoRR, 2016
2015
Algorithmic Applications of BaurStrassen's Theorem: Shortest Cycles, Diameter, and Matchings.
J. ACM, 2015
CoRR, 2015
2014
Algorithmica, 2014
2013
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
2012
A combinatoric interpretation of dual variables for weighted matching and ffactors.
Theor. Comput. Sci., 2012
Iterated Rounding Algorithms for the Smallest <i>k</i>Edge Connected Spanning Subgraph.
SIAM J. Comput., 2012
2009
ACM Trans. Algorithms, 2009
Approximating the smallest <i>k</i>edge connected spanning subgraph by LProunding.
Networks, 2009
2008
ACM Trans. Algorithms, 2008
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
2007
ACM Trans. Algorithms, 2007
SIAM J. Comput., 2007
On the L<sub>infinity</sub>norm of extreme points for crossing supermodular directed network LPs.
Math. Program., 2007
2006
J. ACM, 2006
An Algorithm for Strongly Connected Component Analysis in <i>n</i> log <i>n</i> Symbolic Steps.
Formal Methods Syst. Des., 2006
Proceedings of the Seventeenth Annual ACMSIAM Symposium on Discrete Algorithms, 2006
2005
ACM Trans. Algorithms, 2005
An Improved Analysis for Approximating the Smallest kEdge Connected Spanning Subgraph of a Multigraph.
SIAM J. Discret. Math., 2005
2004
An Ear Decomposition Approach to Approximating the Smallest 3Edge Connected Spanning Subgraph of a Multigraph.
SIAM J. Discret. Math., 2004
Int. J. Found. Comput. Sci., 2004
Special edges, and approximating the smallest directed <i>k</i>edge connected spanning subgraph.
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
2003
The limits of inputqueued switch performance with future packet arrival information.
Comput. Networks, 2003
Better performance bounds for finding the smallest kedge connected spanning subgraph of a multigraph.
Proceedings of the Fourteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2003
Proceedings of the Handbook of Graph Theory., 2003
2002
The Dynamic Vertex Minimum Problem and Its Application to ClusteringType Approximation Algorithms.
Proceedings of the Algorithm Theory, 2002
2001
A NetworkFlowBased Scheduler: Design, Performance History, and Experimental Analysis.
ACM J. Exp. Algorithmics, 2001
J. Algorithms, 2001
Discret. Appl. Math., 2001
Proceedings of the 2nd ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2001
2000
SIAM J. Comput., 2000
Parallel Comput., 2000
J. Comb. Optim., 2000
J. Algorithms, 2000
Inf. Process. Lett., 2000
Bioinform., 2000
1999
SIAM J. Discret. Math., 1999
1998
Math. Program., 1998
Math. Program., 1998
J. Algorithms, 1998
Bioinform., 1998
Proceedings of the EuroPar '98 Parallel Processing, 1998
1996
Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems.
J. Comput. Syst. Sci., 1996
Proceedings of the Seventh Annual ACMSIAM Symposium on Discrete Algorithms, 1996
1995
J. Comput. Syst. Sci., 1995
J. Algorithms, 1995
Proceedings of the Sixth Annual ACMSIAM Symposium on Discrete Algorithms, 1995
1994
An O(n²) DivideandConquer Algorithm for the Prime Tree Decomposition of TwoStructures and Modular Decomposition of Graphs.
J. Algorithms, 1994
Algorithmica, 1994
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994
1993
A Representation for Crossing Set Families with Applications to Submodular Flow Problems.
Proceedings of the Fourth Annual ACM/SIGACTSIAM Symposium on Discrete Algorithms, 1993
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993
1992
Algorithmica, 1992
1991
J. ACM, 1991
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
1990
Proceedings of the First Annual ACMSIAM Symposium on Discrete Algorithms, 1990
1989
SIAM J. Comput., 1989
J. ACM, 1989
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
1988
SIAM J. Comput., 1988
J. Algorithms, 1988
Inf. Process. Lett., 1988
Relaxed Heaps: An Alternative to Fibonacci Heaps with Applications to Parallel Computation.
Commun. ACM, 1988
AlmostOptimum Speedups of Algorithms for Bipartite Matching and Related Problems
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988
1986
An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs.
SIAM J. Comput., 1986
Comb., 1986
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs.
Comb., 1986
1985
J. Comput. Syst. Sci., 1985
J. Comput. Syst. Sci., 1985
Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract).
Proceedings of the Automata, 1985
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985
1984
J. Algorithms, 1984
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
1983
An Efficient Reduction Technique for DegreeConstrained Subgraph and Bidirected Network Flow Problems
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983
1982
SIAM J. Comput., 1982
J. ACM, 1982
Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982
1981
Inf. Process. Lett., 1981
1979
J. ACM, 1979
Algorithmic proofs of two relations between connectivity and the 1factors of a graph.
Discret. Math., 1979
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979
1978
SIAM J. Comput., 1978
Networks, 1978
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978
1977
SIAM J. Comput., 1977
1976
IEEE Trans. Software Eng., 1976
Math. Program., 1976
J. ACM, 1976
Inf. Process. Lett., 1976
Inf. Process. Lett., 1976
Int. J. Parallel Program., 1976
Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976