Остановите войну!
for scientists:
default search action
Harold N. Gabow
- > Home > Persons > Harold N. Gabow
Publications
- 2021
- [j71]Harold N. Gabow, Piotr Sankowski:
Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors. SIAM J. Comput. 50(2): 440-486 (2021) - [j70]Harold N. Gabow, Piotr Sankowski:
Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths. SIAM J. Comput. 50(2): 555-601 (2021) - 2015
- [j65]Marek Cygan, Harold N. Gabow, Piotr Sankowski:
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings. J. ACM 62(4): 28:1-28:30 (2015) - 2014
- [j64]Jessica Chang, Harold N. Gabow, Samir Khuller:
A Model for Minimizing Active Processor Time. Algorithmica 70(3): 368-405 (2014) - 2013
- [c49]Harold N. Gabow, Piotr Sankowski:
Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors. FOCS 2013: 137-146 - [i3]Harold N. Gabow, Piotr Sankowski:
Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and f-Factors. CoRR abs/1304.6740 (2013) - 2012
- [c48]Jessica Chang, Harold N. Gabow, Samir Khuller:
A Model for Minimizing Active Processor Time. ESA 2012: 289-300 - [c47]Marek Cygan, Harold N. Gabow, Piotr Sankowski:
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings. FOCS 2012: 531-540 - [i2]Marek Cygan, Harold N. Gabow, Piotr Sankowski:
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings. CoRR abs/1204.1616 (2012) - [i1]Jessica Chang, Harold N. Gabow, Samir Khuller:
A Model for Minimizing Active Processor Time. CoRR abs/1208.0312 (2012) - 2009
- [j61]Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson:
Approximating the smallest k-edge connected spanning subgraph by LP-rounding. Networks 53(4): 345-357 (2009) - 2007
- [j56]Harold N. Gabow, Michael A. Bender, Martin Farach-Colton:
Introduction to SODA 2002 and 2003 special issue. ACM Trans. Algorithms 3(4): 36 (2007) - 2005
- [c42]Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson:
Approximating the smallest k-edge connected spanning subgraph by LP-rounding. SODA 2005: 562-571 - [e1]Harold N. Gabow, Ronald Fagin:
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005. ACM 2005, ISBN 1-58113-960-8 [contents] - 2003
- [p1]Harold N. Gabow, Camil Demetrescu, Irene Finocchi, Giuseppe Francesco Italiano, Giuseppe Liotta, Roberto Tamassia, Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Graphs in Computer Science. Handbook of Graph Theory 2003: 952-1073 - 2002
- [c35]Harold N. Gabow, Seth Pettie:
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms. SWAT 2002: 190-199 - 2001
- [j47]Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan:
Unique Maximum Matching Algorithms. J. Algorithms 40(2): 159-183 (2001) - 2000
- [j43]Monika Rauch Henzinger, Satish Rao, Harold N. Gabow:
Computing Vertex Connectivity: New Bounds from Old Techniques. J. Algorithms 34(2): 222-250 (2000) - 1999
- [c30]Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan:
Unique Maximum Matching Algorithms. STOC 1999: 70-78 - 1998
- [j38]Jack E. Tabaska, Robert B. Cary, Harold N. Gabow, Gary D. Stormo:
An RNA folding method capable of identifying pseudoknots and base triples. Bioinform. 14(8): 691-699 (1998) - [j36]Harold N. Gabow, Michel X. Goemans, David P. Williamson:
An efficient approximation algorithm for the survivable network design problem. Math. Program. 82: 13-40 (1998) - 1996
- [c27]Monika Rauch Henzinger, Satish Rao, Harold N. Gabow:
Computing Vertex Connectivity: New Bounds from Old Techniques. FOCS 1996: 462-471 - 1994
- [j30]Andrzej Ehrenfeucht, Harold N. Gabow, Ross M. McConnell, Stephen J. Sullivan:
An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs. J. Algorithms 16(2): 283-294 (1994) - 1993
- [c20]Harold N. Gabow, Michel X. Goemans, David P. Williamson:
An efficient approximation algorithm for the survivable network design problem. IPCO 1993: 57-74 - 1991
- [j28]Harold N. Gabow, Robert Endre Tarjan:
Faster Scaling Algorithms for General Graph-Matching Problems. J. ACM 38(4): 815-853 (1991) - 1989
- [j27]Harold N. Gabow, Zvi Galil, Thomas H. Spencer:
Efficient implementation of graph algorithms using contraction. J. ACM 36(3): 540-572 (1989) - [j26]Harold N. Gabow, Robert Endre Tarjan:
Faster Scaling Algorithms for Network Problems. SIAM J. Comput. 18(5): 1013-1036 (1989) - 1988
- [j25]James R. Driscoll, Harold N. Gabow, Ruth Shrairman, Robert Endre Tarjan:
Relaxed Heaps: An Alternative to Fibonacci Heaps with Applications to Parallel Computation. Commun. ACM 31(11): 1343-1354 (1988) - [j24]Harold N. Gabow, Robert Endre Tarjan:
A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest. Inf. Process. Lett. 27(5): 259-263 (1988) - [j23]Harold N. Gabow, Robert Endre Tarjan:
Algorithms for Two Bottleneck Optimization Problems. J. Algorithms 9(3): 411-417 (1988) - [c13]Harold N. Gabow, Robert Endre Tarjan:
Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems. STOC 1988: 514-527 - 1986
- [j21]Harold N. Gabow, Zvi Galil, Thomas H. Spencer, Robert Endre Tarjan:
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Comb. 6(2): 109-122 (1986) - [j19]Zvi Galil, Silvio Micali, Harold N. Gabow:
An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs. SIAM J. Comput. 15(1): 120-130 (1986) - 1985
- [j18]Harold N. Gabow, Robert Endre Tarjan:
A Linear-Time Algorithm for a Special Case of Disjoint Set Union. J. Comput. Syst. Sci. 30(2): 209-221 (1985) - 1984
- [j16]Harold N. Gabow, Robert Endre Tarjan:
Efficient Algorithms for a Family of Matroid Intersection Problems. J. Algorithms 5(1): 80-131 (1984) - [c9]Harold N. Gabow, Zvi Galil, Thomas H. Spencer:
Efficient Implementation of Graph Algorithms Using Contraction. FOCS 1984: 347-357 - [c8]Harold N. Gabow, Jon Louis Bentley, Robert Endre Tarjan:
Scaling and Related Techniques for Geometry Problems. STOC 1984: 135-143 - 1983
- [c6]Harold N. Gabow, Robert Endre Tarjan:
A Linear-Time Algorithm for a Special Case of Disjoint Set Union. STOC 1983: 246-251 - 1982
- [c4]Zvi Galil, Silvio Micali, Harold N. Gabow:
Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs. FOCS 1982: 255-261 - 1979
- [c3]Harold N. Gabow, Robert Endre Tarjan:
Efficient Algorithms for Simple Matroid Intersection Problems. FOCS 1979: 196-204 - 1978
- [j9]Harold N. Gabow, Eugene W. Myers:
Finding All Spanning Trees of Directed and Undirected Graphs. SIAM J. Comput. 7(3): 280-287 (1978) - 1976
- [j2]Harold N. Gabow, Shachindra N. Maheswari, Leon J. Osterweil:
On Two Problems in the Generation of Program Test Paths. IEEE Trans. Software Eng. 2(3): 227-231 (1976)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-08 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint