World's Best Scientists 2026 revealed!
Ulrich Pferschy

Ulrich Pferschy

D-Index & Metrics

Mathematics

D-Index
33
Citations
9870
World Ranking
2977
National Ranking
39

Ulrich Pferschy publication distribution in Mathematics in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Mathematics in 2026. The highlighted bar marks where Ulrich Pferschy sits on this spectrum.

42–46 publications: 3 scientists 47–51 publications: 5 scientists 52–56 publications: 7 scientists 57–61 publications: 20 scientists 62–66 publications: 14 scientists 67–71 publications: 25 scientists 72–76 publications: 19 scientists 77–81 publications: 35 scientists 82–86 publications: 50 scientists 87–91 publications: 60 scientists 92–96 publications: 86 scientists 97–101 publications: 84 scientists 102–106 publications: 83 scientists 107–111 publications: 90 scientists 112–116 publications: 99 scientists 117–121 publications: 90 scientists 122–126 publications: 91 scientists 127–131 publications: 109 scientists 132–136 publications: 110 scientists 137–141 publications: 98 scientists 142–146 publications: 112 scientists 147–151 publications: 102 scientists 152–156 publications: 88 scientists 157–161 publications: 106 scientists 162–166 publications: 83 scientists 167–171 publications: 102 scientists 172–176 publications: 77 scientists 177–181 publications: 81 scientists 182–186 publications: 78 scientists 187–191 publications: 71 scientists 192–196 publications: 92 scientists 197–201 publications: 64 scientists 202–206 publications: 69 scientists 207–211 publications: 64 scientists 212–216 publications: 62 scientists 217–221 publications: 58 scientists 222–226 publications: 53 scientists 227–231 publications: 50 scientists 232–236 publications: 46 scientists 237–241 publications: 46 scientists 242–246 publications: 46 scientists 247–251 publications: 43 scientists 252–256 publications: 29 scientists 257–261 publications: 45 scientists 262–266 publications: 30 scientists 267–271 publications: 33 scientists 272–276 publications: 34 scientists 277–281 publications: 30 scientists 282–286 publications: 31 scientists 287–291 publications: 21 scientists 292–296 publications: 34 scientists 297–301 publications: 26 scientists 302–306 publications: 10 scientists 307–311 publications: 17 scientists 312–316 publications: 23 scientists 317–321 publications: 13 scientists 322–326 publications: 16 scientists 327–331 publications: 26 scientists 332–336 publications: 13 scientists 337–341 publications: 13 scientists 342–346 publications: 16 scientists 347–351 publications: 17 scientists 352–356 publications: 12 scientists 357–361 publications: 18 scientists 362–366 publications: 18 scientists 367–371 publications: 9 scientists 372–376 publications: 11 scientists 377–381 publications: 8 scientists 382–386 publications: 8 scientists 387–391 publications: 9 scientists 392–396 publications: 9 scientists 397–401 publications: 8 scientists 402–406 publications: 11 scientists 407–411 publications: 6 scientists 412–416 publications: 6 scientists 417–421 publications: 9 scientists 422–426 publications: 8 scientists 427–431 publications: 5 scientists 432–436 publications: 8 scientists 437–441 publications: 8 scientists 442–446 publications: 4 scientists 447–451 publications: 4 scientists 452–456 publications: 4 scientists 457–461 publications: 2 scientists 462–466 publications: 2 scientists 467–471 publications: 4 scientists 472–476 publications: 3 scientists 477–481 publications: 3 scientists 482–486 publications: 6 scientists 487–491 publications: 3 scientists 492–496 publications: 5 scientists 497–501 publications: 5 scientists 502–506 publications: 1 scientists 507–511 publications: 6 scientists 512–516 publications: 4 scientists 517–521 publications: 1 scientists 522–526 publications: 3 scientists 527–531 publications: 1 scientists 532–536 publications: 4 scientists 537+ publications: 100 scientists
42 publications 537+

This scientist: 159 publications — 43rd percentile

43% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 537 publications or more.

Ulrich Pferschy D-index placement in Mathematics in 2026

The chart shows the D-index (discipline H-index) distribution of Mathematics scientists ranked by Research.com in 2026. The highlighted bar marks where Ulrich Pferschy sits on this spectrum.

