Dorit S. Hochbaum
About
In The Last Decade
Dorit S. Hochbaum
152 papers receiving 5.7k citations
Hit Papers
Peers
Comparison fields: 5 of 146
- Computer Networks and Communications 2.3k
- Computational Theory and Mathematics 1.8k
- Industrial and Manufacturing Engineering 1.8k
- Artificial Intelligence 823
- Computer Graphics and Computer-Aided Design 758
Countries citing papers authored by Dorit S. Hochbaum
This map shows the geographic impact of Dorit S. Hochbaum'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 Dorit S. Hochbaum with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dorit S. Hochbaum more than expected).
Fields of papers citing papers by Dorit S. Hochbaum
This network shows the impact of papers produced by Dorit S. Hochbaum. 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 Dorit S. Hochbaum. The network helps show where Dorit S. Hochbaum may publish in the future.
Co-authorship network of co-authors of Dorit S. Hochbaum
This figure shows the co-authorship network connecting the top 25 collaborators of Dorit S. Hochbaum. A scholar is included among the top collaborators of Dorit S. Hochbaum 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 Dorit S. Hochbaum. Dorit S. Hochbaum is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 3 | |
| 3 | 0 | |
| 4 | 0 | |
| 5 | 1 | |
| 6 | 18 | |
| 7 | 5 | |
| 8 | 1 | |
| 9 | DISPATCH: An Optimal Algorithm for Online Perfect Bipartite Matching with i.i.d. Arrivals. | 1 |
| 10 | 4 | |
| 11 | Experimental Analysis of the MRF Algorithm for Segmentation of Noisy Medical Images | 5 |
| 12 | 0 | |
| 13 | 41 | |
| 14 | 32 | |
| 15 | 3 | |
| 16 | 11 | |
| 17 | Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems | 132 |
| 18 | Various notions of approximations: good, better, best, and more | 25 |
| 19 | On the Impossibility of Strongly Polynomial Algorithms for the Allocation Problem and its Extensions | 3 |
| 20 | 28 |
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.