Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Countries citing papers authored by Horst W. Hamacher
Since
Specialization
Citations
This map shows the geographic impact of Horst W. Hamacher'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 Horst W. Hamacher with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Horst W. Hamacher more than expected).
Fields of papers citing papers by Horst W. Hamacher
This network shows the impact of papers produced by Horst W. Hamacher. 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 Horst W. Hamacher. The network helps show where Horst W. Hamacher may publish in the future.
Co-authorship network of co-authors of Horst W. Hamacher
This figure shows the co-authorship network connecting the top 25 collaborators of Horst W. Hamacher.
A scholar is included among the top collaborators of Horst W. Hamacher 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 Horst W. Hamacher. Horst W. Hamacher is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Hamacher, Horst W., et al.. (2014). Hierarchical Edge Colorings and Rehabilitation Therapy Planning in Germany. Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology).2 indexed citations
Hamacher, Horst W., et al.. (2005). Finding Representative Systems for Discrete Bicriteria Optimization Problems by Box Algorithms. Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology).7 indexed citations
Hamacher, Horst W., Stefan Nickel, & Anja Schneider. (1999). Classification of Location Problems. Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology). 15(22). 8684–91.16 indexed citations
15.
Ehrgott, Matthias, et al.. (1996). Heuristics for the K-Cardinality Tree and Subgraph Problems. Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology).23 indexed citations
Hamacher, Horst W., et al.. (1993). Ranking Approach to Max-Ordering Combinatorial Optimization and Network Flows. Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology).4 indexed citations
Fischetti, Matteo, Horst W. Hamacher, Kurt Jörnsten, & Francesco Maffioli. (1992). Weighted k-cardinality trees. Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology).19 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.