( en | de | ru )

 

Disambiguation of "Gabow, Harold N."

Author of the publication

copydeleteadd this publication to your clipboard
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005

, and (Eds.) ACM, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

n n n

Harold Priestley

Harold Ebneth

Harold Hurwitz

Harold Haber

 

Other publications of authors with the same name

Algorithms for Graphic Polymatroids and Parametric s-Sets.. SODA, page 88-97. ACM/SIAM, (1995)A Linear-Time Algorithm for a Special Case of Disjoint Set Union., and . J. Comput. Syst. Sci., 30 (2): 209-221 (1985)A Matroid Approach to Finding Edge Connectivity and Packing Arborescences.. J. Comput. Syst. Sci., 50 (2): 259-273 (1995)Scaling Algorithms for Network Problems.. J. Comput. Syst. Sci., 31 (2): 148-168 (1985)Finding Long Paths, Cycles and Circuits., and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 752-763. Springer, (2008)Applications of a Poset Representation to Edge Connectivity and Graph Rigidity. FOCS, page 812-821. IEEE Computer Society, (1991)Performance Analysis and Portability of the PLUM Load Balancing System., , and . Euro-Par, volume 1470 of Lecture Notes in Computer Science, page 307-317. Springer, (1998)Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs., and . IPCO, volume 920 of Lecture Notes in Computer Science, page 388-402. Springer, (1995)Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract)., and . ICALP, volume 194 of Lecture Notes in Computer Science, page 210-220. Springer, (1985)Using Expander Graphs to Find Vertex Connectivity.. FOCS, page 410-420. IEEE Computer Society, (2000)