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
- 2024
[j84]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): 1701-1732 (2024)- 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]Burkhard Monien, Rainer Feldmann:
The 9th World Computer-Chess Championship. J. Int. Comput. Games Assoc. 21(4): 266 (1998) - [j33]H. Jaap van den Herik, Burkhard Monien:
Call for Papers Advances in Computer Chess 9 Conference. J. Int. Comput. Games Assoc. 21(4): 271-272 (1998) - [j32]Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger:
Optimal Embedding of Complete Binary Trees into Lines and Grids. J. Parallel Distributed Comput. 49(1): 40-56 (1998) - [j31]Ralf Klasing, Reinhard Lüling, Burkhard Monien:
Compressing cube-connected cycles and butterfly networks. Networks 32(1): 47-65 (1998) - [j30]Matthias Brune, Jörn Gehring, Axel Keller, Burkhard Monien, Friedhelm Ramme, Alexander Reinefeld:
Specifying Resources and Services in Metacomputing Environments. Parallel Comput. 24(12-13): 1751-1776 (1998) - [c65]Alois C. Knoll, Christian Altenschmidt, Joachim Biskup, Hans-Martin Blüthgen, Ingo Glöckner, Sven Hartrumpf, Hermann Helbig, Christiane Henning, Reinhard Lüling, Burkhard Monien, Thomas Noll, Norbert Sensen:
An Integrated Approach to Semantic Evaluation and Content-Based Retrieval of Multimedia Documents. ECDL 1998: 409-428 - [c64]Ralf Diekmann, Andreas Frommer, Burkhard Monien:
Nearest Neighbor Load Balancing on Graphs. ESA 1998: 429-440 - 1997
- [j29]Burkhard Monien, Ralf Diekmann, Reinhard Lüling:
The Construction of Large Scale Reconfigurable Parallel Computing Systems (The Architecture of the SC320). Int. J. Found. Comput. Sci. 8(3): 347-361 (1997) - [c63]Burkhard Monien, Petra Berenbrink, Reinhard Lüling, Marco Riedel:
Online Scheduling of Continuous Media Streams. Foundations of Computer Science: Potential - Theory - Cognition 1997: 313-320 - [c62]Burkhard Monien, Jürgen Schulze:
Parallel Sparse Cholesky Factorization. IRREGULAR 1997: 255-272 - [c61]Burkhard Monien, Ralf Diekmann:
A Local Graph Partitioning Heuristic Meeting Bisection Bounds. PP 1997 - [c60]Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Stefan Tschöke:
A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract). STACS 1997: 511-522 - 1996
- [j28]Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Carsten Spräner:
Combining Helpful Sets and Parallel Simulated Annealing for the Graph-partitioning Problem. Parallel Algorithms Appl. 8(1): 61-84 (1996) - [c59]Reinhard Lüling, Burkhard Monien, Alexander Reinefeld, Stefan Tschöke:
Mapping tree-structured combinatorial optimization problems onto parallel computers. Solving Combinatorial Optimization Problems in Parallel 1996: 115-144 - [c58]Ralf Rehrmann, Burkhard Monien, Reinhard Lüling, Ralf Diekmann:
On the Communication Throughput of Buffered Multistage Interconnection Networks. SPAA 1996: 152-161 - [e6]Friedhelm Meyer auf der Heide, Burkhard Monien:
Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings. Lecture Notes in Computer Science 1099, Springer 1996, ISBN 3-540-61440-0 [contents] - 1995
- [j27]Cheng-Zhong Xu, Francis C. M. Lau, Burkhard Monien, Reinhard Lüling:
Nearest-neighbor algorithms for load-balancing in parallel computers. Concurr. Pract. Exp. 7(7): 707-736 (1995) - [j26]Rainer Feldmann, Burkhard Monien, Peter Mysliwietz:
Verteilte Spielbaumsuche. Informationstechnik Tech. Inform. 37(2): 7-11 (1995) - [c57]Burkhard Monien, Friedhelm Ramme, Helmut Salmen:
A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs. GD 1995: 396-408 - [c56]Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Carsten Spräner:
A parallel local-search algorithm for the k-partitioning problem. HICSS (2) 1995: 41-50 - [c55]Stefan Tschöke, Reinhard Lüling, Burkhard Monien:
Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network. IPPS 1995: 182-189 - [c54]Cheng-Zhong Xu, Burkhard Monien, Reinhard Lüling, Francis C. M. Lau:
An analytical comparison of nearest neighbor algorithms for load balancing in parallel computers. IPPS 1995: 472-479 - [c53]Ralf Diekmann, Derk Meyer, Burkhard Monien:
Parallel Decomposition of Unstructured FEM-Meshes. IRREGULAR 1995: 199-215 - [c52]Cheng-Zhong Xu, Stefan Tschöke, Burkhard Monien:
Performance evaluation of load distribution strategies in parallel branch and bound computations. SPDP 1995: 402-405 - [c51]Thomas Decker, Ralf Diekmann, Reinhard Lüling, Burkhard Monien:
Towards developing universal dynamic mapping algorithms. SPDP 1995: 456-459 - [p2]Burkhard Monien, Ralf Diekmann, Rainer Feldmann, Ralf Klasing, Reinhard Lüling, Knut Menzel, Thomas Römke, Ulf-Peter Schroeder:
Efficient Use of Parallel & Distributed Systems: From Theory to Practice. Computer Science Today 1995: 62-77 - 1994
- [j25]Rainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz:
Optimal algorithms for dissemination of information in generalized communication modes. Discret. Appl. Math. 53(1-3): 55-78 (1994) - [j24]Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr:
Broadcasting in Butterfly and deBruijn Networks. Discret. Appl. Math. 53(1-3): 183-197 (1994) - [j23]Burkhard Monien, Wojciech Rytter, Helmut Schäpers:
Corrigendum: Fast Recognition of Deterministic CFL's with a Smaller Number of Processors. Theor. Comput. Sci. 123(2): 427-428 (1994) - [j22]Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien:
Note on Optimal Gossiping in Some Weak-Connected Graphs. Theor. Comput. Sci. 127(2): 395-402 (1994) - [c50]Ralf Diekmann, Burkhard Monien, Robert Preis:
Using helpful sets to improve graph bisections. Interconnection Networks and Mapping and Scheduling Parallel Computations 1994: 57-73 - [c49]Burkhard Monien, Ralf Diekmann, Reinhard Lüling:
Communication Throughput of Interconnection Networks. MFCS 1994: 72-86 - [c48]Rainer Feldmann, Peter Mysliwietz, Burkhard Monien:
Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation. SPAA 1994: 94-103 - [c47]Ralf Diekmann, Jörn Gehring, Reinhard Lüling, Burkhard Monien, Markus Nubel, Rolf Wanka:
Sorting large data sets on a massively parallel system. SPDP 1994: 2-9 - 1993
- [j21]Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien:
Optimal Algorithms for Dissemination of Information in Some Interconnection Networks. Algorithmica 10(1): 24-40 (1993) - [j20]Burkhard Monien, Wojciech Rytter, Leopold Schäpers:
Fast recognition of deterministic cfl's with a smaller number of processors. Theor. Comput. Sci. 116(2): 421-429 (1993) - [c46]Reinhard Lüling, Burkhard Monien:
A Dynamic Distributed Load Balancing Algorithm with Provable Good Performance. SPAA 1993: 164-172 - [c45]Burkhard Monien, Rainer Feldmann, Ralf Klasing, Reinhard Lüling:
Parallel Architectures: Design and Efficient Use. STACS 1993: 247-269 - [e5]Friedhelm Meyer auf der Heide, Burkhard Monien, Arnold L. Rosenberg:
Parallel Architectures and Their Efficient Use, First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992, Proceedings. Lecture Notes in Computer Science 678, Springer 1993, ISBN 3-540-56731-3 [contents] - 1992
- [c44]Rainer Feldmann, Peter Mysliwietz, Burkhard Monien:
Distributed Game Tree Search on a Massively Parallel System. Data Structures and Efficient Algorithms 1992: 270-288 - [c43]Reinhard Lüling, Burkhard Monien:
Load Balancing for Distributed Branch and Bound Algorithms. IPPS 1992: 543-548 - [c42]Burkhard Monien, Reinhard Lüling, Falk Langhammer:
A Realizable Efficient Parallel Architecture. Heinz Nixdorf Symposium 1992: 93-109 - [c41]Rainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz:
Optimal Algorithms for Disemination of Information in Generalized Communication Modes. PARLE 1992: 115-130 - [c40]Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr:
Broadcasting in Butterfly and DeBruijn Networks. STACS 1992: 351-362 - [c39]Burkhard Monien, Reinhard Lüling:
Mapping und Lastverteilung in parallelen Systemen. Transputer-Anwender-Treffen 1992: 1-10 - [p1]Juraj Hromkovic, Burkhard Monien:
The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). Informatik 1992: 215-233 - [e4]Burkhard Monien, Thomas Ottmann:
Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative. Lecture Notes in Computer Science 594, Springer 1992, ISBN 3-540-55488-2 [contents] - 1991
- [j19]James Haralambides, Fillia Makedon, Burkhard Monien:
Bandwidth Minimization: An Approximation Algorithm for Caterpillars. Math. Syst. Theory 24(3): 169-177 (1991) - [j18]Michal Chytil, Maxime Crochemore, Burkhard Monien, Wojciech Rytter:
On the Parallel Recognition of Unambiguous Context-Free Languages. Theor. Comput. Sci. 81(2): 311-316 (1991) - [c38]Juraj Hromkovic, Burkhard Monien:
The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). MFCS 1991: 211-220 - [c37]Burkhard Monien:
Simulating Binary Trees on X-Trees (Extended Abstract). SPAA 1991: 147-158 - [c36]Reinhard Lüling, Burkhard Monien, Friedhelm Ramme:
Load balancing in large networks: a comparative study. SPDP 1991: 686-689 - [c35]Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Jens Simon:
Implementierung von Simulated Annealing auf Transputer-Systemen. Transputer-Anwender-Treffen 1991: 361-368 - [c34]Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger:
Optimal Embedding of Complete Binary Trees into Lines and Grids. WG 1991: 25-35 - [e3]Javier Leach Albert, Burkhard Monien, Mario Rodríguez-Artalejo:
Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings. Lecture Notes in Computer Science 510, Springer 1991, ISBN 3-540-54233-7 [contents] - 1990
- [j17]Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Oliver Vornberger:
Response to a Comment on 'Distributed Game-Tree Search'. J. Int. Comput. Games Assoc. 13(1): 20-21 (1990) - [c33]Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien:
Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract). MFCS 1990: 337-346 - [c32]James Haralambides, Fillia Makedon, Burkhard Monien:
Approximation algorithms for the bandwidth minimization problem for caterpillar graphs. SPDP 1990: 301-307 - [c31]Ralf Klasing, Reinhard Lüling, Burkhard Monien:
Compressing cube-connected cycles and butterfly networks. SPDP 1990: 858-865 - [c30]Michal Chytil, Burkhard Monien:
Caterpillars and Context-Free Languages. STACS 1990: 70-81 - [c29]Berthold Kröger, Reinhard Lüling, Burkhard Monien, Oliver Vornberger:
An Improved Algorithm to Detect Communication Deadlocks in Distributed Systems. WDAG 1990: 90-101
1980 – 1989
- 1989
- [j16]Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Oliver Vornberger:
Distributed Game-Tree Search. J. Int. Comput. Games Assoc. 12(2): 65-73 (1989) - [c28]Shimon Even, Burkhard Monien:
On the Number of Rounds Necessary to Disseminate Information. SPAA 1989: 318-327 - [c27]Reinhard Lüling, Burkhard Monien:
Two Strategies for Solving the Vertex Cover Problem on a Transputer Network. WDAG 1989: 160-170 - [c26]Knut Menzel, Burkhard Monien:
WEighted Parallel Triangulation of Simple Polygons. WG 1989: 302-315 - [e2]Burkhard Monien, Robert Cori:
STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989, Proceedings. Lecture Notes in Computer Science 349, Springer 1989, ISBN 3-540-50840-6 [contents] - 1988
- [j15]Burkhard Monien, Ivan Hal Sudborough:
Min Cut is NP-Complete for Edge Weighted Treees. Theor. Comput. Sci. 58: 209-229 (1988) - [c25]Burkhard Monien, Ivan Hal Sudborough:
Simulating Binary Trees on Hypercubes. AWOC 1988: 170-180 - [c24]Burkhard Monien, Ivan Hal Sudborough:
Comparing Interconnection Networks. MFCS 1988: 138-153 - [c23]Manfred Wiegers, Burkhard Monien:
Bandwidth and Profile Minimization. WG 1988: 378-393 - 1987
- [c22]Ewald Speckenmeyer, Burkhard Monien, Oliver Vornberger:
Superlinear Speedup for Parallel Backtracking. ICS 1987: 985-993 - [c21]Burkhard Monien, Oliver Vornberger:
Parallel Processing of Combinatorial Search. Parallel Algorithms and Architectures 1987: 60-69 - 1986
- [c20]Burkhard Monien, Ivan Hal Sudborough:
Min Cut is NP-Complete for Edge Weigthed Trees. ICALP 1986: 265-274 - [e1]Burkhard Monien, Guy Vidal-Naquet:
STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986, Proceedings. Lecture Notes in Computer Science 210, Springer 1986, ISBN 3-540-16078-7 [contents] - 1985
- [j14]Burkhard Monien, Ewald Speckenmeyer:
Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. Acta Informatica 22(1): 115-123 (1985) - [j13]Burkhard Monien, Ewald Speckenmeyer:
Solving satisfiability in less than 2n steps. Discret. Appl. Math. 10(3): 287-295 (1985) - [j12]Burkhard Monien, Ivan Hal Sudborough:
Bandwidth Constrained NP-Complete Problems. Theor. Comput. Sci. 41: 141-167 (1985) - [c19]Burkhard Monien:
The complexity of embedding graphs into binary trees. FCT 1985: 300-309 - [c18]Joseph Y.-T. Leung, Burkhard Monien:
On the Complexity of Deadlock Recovery. STACS 1985: 208-218 - 1984
- [j11]Burkhard Monien:
Deterministic Two-Way One-Head Pushdown Automata are Very Powerful. Inf. Process. Lett. 18(5): 239-242 (1984) - 1983
- [j10]Burkhard Monien:
The complexity of determining a shortest cycle of even length. Computing 31(4): 355-369 (1983) - [c17]Burkhard Monien, Ewald Speckenmeyer:
Some Further Approximation Algorithms for the Vertex Cover Problem. CAAP 1983: 341-349 - [c16]Burkhard Monien:
The Complexity of Determining Paths of Length k. WG 1983: 241-251 - 1982
- [j9]Burkhard Monien, Ivan Hal Sudborough:
On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space. Theor. Comput. Sci. 21: 237-253 (1982) - [c15]Burkhard Monien:
The Complexity of Determing a Shortest Cycle of Even Length. WG 1982: 195-208 - 1981
- [c14]Burkhard Monien:
On the LBA Problem. FCT 1981: 265-280 - [c13]Burkhard Monien, Ivan Hal Sudborough:
Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey). MFCS 1981: 78-93 - [c12]Ronald V. Book, Matthias Jantzen, Burkhard Monien, Colm Ó'Dúnlaing, Celia Wrathall:
On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). MFCS 1981: 216-223 - [c11]Burkhard Monien, Ivan Hal Sudborough:
Bandwidth Constrained NP-Complete Problems. STOC 1981: 207-217 - [c10]Burkhard Monien, Reinald Schulz:
Four Approximation Algorithms for the Feedback Vertex Set Problem. WG 1981: 315-326 - 1980
- [j8]Burkhard Monien:
Two-Way Multihead Automata Over a One-Letter Alphabet. RAIRO Theor. Informatics Appl. 14(1): 67-82 (1980) - [c9]Burkhard Monien:
On a Subclass of Pseudopolynomial Problems. MFCS 1980: 414-425 - [c8]Burkhard Monien, Ivan Hal Sudborough:
Bounding the Bandwidth of NP-Complete Problems. WG 1980: 279-292
1970 – 1979
- 1979
- [c7]Burkhard Monien, Ivan Hal Sudborough:
On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space. ICALP 1979: 431-445 - 1977
- [j7]Burkhard Monien:
The LBA-Problem and the Deterministic Tape Complexity of Two-Way One-Counter Languages over a One-Letter Alphabet. Acta Informatica 8: 371-382 (1977) - [j6]Burkhard Monien:
Corrigenda: Transformational Methods and Their Application to Complexity Problems. Acta Informatica 8: 383-384 (1977) - [c6]Burkhard Monien:
About the Derivation Languages of Grammars and Machines. ICALP 1977: 337-351 - [c5]Burkhard Monien:
The LBA-problem and the transormability of the class epsilon2. Theoretical Computer Science 1977: 339-350 - 1976
- [j5]Burkhard Monien:
Transformational Methods and their Application to Complexity Problems. Acta Informatica 6: 95-108 (1976) - [j4]Burkhard Monien:
A Recursive and a Grammatical Characterization of the Exponential-Time Languages. Theor. Comput. Sci. 3(1): 61-74 (1976) - 1975
- [j3]Burkhard Monien:
Relationships between Pushdown Automata with Counters and Complexity Classes. Math. Syst. Theory 9(3): 248-264 (1975) - [c4]Burkhard Monien:
About the deterministic simulation of nondeterministic (log n)-tape bounded Turing machines. Automata Theory and Formal Languages 1975: 118-126 - 1974
- [j2]Burkhard Monien:
Beschreibung von Zeitkomplexitätsklassen bei Turingmaschinen durch andere Automatenmodelle. J. Inf. Process. Cybern. 10(1): 37-51 (1974) - [c3]Burkhard Monien:
Characterizations of Time-Bounded Computations by Limited Primitive Recursion. ICALP 1974: 280-293 - 1973
- [c2]Burkhard Monien:
On the simulation of time bounded machines. Automatentheorie und Formale Sprachen 1973: 239-248 - 1972
- [c1]Burkhard Monien:
Relationship between Pushdown Automata and Tape-Bounded Turing Machines. ICALP 1972: 575-583 - 1970
- [j1]Burkhard Monien:
Über die Konvergenzordnung von Differenzenverfahren, die parabolische Anfangsrandwertaufgaben approximieren. Computing 5(3): 221-245 (1970)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
