Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBurkhard Monien
Person information
- affiliation: University of Paderborn, Germany
- award (1992): Gottfried Wilhelm Leibniz Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j83]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): 957-995 (2022)- 2021
- [j82]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: 84-97 (2021) - 2020
- [j81]Marios Mavronicolas, Burkhard Monien:
Conditional Value-at-Risk: Structure and complexity of equilibria. Theor. Comput. Sci. 807: 266-283 (2020) - [i4]Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien:
(In)Existence of Equilibria for 2-Players, 2-Values Games with Concave Valuations. CoRR abs/2009.04425 (2020)
2010 – 2019
- 2018
- [j80]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): 561-580 (2018) - [c122]Marios Mavronicolas, Burkhard Monien:
NP NP -Hardness of Equilibria in Case of Risk-Averse Players. Adventures Between Lower Bounds and Higher Altitudes 2018: 409-422 - 2017
- [c121]Marios Mavronicolas, Burkhard Monien:
Conditional Value-at-Risk: Structure and Complexity of Equilibria. SAGT 2017: 131-143 - 2016
- [j79]Marios Mavronicolas, Burkhard Monien:
The complexity of equilibria for risk-modeling valuations. Theor. Comput. Sci. 634: 67-96 (2016) - 2015
- [j78]Marios Mavronicolas, Burkhard Monien:
The complexity of pure equilibria in mix-weighted congestion games on parallel links. Inf. Process. Lett. 115(12): 927-931 (2015) - [j77]Marios Mavronicolas, Burkhard Monien:
Minimizing Expectation Plus Variance. Theory Comput. Syst. 57(3): 617-654 (2015) - [c120]Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner:
Weighted Boolean Formula Games. Algorithms, Probability, Networks, and Games 2015: 49-86 - [i3]Marios Mavronicolas, Burkhard Monien:
The Complexity of Equilibria for Risk-Modeling Valuations. CoRR abs/1510.08980 (2015) - 2014
- [j76]Peter Liggesmeyer, Burkhard Monien:
Preface to the self-portrayals of the GI Junior Fellows. it Inf. Technol. 56(5): 254 (2014) - 2013
- [j75]Marios Mavronicolas, Burkhard Monien, Vicky Papadopoulou Lesta:
How many attackers can selfish defenders catch? Discret. Appl. Math. 161(16-17): 2563-2586 (2013) - [j74]Dominic Dumrauf, Burkhard Monien:
On the PLS-complexity of maximum constraint assignment. Theor. Comput. Sci. 469: 24-52 (2013) - 2012
- [j73]Burkhard Monien:
Letter from the President. Bull. EATCS 106: 3-5 (2012) - [j72]Burkhard Monien:
Letter from the President. Bull. EATCS 107: 3-7 (2012) - [j71]Burkhard Monien:
Report form the EATCS General Assembly. Bull. EATCS 108: 15-23 (2012) - [j70]Dominic Dumrauf, Burkhard Monien:
Computing Nash Equilibria for Two-Player Restricted Network Congestion Games is -Complete. Parallel Process. Lett. 22(4) (2012) - [c119]Burkhard Monien, Christian Scheideler:
Selfish Distributed Optimization. Euro-Par 2012: 1-2 - [c118]Marios Mavronicolas, Burkhard Monien:
Minimizing Expectation Plus Variance. SAGT 2012: 239-250 - 2011
- [j69]Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann:
Exact Price of Anarchy for Polynomial Congestion Games. SIAM J. Comput. 40(5): 1211-1233 (2011) - [j68]Martin Gairing, Burkhard Monien, Karsten Tiemann:
Routing (un-) splittable flow in games with player-specific affine latency functions. ACM Trans. Algorithms 7(3): 31:1-31:31 (2011) - 2010
- [j67]Burkhard Monien, Ulf-Peter Schroeder:
Preface. Theory Comput. Syst. 47(1): 1-2 (2010) - [j66]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
Computing Nash Equilibria for Scheduling on Restricted Parallel Links. Theory Comput. Syst. 47(2): 405-432 (2010) - [c117]Burkhard Monien, Tobias Tscheuschner:
On the Power of Nodes of Degree Four in the Local Max-Cut Problem. CIAC 2010: 264-275 - [c116]Burkhard Monien, Dominic Dumrauf, Tobias Tscheuschner:
Local Search: Simple, Successful, But Sometimes Sluggish. ICALP (1) 2010: 1-17
2000 – 2009
- 2009
- [j65]Yvonne Bleischwitz, Burkhard Monien:
Fair cost-sharing methods for scheduling jobs on parallel machines. J. Discrete Algorithms 7(3): 280-290 (2009) - [j64]Henning Meyerhenke, Burkhard Monien, Thomas Sauerwald:
A new diffusion-based multilevel algorithm for computing graph partitions. J. Parallel Distributed Comput. 69(9): 750-761 (2009) - [j63]Henning Meyerhenke, Burkhard Monien, Stefan Schamberger:
Graph partitioning and disturbed diffusion. Parallel Comput. 35(10-11): 544-569 (2009) - [c115]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: 140-165 - [c114]Dominic Dumrauf, Burkhard Monien, Karsten Tiemann:
MultiProcessor Scheduling is PLS-Complete. HICSS 2009: 1-10 - [c113]Rainer Feldmann, Marios Mavronicolas, Burkhard Monien:
Nash Equilibria for Voronoi Games on Transitive Graphs. WINE 2009: 280-291 - 2008
- [j62]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): 1199-1225 (2008) - [j61]Martin Gairing, Burkhard Monien, Karsten Tiemann:
Selfish Routing with Incomplete Information. Theory Comput. Syst. 42(1): 91-130 (2008) - [j60]Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode:
A new model for selfish routing. Theor. Comput. Sci. 406(3): 187-206 (2008) - [c112]Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou:
How Many Attackers Can Selfish Defenders Catch? HICSS 2008: 470 - [c111]Henning Meyerhenke, Burkhard Monien, Thomas Sauerwald:
A new diffusion-based multilevel algorithm for computing graph partitions of very high quality. IPDPS 2008: 1-13 - [c110]Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou, Florian Schoppmann:
Voronoi Games on Cycle Graphs. MFCS 2008: 503-514 - [c109]Dominic Dumrauf, Burkhard Monien:
On the Road to -Completeness: 8 Agents in a Singleton Congestion Game. WINE 2008: 94-108 - [p3]Burkhard Monien, Ulf Lorenz, Daniel Warner:
Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen?. Taschenbuch der Algorithmen 2008: 285-294 - [e9]Burkhard Monien, Ulf-Peter Schroeder:
Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings. Lecture Notes in Computer Science 4997, Springer 2008, ISBN 978-3-540-79308-3 [contents] - [i2]Marios Mavronicolas, Burkhard Monien, Vicky Papadopoulou:
How Many Attackers Can Selfish Defenders Catch? CoRR abs/0812.4206 (2008) - 2007
- [j59]Martin Gairing, Burkhard Monien, Andreas Woclaw:
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theor. Comput. Sci. 380(1-2): 87-99 (2007) - [c108]Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann:
Congestion Games with Player-Specific Constants. MFCS 2007: 633-644 - [c107]Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, Karsten Tiemann:
The Power of Two Prices: Beyond Cross-Monotonicity. MFCS 2007: 657-668 - [c106]Burkhard Monien, Karsten Tiemann:
Routing and Scheduling with Incomplete Information. DISC 2007: 1-2 - [c105]Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner:
Weighted Boolean Formula Games. WINE 2007: 469-481 - [c104]Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann:
To Be or Not to Be (Served). WINE 2007: 515-528 - [r1]Robert Preis, Burkhard Monien, Stefan Schamberger:
Approximation Algorithms for Multilevel Graph Partitioning. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [b1]Friedhelm Meyer auf der Heide, Burkhard Monien:
New trends in parallel and distributed computing - 6th international Heinz Nixdorf symposium, January 17 - 18, 2006, Heinz Nixdorf MuseumsForum: within the scope of the DFG Collaborative Research Centre 376 Massively Parallel Computing: algorithms, design, methods, applications. HNI-Verlagsschriftenreihe 181, Heinz Nixdorf Institut 2006, ISBN 978-3-939350-00-2, pp. 1-259 - [j58]Burkhard Monien, Robert Preis:
Upper bounds on the bisection width of 3- and 4-regular graphs. J. Discrete Algorithms 4(3): 475-498 (2006) - [j57]Robert Elsässer, Burkhard Monien, Stefan Schamberger:
Distributing Unit Size Workload Packages in Heterogeneous Networks. J. Graph Algorithms Appl. 10(1): 51-68 (2006) - [j56]Burkhard Monien, Guang Gao, Horst D. Simon, Paul G. Spirakis, Per Stenström:
Introduction. J. Parallel Distributed Comput. 66(5): 615-616 (2006) - [j55]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
The Price of Anarchy for Restricted Parallel Links. Parallel Process. Lett. 16(1): 117-132 (2006) - [j54]Thomas Decker, Thomas Lücking, Burkhard Monien:
A 5/4-approximation algorithm for scheduling identical malleable tasks. Theor. Comput. Sci. 361(2-3): 226-240 (2006) - [j53]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
The price of anarchy for polynomial social cost. Theor. Comput. Sci. 369(1-3): 116-135 (2006) - [c103]Yvonne Bleischwitz, Burkhard Monien:
Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines. CIAC 2006: 175-186 - [c102]Martin Gairing, Burkhard Monien, Karsten Tiemann:
Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions. ICALP (1) 2006: 501-512 - [c101]Henning Meyerhenke, Burkhard Monien, Stefan Schamberger:
Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid. IPDPS 2006 - [c100]Burkhard Monien:
Selfish Routing in Networks. SOFSEM 2006: 61-62 - [c99]Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann:
Exact Price of Anarchy for Polynomial Congestion Games. STACS 2006: 218-229 - [c98]Burkhard Monien, Andreas Woclaw:
Scheduling Unrelated Parallel Machines Computational Results. WEA 2006: 195-206 - [c97]Vladimir V. Mazalov, Burkhard Monien, Florian Schoppmann, Karsten Tiemann:
Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic. WINE 2006: 331-342 - 2005
- [j52]Abderezak Touzene, Khaled Day, Burkhard Monien:
Edge-disjoint spanning trees for the generalized butterfly networks and their applications. J. Parallel Distributed Comput. 65(11): 1384-1396 (2005) - [j51]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): 133-157 (2005) - [c96]Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann:
Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. ICALP 2005: 51-65 - [c95]Martin Gairing, Burkhard Monien, Andreas Woclaw:
A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines. ICALP 2005: 828-839 - [c94]Martin Gairing, Burkhard Monien, Karsten Tiemann:
Selfish routing with incomplete information. SPAA 2005: 203-212 - [c93]Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. WINE 2005: 195-209 - [i1]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
The Price of Anarchy for Polynomial Social Cost. Computing and Markets 2005 - 2004
- [j50]Robert Elsässer, Burkhard Monien, Robert Preis, Andreas Frommer:
Optimal Diffusion Schemes And Load Balancing On Product Graphs. Parallel Process. Lett. 14(1): 61-73 (2004) - [j49]Burkhard Monien, Imrich Vrto:
Improved bounds on cutwidths of shuffle-exchange and de Bruijn graphs. Parallel Process. Lett. 14(3-4): 361-366 (2004) - [j48]Ulf Lorenz, Burkhard Monien:
Error analysis in minimax trees. Theor. Comput. Sci. 313(3): 485-498 (2004) - [j47]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): 155-174 (2004) - [c92]Robert Elsässer, Burkhard Monien, Stefan Schamberger:
Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks. ESA 2004: 640-651 - [c91]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode:
Nash Equilibria in Discrete Routing Games with Convex Latency Functions. ICALP 2004: 645-657 - [c90]Robert Elsässer, Burkhard Monien, Stefan Schamberger:
Load Balancing in Dynamic Networks. ISPAN 2004: 193-200 - [c89]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
The Price of Anarchy for Polynomial Social Cost. MFCS 2004: 574-585 - [c88]Burkhard Monien, Stefan Schamberger:
Graph Partitioning with the Party Library: Helpful-Sets in Practice. SBAC-PAD 2004: 198-205 - [c87]Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode:
A New Model for Selfish Routing. STACS 2004: 547-558 - [c86]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
Computing Nash equilibria for scheduling on restricted parallel links. STOC 2004: 613-622 - 2003
- [j46]Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode:
Selfish Routing in Non-Cooperative Networks: A Survey. Bull. EATCS 81: 137-164 (2003) - [j45]Robert Elsässer, Thomas Lücking, Burkhard Monien:
On Spectral Bounds for the k-Partitioning of Graphs. Theory Comput. Syst. 36(5): 461-478 (2003) - [j44]Robert Elsässer, Rastislav Kralovic, Burkhard Monien:
Sparse topologies with small spectrum size. Theor. Comput. Sci. 307(3): 549-565 (2003) - [c85]Torsten Fahle, Rainer Feldmann, Silvia Götz, Sven Grothklags, Burkhard Monien:
The Aircraft Sequencing Problem. Computer Science in Perspective 2003: 152-166 - [c84]Christian Haubelt, Jürgen Teich, Rainer Feldmann, Burkhard Monien:
SAT-Based Techniques in System Synthesis. DATE 2003: 11168-11169 - [c83]Rainer Feldmann, Christian Haubelt, Burkhard Monien, Jürgen Teich:
Fault Tolerances Analysis of Distributed Reconfigurable Systems Using SAT-Based Techniques. FPL 2003: 478-487 - [c82]Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode:
Nashification and the Coordination Ratio for a Selfish Routing Game. ICALP 2003: 514-526 - [c81]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis:
Extreme Nash Equilibria. ICTCS 2003: 1-20 - [c80]Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode:
Selfish Routing in Non-cooperative Networks: A Survey. MFCS 2003: 21-45 - [c79]Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto:
Which Is the Worst-Case Nash Equilibrium? MFCS 2003: 551-561 - [c78]Robert Elsässer, Burkhard Monien:
Load balancing of unit size tokens and expansion properties of graphs. SPAA 2003: 266-273 - [c77]Thomas Decker, Thomas Lücking, Burkhard Monien:
A 5/4-Approximation Algorithm for Scheduling Identical Malleable Tasks. WAOA 2003: 95-108 - 2002
- [j43]Robert Elsässer, Burkhard Monien, Robert Preis:
Diffusion Schemes for Load Balancing on Heterogeneous Networks. Theory Comput. Syst. 35(3): 305-320 (2002) - [c76]Robert Elsässer, Burkhard Monien, Günter Rote, Stefan Schamberger:
Toward Optimal Diffusion Matrices. IPDPS 2002 - [c75]Thomas Lücking, Burkhard Monien, Manuel Rode:
On the Problem of Scheduling Flows on Distributed Networks. MFCS 2002: 495-505 - [c74]Ulf Lorenz, Burkhard Monien:
The Secret of Selective Game Tree Search, When Using Random-Error Evaluations. STACS 2002: 203-214 - [e8]Burkhard Monien, Rainer Feldmann:
Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002, Proceedings. Lecture Notes in Computer Science 2400, Springer 2002, ISBN 3-540-44049-6 [contents] - 2001
- [c73]Burkhard Monien, Robert Preis:
Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. MFCS 2001: 524-536 - [c72]Robert Elsässer, Thomas Lücking, Burkhard Monien:
New spectral bounds on k-partitioning of graphs. SPAA 2001: 255-262 - [c71]Robert Elsässer, Rastislav Kralovic, Burkhard Monien:
Scalable Sparse Topologies with Small Spectrum. STACS 2001: 218-229 - [e7]Burkhard Monien, Viktor K. Prasanna, Sriram Vajapeyam:
High Performance Computing - HiPC 2001, 8th International Conference, Hyderabad, India, December, 17-20, 2001, Proceedings. Lecture Notes in Computer Science 2228, Springer 2001, ISBN 3-540-43009-1 [contents] - 2000
- [j42]Burkhard Monien, Robert Preis, Ralf Diekmann:
Quality matching and local improvement for multilevel graph-partitioning. Parallel Comput. 26(12): 1609-1634 (2000) - [c70]Rainer Feldmann, Burkhard Monien, Stefan Schamberger:
A Distributed Algorithm to Evaluate Quantified Boolean Formulae. AAAI/IAAI 2000: 285-290 - [c69]Thomas Decker, Burkhard Monien, Robert Preis:
Towards Optimal Load Balancing Topologies. Euro-Par 2000: 277-287 - [c68]Robert Elsässer, Burkhard Monien, Robert Preis:
Diffusive load balancing schemes on heterogeneous networks. SPAA 2000: 30-38 - [c67]Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich:
New Spectral Lower Bounds on the Bisection Width of Graphs. WG 2000: 23-34
1990 – 1999
- 1999
- [j41]Burkhard Monien, Rainer Feldmann, H. Jaap van den Herik:
More Information on the 9th World Computer-Chess Championship. J. Int. Comput. Games Assoc. 22(1): 47-53 (1999) - [j40]H. Jaap van den Herik, Burkhard Monien:
Call for Participation: Advances in Computer Chess 9 Conference. J. Int. Comput. Games Assoc. 22(1): 54 (1999) - [j39]H. Jaap van den Herik, Burkhard Monien:
Programme of the ACC9 Conference. J. Int. Comput. Games Assoc. 22(2): 113-114 (1999) - [j38]Burkhard Monien, Rainer Feldmann, H. Jaap van den Herik:
The Latest Information on the 9th World Computer-Chess Championship. J. Int. Comput. Games Assoc. 22(2): 115 (1999) - [j37]Ralf Diekmann, Andreas Frommer, Burkhard Monien:
Efficient schemes for nearest neighbor load balancing. Parallel Comput. 25(7): 789-812 (1999) - [c66]Robert Elsässer, Andreas Frommer, Burkhard Monien, Robert Preis:
Optimal and Alternating-Direction Load Balancing Schemes. Euro-Par 1999: 280-290 - 1998
- [j36]Ralf Diekmann, Derk Meyer, Burkhard Monien:
Parallel Decomposition of Unstructured FEM-Meshes. Concurr. Pract. Exp. 10(1): 53-72 (1998) - [j35]Sergei L. Bezrukov, Burkhard Monien, Walter Unger, Gerd Wechsung:
Embedding ladders and caterpillars into the hypercube. Discret. Appl. Math. 83(1-3): 21-29 (1998) - [j34]