30 D-Index: 174 scientists 31 D-Index: 151 scientists 32 D-Index: 174 scientists 33 D-Index: 117 scientists 34 D-Index: 136 scientists 35 D-Index: 127 scientists 36 D-Index: 145 scientists 37 D-Index: 153 scientists 38 D-Index: 150 scientists 39 D-Index: 150 scientists 40 D-Index: 138 scientists 41 D-Index: 136 scientists 42 D-Index: 93 scientists 43 D-Index: 108 scientists 44 D-Index: 115 scientists 45 D-Index: 112 scientists 46 D-Index: 103 scientists 47 D-Index: 75 scientists 48 D-Index: 59 scientists 49 D-Index: 67 scientists 50 D-Index: 60 scientists 51 D-Index: 57 scientists 52 D-Index: 59 scientists 53 D-Index: 62 scientists 54 D-Index: 60 scientists 55 D-Index: 50 scientists 56 D-Index: 42 scientists 57 D-Index: 54 scientists 58 D-Index: 50 scientists 59 D-Index: 42 scientists 60 D-Index: 41 scientists 61 D-Index: 35 scientists 62 D-Index: 40 scientists 63 D-Index: 21 scientists 64 D-Index: 31 scientists 65 D-Index: 27 scientists 66 D-Index: 29 scientists 67 D-Index: 19 scientists 68 D-Index: 25 scientists 69 D-Index: 17 scientists 70 D-Index: 18 scientists 71 D-Index: 12 scientists 72 D-Index: 14 scientists 73 D-Index: 13 scientists 74 D-Index: 18 scientists 75 D-Index: 9 scientists 76 D-Index: 11 scientists 77 D-Index: 10 scientists 78 D-Index: 9 scientists 79 D-Index: 16 scientists 80 D-Index: 12 scientists 81 D-Index: 10 scientists 82 D-Index: 5 scientists 83 D-Index: 5 scientists 84 D-Index: 13 scientists 85 D-Index: 6 scientists 86+ D-Index: 99 scientists
30 D-Index 86+

This scientist: 33 D-Index — 17th percentile

17% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 86 D-Index or more.

Overview

Ulrich Pferschy is affiliated with the University of Graz in Austria and has a research profile focused on engineering and computer science. Their work spans several specialized subfields, including industrial and manufacturing engineering, computer networks and communications, management science and operations research, computational theory and mathematics, and electrical and electronic engineering.

The primary thematic areas of Pferschy's scholarly contributions include:

  • Advanced Manufacturing and Logistics Optimization
  • Optimization and Search Problems
  • Scheduling and Optimization Algorithms
  • Optimization and Packing Problems
  • Game Theory and Voting Systems
  • Advanced Graph Theory Research
  • Auction Theory and Applications

Pferschy has coauthored publications with several researchers, most frequently collaborating with Joachim Schauer, Nina Chiarelli, Martin Milanič, Stefan Lendl, and Gaia Nicosia. These partnerships indicate engagement with a network of researchers working in complementary areas within operations research and applied optimization.

The scholar's publication record includes articles in multiple well-known venues. Among the most frequent publication platforms are arXiv (Cornell University), SSRN Electronic Journal, European Journal of Operational Research, Journal of Scheduling, and Computers & Operations Research.

Notable recent papers by Ulrich Pferschy include:

  • "On the Stackelberg knapsack game," published in 2020 in the European Journal of Operational Research
  • "Approximating the product knapsack problem," published in 2021 in Optimization Letters
  • "Operational Research: methods and applications," published in 2023 in the Journal of the Operational Research Society

Other topical papers by coauthors but relevant to the network of work include "Planning a zero-emission mixed-fleet public bus system with minimal life cycle cost" (2023, Public Transport) and "Mean-variance portfolio optimization based on ordinal information" (2020, Journal of Banking & Finance).

Ulrich Pferschy's work predominantly addresses optimization methodologies and algorithmic challenges related to manufacturing, logistics, scheduling, and game-theoretic contexts. The scholar's expertise in optimization problems is reflected through publications that explore both theoretical and applied aspects, covering various problem formulations and algorithmic solutions within operational research.

