Travelled to:1 × Canada
1 × Greece
7 × USA
Collaborated with:∅ R.E.Tarjan H.H.Westermann M.F.M.Stallmann O.Kariv H.Kaplan J.L.Bentley
Talks about:algorithm (7) problem (3) matroid (3) effici (3) techniqu (2) bipartit (2) relat (2) match (2) graph (2) find (2)
Person: Harold N. Gabow
DBLP: Gabow:Harold_N=
Facilitated 1 volumes:
EdContributed to:
20041999199419911988
1985198419831978Wrote 11 papers:
- STOC-2004-Gabow
- Finding paths and cycles of superpolylogarithmic length (HNG), pp. 407–416.
- STOC-1999-GabowKT #algorithm
- Unique Maximum Matching Algorithms (HNG, HK, RET), pp. 70–78.
- STOC-1994-Gabow #algorithm #graph #performance
- Efficient splitting off algorithms for graphs (HNG), pp. 696–705.
- STOC-1991-Gabow #approach
- A Matroid Approach to Finding Edge Connectivity and Packing Arborescences (HNG), pp. 112–122.
- STOC-1988-GabowT #algorithm #problem
- Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems (HNG, RET), pp. 514–527.
- STOC-1988-GabowW #algorithm #game studies
- Forests, Frames and Games: Algorithms for Matroid Sums and Applications (HNG, HHW), pp. 407–421.
- ICALP-1985-GabowS #algorithm #performance
- Efficient Algorithms for Graphic Matroid Intersection and Parity (HNG, MFMS), pp. 210–220.
- STOC-1984-GabowBT #geometry #problem #scalability
- Scaling and Related Techniques for Geometry Problems (HNG, JLB, RET), pp. 135–143.
- STOC-1983-Gabow #network #performance #problem #reduction
- An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems (HNG), pp. 448–456.
- STOC-1983-GabowT #algorithm #linear #set
- A Linear-Time Algorithm for a Special Case of Disjoint Set Union (HNG, RET), pp. 246–251.
- STOC-1978-GabowK #algorithm #graph
- Algorithms for Edge Coloring Bipartite Graphs (HNG, OK), pp. 184–192.