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.
Knapsack Problems
20041.2k citationsUlrich Pferschy, David Pisinger et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Ulrich Pferschy
Since
Specialization
Citations
This map shows the geographic impact of Ulrich Pferschy'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 Ulrich Pferschy with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ulrich Pferschy more than expected).
This network shows the impact of papers produced by Ulrich Pferschy. 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 Ulrich Pferschy. The network helps show where Ulrich Pferschy may publish in the future.
Co-authorship network of co-authors of Ulrich Pferschy
This figure shows the co-authorship network connecting the top 25 collaborators of Ulrich Pferschy.
A scholar is included among the top collaborators of Ulrich Pferschy 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 Ulrich Pferschy. Ulrich Pferschy is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Pferschy, Ulrich, Gaia Nicosia, & Andrea Pacifici. (2018). On a Stackelberg Subset Sum Game. Cineca Institutional Research Information System (Tor Vergata University).2 indexed citations
Darmann, Andreas, Ulrich Pferschy, & Joachim Schauer. (2010). Resource allocation with time intervals. Theoretical Computer Science. 411(49). 4217–4234.24 indexed citations
12.
Petutschnigg, Alexander, et al.. (2009). Algorithms to define limits for wood property categorization.. Forest Products Journal. 59. 75–83.4 indexed citations
13.
Leitner, Markus, Günther R. Raidl, & Ulrich Pferschy. (2009). Accelerating Column Generation for a Survivable Network Design Problem.5 indexed citations
14.
Nicosia, Gaia, Andrea Pacifici, & Ulrich Pferschy. (2009). On multi-agent knapsack problems. 44–47.1 indexed citations
15.
Darmann, Andreas, Ulrich Pferschy, Joachim Schauer, & Gerhard J. Woeginger. (2009). Combinatorial optimization problems with conflict graphs. TU/e Research Portal. 52(6). 293–296.3 indexed citations
Klau, Gunnar W., Ivana Ljubić, Petra Mutzel, Ulrich Pferschy, & René Weiskircher. (2003). The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract.. European Symposium on Algorithms. 691–702.1 indexed citations
18.
Burkard, Rainer E., Ulrich Pferschy, & Rüdiger Rudolf. (1997). On-line waste management in a galvanization plant. Yugoslav journal of operations research. 7(1). 1–13.1 indexed citations
Pferschy, Ulrich, Rüdiger Rudolf, & Gerhard J. Woeginger. (1994). Some geometric clustering problems. Nordic journal of computing. 1(2). 246–263.12 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.