Best Publications

  • Multidimensional Knapsack Problems

    Hans Kellerer;Ulrich Pferschy;David Pisinger

  • An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem

    Ivana Ljubić;René Weiskircher;Ulrich Pferschy;Gunnar W. Klau

  • The Multidimensional Knapsack Problem: Structure and Algorithms

    Jakob Puchinger;Günther R. Raidl;Ulrich Pferschy

  • Approximation algorithms for knapsack problems with cardinality constraints

    Alberto Caprara;Hans Kellerer;Ulrich Pferschy;David Pisinger

  • Introduction to NP-Completeness of Knapsack Problems

    Hans Kellerer;Ulrich Pferschy;David Pisinger

  • The Knapsack Problem with Conflict Graphs

    Ulrich Pferschy;Joachim Schauer

  • Approximating Multiobjective Knapsack Problems

    Thomas Erlebach;Hans Kellerer;Ulrich Pferschy

  • The Multiple Subset Sum Problem

    Alberto Caprara;Hans Kellerer;Ulrich Pferschy

  • Paths, trees and matchings under disjunctive constraints

    Andreas Darmann;Ulrich Pferschy;Joachim Schauer;Gerhard J. Woeginger

  • Improved dynamic programming in connection with an FPTAS for the knapsack problem

    Hans Kellerer;Ulrich Pferschy

  • A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem

    Hans Kellerer;Ulrich Pferschy

  • The core concept for the multidimensional knapsack problem

    Jakob Puchinger;Günther R. Raidl;Ulrich Pferschy

  • The Multiple-Choice Knapsack Problem

    Hans Kellerer;Ulrich Pferschy;David Pisinger

  • An efficient fully polynomial approximation scheme for the Subset-Sum problem

    Hans Kellerer;Renata Mansini;Ulrich Pferschy;Maria Grazia Speranza

  • Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem

    Gunnar W. Klau;Ivana Ljubic;Andreas Moser;Petra Mutzel

  • Operational Research: methods and applications

    Unknown

  • Exact solution of the robust knapsack problem

    Michele Monaci;Ulrich Pferschy;Paolo Serafini

  • The maximum flow problem with disjunctive constraints

    Ulrich Pferschy;Joachim Schauer

  • Optimised scheduling in human–robot collaboration – a use case in the assembly of printed circuit boards

    Karin Bogner;Ulrich Pferschy;Roland Unterberger;Herwig Zeiner

  • Approximation schemes for ordered vector packing problems

    Alberto Caprara;Hans Kellerer;Ulrich Pferschy

  • Dynamic programming revisited: improving knapsack algorithms

    U. Pferschy

  • Generating subtour elimination constraints for the TSP from pure integer solutions

    Ulrich Pferschy;Rostislav Stanek

Frequent Co-Authors

Hans Kellerer
Hans Kellerer University of Graz
David Pisinger
David Pisinger Technical University of Denmark
Gerhard J. Woeginger
Gerhard J. Woeginger RWTH Aachen University
Alberto Caprara
Alberto Caprara University of Bologna
Petra Mutzel
Petra Mutzel University of Bonn
Gunnar W. Klau
Gunnar W. Klau Heinrich Heine University Düsseldorf
Rainer E. Burkard
Rainer E. Burkard Graz University of Technology
Michele Monaci
Michele Monaci University of Bologna
Atanas G. Atanasov
Atanas G. Atanasov Medical University of Vienna

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students pursuing Mathematics in the USA, exploring related online degrees can enhance both skills and career opportunities. For instance, a masters in digital marketing combines analytical thinking with market trends, ideal for those interested in data-driven marketing strategies.

Business skills are also highly complementary. Many opt for a 1 year mba program to quickly gain leadership and management expertise, fast-tracking career advancement in corporate environments.

Flexibility is key for working professionals. Online programs that allow for online mba transfer credits make continuing education more accessible and affordable, enabling learners to build on prior work or academic experience seamlessly.

For those focused on the intersection of mathematics and technology, pursuing a data analytics master's degree offers advanced training in interpreting complex datasets—an essential skill in today’s data-driven job market.

Best Scientists Citing Ulrich Pferschy

Trending Scientists

Recently Published Articles