| 2013 | FOCS | Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors. | Harold N. Gabow, Piotr Sankowski |
| 2012 | ESA | A Model for Minimizing Active Processor Time. | Jessica Chang, Harold N. Gabow, Samir Khuller |
| 2012 | FOCS | Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings. | Marek Cygan, Harold N. Gabow, Piotr Sankowski |
| 2008 | ISAAC | Finding Long Paths, Cycles and Circuits. | Harold N. Gabow, Shuxin Nie |
| 2008 | SODA | Iterated rounding algorithms for the smallest | Harold N. Gabow, Suzanne Gallagher |
| 2006 | SODA | Upper degree-constrained partial orientations. | Harold N. Gabow |
| 2005 | IPCO | On the L | Harold N. Gabow |
| 2005 | SODA | Approximating the smallest | Harold N. Gabow, Michel X. Goemans, va Tardos, David P. Williamson |
| 2004 | SODA | Special edges, and approximating the smallest directed | Harold N. Gabow |
| 2004 | SODA | Finding a long directed cycle. | Harold N. Gabow, Shuxin Nie |
| 2004 | STOC | Finding paths and cycles of superpolylogarithmic length. | Harold N. Gabow |
| 2003 | SODA | Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph. | Harold N. Gabow |
| 2002 | COCOON | Coloring Algorithms on Subcubic Graphs. | Harold N. Gabow, San Skulrattanakulchai |
| 2002 | SODA | An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph. | Harold N. Gabow |
| 2001 | MOBIHOC | Maximum flow-life curve for a wireless ad hoc network. | Timothy X. Brown, Harold N. Gabow, Qi Zhang |
| 2000 | FMCAD | An Algorithm for Strongly Connected Component Analysis in | Roderick Bloem, Harold N. Gabow, Fabio Somenzi |
| 2000 | FOCS | Using Expander Graphs to Find Vertex Connectivity. | Harold N. Gabow |
| 1999 | SODA | How to Make a Square Grid Framework with Cables Rigid. | Harold N. Gabow, Tibor Jordn |
| 1999 | STOC | Unique Maximum Matching Algorithms. | Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan |
| 1998 | EuroPar | Performance Analysis and Portability of the PLUM Load Balancing System. | Leonid Oliker, Rupak Biswas, Harold N. Gabow |
| 1998 | SODA | Edge-Connectivity Augmentation with Partition Constraints. | Jrgen Bang-Jensen, Harold N. Gabow, Tibor Jordn, Zoltn Szigeti |
| 1996 | FOCS | Computing Vertex Connectivity: New Bounds from Old Techniques. | Monika Rauch Henzinger, Satish Rao, Harold N. Gabow |
| 1996 | SODA | Perfect Arborescence Packing in Preflow Mincut Graphs. | Harold N. Gabow |
| 1995 | IPCO | Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs. | Harold N. Gabow, K. S. Manu |
| 1995 | SODA | Algorithms for Graphic Polymatroids and Parametric s-Sets. | Harold N. Gabow |
| 1994 | ISAAC | Fast Algorithms for Transversal Matroid Intersection Problems | Ying Xu, Harold N. Gabow |
| 1994 | STOC | Efficient splitting off algorithms for graphs. | Harold N. Gabow |
| 1993 | FOCS | A Framework for Cost-scaling Algorithms for Submodular Flow Problems | Harold N. Gabow |
| 1993 | IPCO | An efficient approximation algorithm for the survivable network design problem. | Harold N. Gabow, Michel X. Goemans, David P. Williamson |
| 1993 | SODA | A Representation for Crossing Set Families with Applications to Submodular Flow Problems. | Harold N. Gabow |
| 1991 | FOCS | Applications of a Poset Representation to Edge Connectivity and Graph Rigidity | Harold N. Gabow |
| 1991 | STOC | A Matroid Approach to Finding Edge Connectivity and Packing Arborescences | Harold N. Gabow |
| 1990 | SODA | Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. | Harold N. Gabow |
| 1989 | FOCS | Efficient Algorithms for Independent Assignments on Graphic and Linear Matroids | Harold N. Gabow, Ying Xu |
| 1988 | STOC | Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems | Harold N. Gabow, Robert Endre Tarjan |
| 1988 | STOC | Forests, Frames and Games: Algorithms for Matroid Sums and Applications | Harold N. Gabow, Herbert H. Westermann |
| 1985 | FOCS | A Scaling Algorithm for Weighted Matching on General Graphs | Harold N. Gabow |
| 1985 | ICALP | Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract). | Harold N. Gabow, Matthias F. M. Stallmann |
| 1984 | FOCS | Efficient Implementation of Graph Algorithms Using Contraction | Harold N. Gabow, Zvi Galil, Thomas H. Spencer |
| 1984 | FOCS | An Augmenting Path Algorithm for the Parity Problem on Linear Matroids | Matthias F. M. Stallmann, Harold N. Gabow |
| 1984 | STOC | Scaling and Related Techniques for Geometry Problems | Harold N. Gabow, Jon Louis Bentley, Robert Endre Tarjan |
| 1983 | FOCS | Scaling Algorithms for Network Problems | Harold N. Gabow |
| 1983 | STOC | An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems | Harold N. Gabow |
| 1983 | STOC | A Linear-Time Algorithm for a Special Case of Disjoint Set Union | Harold N. Gabow, Robert Endre Tarjan |
| 1982 | FOCS | Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs | Zvi Galil, Silvio Micali, Harold N. Gabow |
| 1979 | FOCS | Efficient Algorithms for Simple Matroid Intersection Problems | Harold N. Gabow, Robert Endre Tarjan |
| 1978 | STOC | Algorithms for Edge Coloring Bipartite Graphs | Harold N. Gabow, Oded Kariv |
| 1976 | FOCS | Using Comparison Trees to Derive Lower Bounds for Selection Problems | Frank Fussenegger, Harold N. Gabow |