Harold N. Gabow

8.7k total citations
118 papers, 4.7k citations indexed

About

Harold N. Gabow is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Computer Vision and Pattern Recognition. According to data from OpenAlex, Harold N. Gabow has authored 118 papers receiving a total of 4.7k indexed citations (citations by other indexed papers that have themselves been cited), including 84 papers in Computational Theory and Mathematics, 52 papers in Computer Networks and Communications and 19 papers in Computer Vision and Pattern Recognition. Recurrent topics in Harold N. Gabow's work include Advanced Graph Theory Research (75 papers), Complexity and Algorithms in Graphs (57 papers) and Optimization and Search Problems (28 papers). Harold N. Gabow is often cited by papers focused on Advanced Graph Theory Research (75 papers), Complexity and Algorithms in Graphs (57 papers) and Optimization and Search Problems (28 papers). Harold N. Gabow collaborates with scholars based in United States, Israel and France. Harold N. Gabow's co-authors include Robert E. Tarjan, Zvi Galil, Thomas H. Spencer, Jon Bentley, Oded Kariv, Eugene W. Myers, Leon J. Osterweil, Sachin Maheshwari, Silvio Micali and Ying Xu and has published in prestigious journals such as Bioinformatics, Communications of the ACM and IEEE Transactions on Software Engineering.

In The Last Decade

Harold N. Gabow

114 papers receiving 4.3k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Harold N. Gabow United States	35	2.3k	1.9k	813	724	596	118	4.7k
Jack Edmonds Canada	20	3.4k 1.5×	2.0k 1.0×	1.1k 1.4×	1.1k 1.5×	514 0.9×	42	6.9k
Michael L. Fredman United States	26	2.0k 0.9×	1.6k 0.8×	1.7k 2.1×	475 0.7×	588 1.0×	56	4.9k
Shimon Even Israel	33	2.4k 1.1×	2.3k 1.2×	1.7k 2.1×	891 1.2×	388 0.7×	94	5.5k
Kurt Mehlhorn Germany	41	1.9k 0.8×	1.5k 0.8×	1.7k 2.1×	628 0.9×	1.1k 1.9×	273	5.6k
Baruch Schieber United States	33	1.2k 0.5×	2.0k 1.1×	786 1.0×	564 0.8×	279 0.5×	129	3.5k
Joseph Naor Israel	40	2.3k 1.0×	3.7k 1.9×	1.4k 1.7×	1.1k 1.5×	356 0.6×	197	6.7k
David Eppstein United States	43	2.0k 0.9×	1.8k 0.9×	1.2k 1.5×	748 1.0×	1.9k 3.2×	248	6.5k
Vašek Chvátal Canada	33	3.9k 1.7×	1.8k 0.9×	1.2k 1.4×	929 1.3×	661 1.1×	97	6.8k
Alon Itai Israel	34	1.6k 0.7×	2.1k 1.1×	1.4k 1.8×	752 1.0×	308 0.5×	70	4.4k
Clifford Stein United States	30	1.2k 0.5×	2.8k 1.5×	1.2k 1.4×	823 1.1×	229 0.4×	105	5.4k

Countries citing papers authored by Harold N. Gabow

Since Specialization

Citations

This map shows the geographic impact of Harold N. Gabow's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Harold N. Gabow with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Harold N. Gabow more than expected).

Fields of papers citing papers by Harold N. Gabow

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Harold N. Gabow. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Harold N. Gabow. The network helps show where Harold N. Gabow may publish in the future.

Co-authorship network of co-authors of Harold N. Gabow

This figure shows the co-authorship network connecting the top 25 collaborators of Harold N. Gabow. A scholar is included among the top collaborators of Harold N. Gabow based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Harold N. Gabow. Harold N. Gabow is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Gabow, Harold N.. (2023). A Weight-Scaling Algorithm for f-Factors of Multigraphs. Algorithmica. 85(10). 3214–3289. 1 indexed citations

Gabow, Harold N.. (2017). The Weighted Matching Approach to Maximum Cardinality Matching. Fundamenta Informaticae. 154(1-4). 109–130. 10 indexed citations

Gabow, Harold N.. (2012). A combinatoric interpretation of dual variables for weighted matching and f-factors. Theoretical Computer Science. 454. 136–163. 3 indexed citations

Stallmann, Matthias F. & Harold N. Gabow. (2005). An Augmenting Path Algorithm For The Parity Problem On Linear Matroids. 217–228. 1 indexed citations

Gabow, Harold N.. (2004). Finding paths and cycles of superpolylogarithmic length. 407–416. 13 indexed citations

Hirzel, Martin, Harold N. Gabow, & Amer Diwan. (2003). Choosing a Set of Partitions to Collect in a Connectivity-Based Garbage Collector ; CU-CS-958-03. CU Scholar (University of Colorado Boulder). 1 indexed citations

Gabow, Harold N. & Tadayoshi Kohno. (2001). A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis. ACM Journal of Experimental Algorithmics. 6. 3–3. 5 indexed citations

Bang‐Jensen, Jørgen, Harold N. Gabow, Tibor Jordán, & Zoltán Szigeti. (1998). Edge-connectivity augmentation with partition constraints. Symposium on Discrete Algorithms. 306–315. 9 indexed citations

Gabow, Harold N.. (1998). Algorithms for Graphic Polymatroids and Parametrics-Sets. Journal of Algorithms. 26(1). 48–86. 19 indexed citations

10.

Cary, Robert B., et al.. (1998). An RNA folding method capable of identifying pseudoknots and base triples.. Bioinformatics. 14(8). 691–699. 103 indexed citations

11.

Gabow, Harold N.. (1995). Algorithms for graphic polymatroids and parametric s-Sets. Symposium on Discrete Algorithms. 88–97. 4 indexed citations

12.

Gabow, Harold N.. (1995). A Matroid Approach to Finding Edge Connectivity and Packing Arborescences. Journal of Computer and System Sciences. 50(2). 259–273. 56 indexed citations

13.

Gabow, Harold N.. (1993). A representation for crossing set families with applications to submodular flow problems. Symposium on Discrete Algorithms. 202–211. 34 indexed citations

14.

Gabow, Harold N.. (1990). Data structures for weighted matching and nearest common ancestors with linking. Symposium on Discrete Algorithms. 434–443. 228 indexed citations

15.

Gabow, Harold N. & Matthias F. Stallmann. (1985). Efficient Algorithms for Graphic Intersection and Parity (Extended Abstract). International Colloquium on Automata, Languages and Programming. 210–220. 21 indexed citations

16.

Gabow, Harold N. & Oded Kariv. (1982). Algorithms for Edge Coloring Bipartite Graphs and Multigraphs. SIAM Journal on Computing. 11(1). 117–129. 87 indexed citations

17.

Galil, Zvi, Silvio Micali, & Harold N. Gabow. (1982). Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs. 255–261. 22 indexed citations

18.

Gabow, Harold N. & Eugene W. Myers. (1978). Finding All Spanning Trees of Directed and Undirected Graphs. SIAM Journal on Computing. 7(3). 280–287. 102 indexed citations

19.

Gabow, Harold N.. (1978). A good algorithm for smallest spanning trees with a degree constraint. Networks. 8(3). 201–208. 33 indexed citations

20.

Gabow, Harold N.. (1972). An efficient implementation of Edmonds'' maximum matching algorithm.. 14(5). 9 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact