Dorit S. Hochbaum

152 papers receiving 5.7k citations

Hit Papers

A Best Possible Heuristic for the k-Center Problem198520261998201219851985100200300400500

Peers

Dorit S. Hochbaum
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
Replace Ravindra K. Ahuja with:
Ravindra K. Ahuja United States
David P. Williamson United States
Gerhard J. Woeginger Netherlands
James B. Orlin United States
Rainer E. Burkard Austria
Martin Grötschel Germany
Toshihide Ibaraki Japan
Jack Edmonds Canada
David B. Shmoys United States
Silvano Martello Italy
Dorit S. Hochbaum relative to Ravindra K. Ahuja United States Ravindra K. Ahuja's profile →
Citations per field
00.5×1.5×2.1×
Ravindra K. Ahuja · 1×
Citations per year

Countries citing papers authored by Dorit S. Hochbaum

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

20 of 20 papers shown
#WorkIndexed 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

About Dorit S. Hochbaum

Dorit S. Hochbaum is a scholar working on Computer Graphics and Computer-Aided Design, Industrial and Manufacturing Engineering and Computational Theory and Mathematics, having authored 163 papers that have together received 6.2k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (48 papers), Optimization and Search Problems (44 papers) and Advanced Graph Theory Research (37 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (758 citations), Industrial and Manufacturing Engineering (1.8k citations) and Computational Theory and Mathematics (1.8k citations). Dorit S. Hochbaum has collaborated with scholars based in United States, Israel and Chile. Frequent co-authors include David B. Shmoys, Wolfgang Maass, Olivier Goldschmidt, Asaf Levin, J. George Shanthikumar, Vijendra Singh, Marshall L. Fisher, Ron Shamir, Alper Atamtürk and James B. Orlin. Their work appears in journals such as SHILAP Revista de lepidopterología, Bioinformatics and IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

Rankless by CCL
2026