World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
47
Citations
6441
World Ranking
6620
National Ranking
313

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