☰

Harold N. Gabow

Affiliations: 
University of Colorado, Boulder, Boulder, CO, United States 
Area:
Computer Science
Google:
"Harold Gabow"
Tree Publications Similar researchers PubMed Report error

Parents

Sign in to add mentor

Children

Sign in to add trainee
San Skulrattanakulchai grad student 2002 CU Boulder
Shuxin Nie grad student 2008 CU Boulder

Collaborators

Sign in to add collaborator
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Gabow HN, Sankowski P. (2021) Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths Siam Journal On Computing. 50: 555-601
Gabow HN, Sankowski P. (2021) Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors Siam Journal On Computing. 50: 440-486
Gabow HN. (2018) Data Structures for Weighted Matching and Extensions to b -matching and f -factors Acm Transactions On Algorithms. 14: 1-80
Gabow HN. (2017) A Data Structure for Nearest Common Ancestors with Linking Acm Transactions On Algorithms. 13: 45
Gabow HN. (2016) The minset-poset approach to representations of graph connectivity Acm Transactions On Algorithms. 12
Cygan M, Gabow HN, Sankowski P. (2015) Algorithmic applications of Baur-Strassen's theorem: Shortest cycles, diameter, and matchings Journal of the Acm. 62
Gabow HN, Sankowski P. (2013) Algebraic algorithms for b-matching, shortest undirected paths, and f-factors Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 137-146
Chang J, Gabow HN, Khuller S. (2013) A Model for Minimizing Active Processor Time Algorithmica. 1-38
Cygan M, Gabow HN, Sankowski P. (2012) Algorithmic applications of Baur-Strassen's theorem: Shortest cycles, diameter and matchings Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 531-540
Gabow HN, Goemans MX, Tardos É, et al. (2009) Approximating the smallest k-edge connected spanning subgraph by LP-rounding Networks. 53: 345-357
See more...