Burkhard Monien

ORCID

Publication Activity (10 Years)

Years Active: 1970-2024
Publications (10 Years): 9

Top Venues

Theor. Comput. Sci.

CoRR

Theory Comput. Syst.

Adventures Between Lower Bounds and Higher Altitudes

Publications

Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis, Imrich Vrto
Which is the Worst-Case Nash Equilibrium? SIAM J. Discret. Math. 38 (2) (2024)
Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien
(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions. Theory Comput. Syst. 66 (5) (2022)
Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien
The complexity of (E+Var)-equilibria, ESR-equilibria, and SuperE-equilibria for 2-players games with few cost values. Theor. Comput. Sci. 860 (2021)
Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien
(In)Existence of Equilibria for 2-Players, 2-Values Games with Concave Valuations. CoRR (2020)
Marios Mavronicolas, Burkhard Monien
Conditional Value-at-Risk: Structure and complexity of equilibria. Theor. Comput. Sci. 807 (2020)
Marios Mavronicolas, Burkhard Monien
NP -Hardness of Equilibria in Case of Risk-Averse Players. Adventures Between Lower Bounds and Higher Altitudes (2018)
Burkhard Monien, Gerd Wechsung
Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube. J. Graph Theory 87 (4) (2018)
Marios Mavronicolas, Burkhard Monien
Conditional Value-at-Risk: Structure and Complexity of Equilibria. SAGT (2017)
Marios Mavronicolas, Burkhard Monien
The complexity of equilibria for risk-modeling valuations. Theor. Comput. Sci. 634 (2016)
Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner
Weighted Boolean Formula Games. Algorithms, Probability, Networks, and Games (2015)
Marios Mavronicolas, Burkhard Monien
The complexity of pure equilibria in mix-weighted congestion games on parallel links. Inf. Process. Lett. 115 (12) (2015)
Marios Mavronicolas, Burkhard Monien
The Complexity of Equilibria for Risk-Modeling Valuations. CoRR (2015)
Marios Mavronicolas, Burkhard Monien
Minimizing Expectation Plus Variance. Theory Comput. Syst. 57 (3) (2015)
Peter Liggesmeyer, Burkhard Monien
Preface to the self-portrayals of the GI Junior Fellows. it Inf. Technol. 56 (5) (2014)
Dominic Dumrauf, Burkhard Monien
-complexity of maximum constraint assignment. Theor. Comput. Sci. 469 (2013)
Marios Mavronicolas, Burkhard Monien, Vicky Papadopoulou Lesta
How many attackers can selfish defenders catch? Discret. Appl. Math. 161 (16-17) (2013)
Dominic Dumrauf, Burkhard Monien
Computing Nash Equilibria for Two-Player Restricted Network Congestion Games is -Complete. Parallel Process. Lett. 22 (4) (2012)
Marios Mavronicolas, Burkhard Monien
Minimizing Expectation Plus Variance. SAGT (2012)
Burkhard Monien, Christian Scheideler
Selfish Distributed Optimization. Euro-Par (2012)
Burkhard Monien
Letter from the President. Bull. EATCS 107 (2012)
Burkhard Monien
Report form the EATCS General Assembly. Bull. EATCS 108 (2012)
Burkhard Monien
Letter from the President. Bull. EATCS 106 (2012)
Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann
Exact Price of Anarchy for Polynomial Congestion Games. SIAM J. Comput. 40 (5) (2011)
Martin Gairing, Burkhard Monien, Karsten Tiemann
Routing (un-) splittable flow in games with player-specific affine latency functions. ACM Trans. Algorithms 7 (3) (2011)
Burkhard Monien, Ulf-Peter Schroeder
Preface. Theory Comput. Syst. 47 (1) (2010)
Burkhard Monien, Tobias Tscheuschner
On the Power of Nodes of Degree Four in the Local Max-Cut Problem. CIAC (2010)
Burkhard Monien, Dominic Dumrauf, Tobias Tscheuschner
Local Search: Simple, Successful, But Sometimes Sluggish. ICALP (1) (2010)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
Computing Nash Equilibria for Scheduling on Restricted Parallel Links. Theory Comput. Syst. 47 (2) (2010)
Dominic Dumrauf, Burkhard Monien, Karsten Tiemann
MultiProcessor Scheduling is PLS-Complete. HICSS (2009)
Henning Meyerhenke, Burkhard Monien, Thomas Sauerwald
A new diffusion-based multilevel algorithm for computing graph partitions. J. Parallel Distributed Comput. 69 (9) (2009)
Rainer Feldmann, Marios Mavronicolas, Burkhard Monien
Nash Equilibria for Voronoi Games on Transitive Graphs. WINE (2009)
Yvonne Bleischwitz, Burkhard Monien
Fair cost-sharing methods for scheduling jobs on parallel machines. J. Discrete Algorithms 7 (3) (2009)
Sven Grothklags, Ulf Lorenz, Burkhard Monien
From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future. Algorithmics of Large and Complex Networks (2009)
Henning Meyerhenke, Burkhard Monien, Stefan Schamberger
Graph partitioning and disturbed diffusion. Parallel Comput. 35 (10-11) (2009)
Dominic Dumrauf, Burkhard Monien
On the Road to -Completeness: 8 Agents in a Singleton Congestion Game. WINE (2008)
Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou
How Many Attackers Can Selfish Defenders Catch? HICSS (2008)
Martin Gairing, Burkhard Monien, Karsten Tiemann
Selfish Routing with Incomplete Information. Theory Comput. Syst. 42 (1) (2008)
Marios Mavronicolas, Burkhard Monien, Vicky Papadopoulou
How Many Attackers Can Selfish Defenders Catch? CoRR (2008)
Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou, Florian Schoppmann
Voronoi Games on Cycle Graphs. MFCS (2008)
Henning Meyerhenke, Burkhard Monien, Thomas Sauerwald
A new diffusion-based multilevel algorithm for computing graph partitions of very high quality. IPDPS (2008)
Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
A new model for selfish routing. Theor. Comput. Sci. 406 (3) (2008)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
Nash equilibria in discrete routing games with convex latency functions. J. Comput. Syst. Sci. 74 (7) (2008)
Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann
Congestion Games with Player-Specific Constants. MFCS (2007)
Burkhard Monien, Karsten Tiemann
Routing and Scheduling with Incomplete Information. DISC (2007)
Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann
To Be or Not to Be (Served). WINE (2007)
Martin Gairing, Burkhard Monien, Andreas Woclaw
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theor. Comput. Sci. 380 (1-2) (2007)
Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner
Weighted Boolean Formula Games. WINE (2007)
Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, Karsten Tiemann
The Power of Two Prices: Beyond Cross-Monotonicity. MFCS (2007)
Burkhard Monien, Robert Preis
Upper bounds on the bisection width of 3- and 4-regular graphs. J. Discrete Algorithms 4 (3) (2006)
Robert Elsässer, Burkhard Monien, Stefan Schamberger
Distributing Unit Size Workload Packages in Heterogeneous Networks. J. Graph Algorithms Appl. 10 (1) (2006)
Yvonne Bleischwitz, Burkhard Monien
Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines. CIAC (2006)
Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann
Exact Price of Anarchy for Polynomial Congestion Games. STACS (2006)
Burkhard Monien, Andreas Woclaw
Scheduling Unrelated Parallel Machines Computational Results. WEA (2006)
Vladimir V. Mazalov, Burkhard Monien, Florian Schoppmann, Karsten Tiemann
Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic. WINE (2006)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
The Price of Anarchy for Restricted Parallel Links. Parallel Process. Lett. 16 (1) (2006)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
The price of anarchy for polynomial social cost. Theor. Comput. Sci. 369 (1-3) (2006)
Burkhard Monien, Guang Gao, Horst Simon, Paul G. Spirakis, Per Stenström
Introduction. J. Parallel Distributed Comput. 66 (5) (2006)
Burkhard Monien
Selfish Routing in Networks. SOFSEM (2006)
Thomas Decker, Thomas Lücking, Burkhard Monien
A 5/4-approximation algorithm for scheduling identical malleable tasks. Theor. Comput. Sci. 361 (2-3) (2006)
Martin Gairing, Burkhard Monien, Karsten Tiemann
Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions. ICALP (1) (2006)
Henning Meyerhenke, Burkhard Monien, Stefan Schamberger
Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid. IPDPS (2006)
Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann
Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. ICALP (2005)
Martin Gairing, Burkhard Monien, Andreas Woclaw
A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines. ICALP (2005)
Martin Gairing, Burkhard Monien, Karsten Tiemann
Selfish routing with incomplete information. SPAA (2005)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis
Structure and complexity of extreme Nash equilibria. Theor. Comput. Sci. 343 (1-2) (2005)
Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. WINE (2005)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
The Price of Anarchy for Polynomial Social Cost. Computing and Markets (2005)
Abderezak Touzene, Khaled Day, Burkhard Monien
Edge-disjoint spanning trees for the generalized butterfly networks and their applications. J. Parallel Distributed Comput. 65 (11) (2005)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
Computing Nash equilibria for scheduling on restricted parallel links. STOC (2004)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
Nash Equilibria in Discrete Routing Games with Convex Latency Functions. ICALP (2004)
Robert Elsässer, Burkhard Monien, Stefan Schamberger
Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks. ESA (2004)
Burkhard Monien, Stefan Schamberger
Graph Partitioning with the Party Library: Helpful-Sets in Practice. SBAC-PAD (2004)
Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
A New Model for Selfish Routing. STACS (2004)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
The Price of Anarchy for Polynomial Social Cost. MFCS (2004)
Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich
New spectral lower bounds on the bisection width of graphs. Theor. Comput. Sci. 320 (2-3) (2004)
Robert Elsässer, Burkhard Monien, Robert Preis, Andreas Frommer
Optimal Diffusion Schemes And Load Balancing On Product Graphs. Parallel Process. Lett. 14 (1) (2004)
Ulf Lorenz, Burkhard Monien
Error analysis in minimax trees. Theor. Comput. Sci. 313 (3) (2004)
Robert Elsässer, Burkhard Monien, Stefan Schamberger
Load Balancing in Dynamic Networks. ISPAN (2004)
Burkhard Monien, Imrich Vrto
Improved bounds on cutwidths of shuffle-exchange and de Bruijn graphs. Parallel Process. Lett. 14 (3-4) (2004)
Torsten Fahle, Rainer Feldmann, Silvia Götz, Sven Grothklags, Burkhard Monien
The Aircraft Sequencing Problem. Computer Science in Perspective (2003)
Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto
Which Is the Worst-Case Nash Equilibrium? MFCS (2003)
Robert Elsässer, Rastislav Kralovic, Burkhard Monien
Sparse topologies with small spectrum size. Theor. Comput. Sci. 307 (3) (2003)
Christian Haubelt, Jürgen Teich, Rainer Feldmann, Burkhard Monien
SAT-Based Techniques in System Synthesis. DATE (2003)
Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
Selfish Routing in Non-cooperative Networks: A Survey. MFCS (2003)
Robert Elsässer, Thomas Lücking, Burkhard Monien
On Spectral Bounds for the k-Partitioning of Graphs. Theory Comput. Syst. 36 (5) (2003)
Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
Nashification and the Coordination Ratio for a Selfish Routing Game. ICALP (2003)
Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
Selfish Routing in Non-Cooperative Networks: A Survey. Bull. EATCS 81 (2003)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis
Extreme Nash Equilibria. ICTCS (2003)
Rainer Feldmann, Christian Haubelt, Burkhard Monien, Jürgen Teich
Fault Tolerances Analysis of Distributed Reconfigurable Systems Using SAT-Based Techniques. FPL (2003)
Robert Elsässer, Burkhard Monien
Load balancing of unit size tokens and expansion properties of graphs. SPAA (2003)
Thomas Decker, Thomas Lücking, Burkhard Monien
A 5/4-Approximation Algorithm for Scheduling Identical Malleable Tasks. WAOA (2003)
Robert Elsässer, Burkhard Monien, Günter Rote, Stefan Schamberger
Toward Optimal Diffusion Matrices. IPDPS (2002)
Robert Elsässer, Burkhard Monien, Robert Preis
Diffusion Schemes for Load Balancing on Heterogeneous Networks. Theory Comput. Syst. 35 (3) (2002)
Ulf Lorenz, Burkhard Monien
The Secret of Selective Game Tree Search, When Using Random-Error Evaluations. STACS (2002)
Thomas Lücking, Burkhard Monien, Manuel Rode
On the Problem of Scheduling Flows on Distributed Networks. MFCS (2002)
Burkhard Monien, Robert Preis
Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. MFCS (2001)
Robert Elsässer, Rastislav Kralovic, Burkhard Monien
Scalable Sparse Topologies with Small Spectrum. STACS (2001)
Robert Elsässer, Thomas Lücking, Burkhard Monien
New spectral bounds on k-partitioning of graphs. SPAA (2001)
Rainer Feldmann, Burkhard Monien, Stefan Schamberger
A Distributed Algorithm to Evaluate Quantified Boolean Formulae. AAAI/IAAI (2000)
Robert Elsässer, Burkhard Monien, Robert Preis
Diffusive load balancing schemes on heterogeneous networks. SPAA (2000)

Burkhard Monien.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Burkhard Monien