World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
47
Citations
6441
World Ranking
6621
National Ranking
314

Burkhard Monien publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Burkhard Monien sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 214 publications — 51st percentile

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

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

Burkhard Monien D-index placement in Computer Science in 2026

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

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 47 D-Index — 56th percentile

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

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

Overview

Burkhard Monien is affiliated with the University of Paderborn in Germany. The primary focus of their research is on economic theories and models, with particular attention to game theory and its applications. Their work spans various related topics, including game theory and voting systems, risk and portfolio optimization, auction theory and applications, and economic theory and institutions.

Their scholarly contributions are situated primarily within the fields of economics, econometrics, and finance, as well as decision sciences. Specifically, their research emphasizes economics and econometrics alongside management science and operations research.

Burkhard Monien has published across multiple venues, which include:

  • arXiv (Cornell University)
  • SIAM Journal on Discrete Mathematics
  • Theoretical Computer Science
  • Theory of Computing Systems

Some notable recent papers authored or coauthored by Burkhard Monien are:

  • Which is the Worst-Case Nash Equilibrium?, 2024, SIAM Journal on Discrete Mathematics
  • (In)Existence of Equilibria for 2-Players, 2-Values Games with Concave Valuations, 2020, arXiv (Cornell University)
  • The complexity of E+Var-equilibria, ESR-equilibria, and SuperE-equilibria for 2-players games with few cost values, 2021, Theoretical Computer Science
  • (In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions, 2022, Theory of Computing Systems

Their collaborations include frequent coauthors such as Marios Mavronicolas, Chryssis Georgiou, Thomas Lücking, Paul G. Spirakis, and Imrich Vrt'o.

Burkhard Monien's research contributes to an understanding of equilibrium concepts in game theory, particularly focusing on Nash equilibria, concave valuations, and computational complexity aspects within economic and strategic decision contexts.

Best Publications

  • Solving satisfiability in less than 2n steps

    Unknown

  • Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping)

    Unknown

  • Efficient schemes for nearest neighbor load balancing

    Ralf Diekmann;Andreas Frommer;Burkhard Monien

  • Embedding one interconnection network in another

    Unknown

  • How to Find Long Paths Efficiently

    Unknown

  • Ramsey numbers and an approximation algorithm for the vertex cover problem

    Unknown

  • The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete

    Unknown

  • Computing Nash Equilibria for Scheduling on Restricted Parallel Links

    Unknown

  • On the number of rounds necessary to disseminate information

    S. Even;B. Monien

  • Load balancing in large networks: a comparative study

    R. Luling;B. Monien;F. Ramme

  • Diffusion Schemes for Load Balancing on Heterogeneous Networks

    Unknown

  • Quality matching and local improvement for multilevel graph-partitioning

    Burkhard Monien;Robert Preis;Ralph Diekmann

  • A dynamic distributed load balancing algorithm with provable good performance

    Reinhard Lüling;Burkhard Monien

  • Using helpful sets to improve graph bisections

    Unknown

  • Load balancing for distributed branch & bound algorithms

    Unknown

  • Simulating binary trees on hypercubes

    Burkhard Monien;Ivan Hal Sudborough

  • A new diffusion-based multilevel algorithm for computing graph partitions

    Henning Meyerhenke;Burkhard Monien;Thomas Sauerwald

  • Congestion games with player-specific constants

    Marios Mavronicolas;Igal Milchtaich;Burkhard Monien;Karsten Tiemann

  • Nearest-neighbor algorithms for load-balancing in parallel computers

    Chengzhong Xu;Francis C. M. Lau;Burkhard Monien;Reinhard Lüling

  • A faster combinatorial approximation algorithm for scheduling unrelated parallel machines

    Unknown

  • Extreme Nash Equilibria

    Martin Gairing;Thomas Lücking;Marios Mavronicolas;Burkhard Monien

  • Which Is the Worst-Case Nash Equilibrium?

    Thomas Lücking;Marios Mavronicolas;Burkhard Monien;Manuel Rode

  • A new diffusion-based multilevel algorithm for computing graph partitions of very high quality

    H. Meyerhenke;B. Monien;T. Sauerwald

  • Graph partitioning and disturbed diffusion

    Henning Meyerhenke;Burkhard Monien;Stefan Schamberger

  • Embedding ladders and caterpillars into the hypercube

    Sergei Bezrukov;Burkhard Monien;Walter Unger;Gerd Wechsung

  • Studying overheads in massively parallel MIN/MAX-tree evaluation

    Ranier Feldmann;Peter Mysliwiete;Burkhard Monien

  • Bandwidth Minimization: An approximation algorithm for caterpillars

    James Haralambides;Fillia Makedon;Burkhard Monien

  • Structure and complexity of extreme Nash equilibria

    M. Gairing;T. Lücking;M. Mavronicolas;B. Monien

  • Voronoi Games on Cycle Graphs

    Marios Mavronicolas;Burkhard Monien;Vicky G. Papadopoulou;Florian Schoppmann

  • Superlinear Speedup for Parallel Backtracking

    Ewal Speckenmeyer;Burkhard Monien;Oliver Vornberger

  • Diffusive load balancing schemes on heterogeneous networks

    Robert Elsässer;Burkhard Monien;Robert Preis

  • The Aircraft Sequencing Problem

    Torsten Fahle;Rainer Feldmann;Silvia Götz;Sven Grothklags

Frequent Co-Authors

Paul G. Spirakis
Paul G. Spirakis University of Liverpool
Andreas Frommer
Andreas Frommer University of Wuppertal
Wojciech Rytter
Wojciech Rytter University of Warsaw
Jürgen Teich
Jürgen Teich University of Erlangen-Nuremberg
Jean-Pierre Tillich
Jean-Pierre Tillich French Institute for Research in Computer Science and Automation - INRIA
Fillia Makedon
Fillia Makedon The University of Texas at Arlington
Maxime Crochemore
Maxime Crochemore King's College London
Christian Scheideler
Christian Scheideler University of Paderborn
Francis C. M. Lau
Francis C. M. Lau Hong Kong Polytechnic University
Alois Knoll
Alois Knoll Technical University of Munich

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 interested in expanding their career options beyond Computer Science, there are several flexible and affordable online degree pathways to consider. Many universities now offer accredited programs in related STEM fields that prepare graduates for in-demand tech roles and engineering careers.

Pursuing an online mechanical engineering degree can be a practical choice for those seeking hands-on, design-focused roles in the tech and automotive industries. If your interests lean toward scientific research or academia, you might be asking, can you get a physics degree online? The answer is yes—there are reputable programs offering flexible online coursework in physics.

Data science continues to be one of the fastest-growing fields. Many students are looking for an affordable data science degree to launch a tech-centered analytics career. Similarly, those drawn to technology and innovation may explore an electrical engineering degree online admissions route. These degrees provide a solid foundation for thriving in today’s rapidly evolving tech landscape.

Best Scientists Citing Burkhard Monien

Trending Scientists

Recently Published Articles