Burkhard Monien

223 papers A* 13A 20B 40C 3Misc 1Journal 87Unranked 51

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Which is the Worst-Case Nash Equilibrium? SIAM J. Discret. Math. Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis, Imrich Vrto
2022	J	`jnl`	(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions. Theory Comput. Syst. Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien
2021	J	`jnl`	The complexity of (E+Var)-equilibria, ESR-equilibria, and SuperE-equilibria for 2-players games with few cost values. Theor. Comput. Sci. Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien
2020	J	`jnl`	(In)Existence of Equilibria for 2-Players, 2-Values Games with Concave Valuations. CoRR Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien
2020	J	`jnl`	Conditional Value-at-Risk: Structure and complexity of equilibria. Theor. Comput. Sci. Marios Mavronicolas, Burkhard Monien
2018	J	`jnl`	Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube. J. Graph Theory Burkhard Monien, Gerd Wechsung
2017	B	`conf`	Conditional Value-at-Risk: Structure and Complexity of Equilibria. SAGT Marios Mavronicolas, Burkhard Monien
2016	J	`jnl`	The complexity of equilibria for risk-modeling valuations. Theor. Comput. Sci. Marios Mavronicolas, Burkhard Monien
2015	J	`jnl`	Minimizing Expectation Plus Variance. Theory Comput. Syst. Marios Mavronicolas, Burkhard Monien
2015	J	`jnl`	The Complexity of Equilibria for Risk-Modeling Valuations. CoRR Marios Mavronicolas, Burkhard Monien
2015	J	`jnl`	The complexity of pure equilibria in mix-weighted congestion games on parallel links. Inf. Process. Lett. Marios Mavronicolas, Burkhard Monien
2015	—	`conf`	Weighted Boolean Formula Games. Algorithms, Probability, Networks, and Games Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner
2014	J	`jnl`	Preface to the self-portrayals of the GI Junior Fellows. it Inf. Technol. Peter Liggesmeyer, Burkhard Monien
2013	J	`jnl`	How many attackers can selfish defenders catch? Discret. Appl. Math. Marios Mavronicolas, Burkhard Monien, Vicky Papadopoulou Lesta
2013	J	`jnl`	On the Theor. Comput. Sci. Dominic Dumrauf, Burkhard Monien
2012	J	`jnl`	Computing Nash Equilibria for Two-Player Restricted Network Congestion Games is -Complete. Parallel Process. Lett. Dominic Dumrauf, Burkhard Monien
2012	J	`jnl`	Letter from the President. Bull. EATCS Burkhard Monien
2012	J	`jnl`	Letter from the President. Bull. EATCS Burkhard Monien
2012	B	`conf`	Minimizing Expectation Plus Variance. SAGT Marios Mavronicolas, Burkhard Monien
2012	J	`jnl`	Report form the EATCS General Assembly. Bull. EATCS Burkhard Monien
2012	—	`conf`	Selfish Distributed Optimization. Euro-Par Burkhard Monien, Christian Scheideler
2011	J	`jnl`	Exact Price of Anarchy for Polynomial Congestion Games. SIAM J. Comput. Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann
2011	J	`jnl`	Routing (un-) splittable flow in games with player-specific affine latency functions. ACM Trans. Algorithms Martin Gairing, Burkhard Monien, Karsten Tiemann
2010	J	`jnl`	Computing Nash Equilibria for Scheduling on Restricted Parallel Links. Theory Comput. Syst. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2010	—	`conf`	Local Search: Simple, Successful, But Sometimes Sluggish. ICALP (1) Burkhard Monien, Dominic Dumrauf, Tobias Tscheuschner
2010	C	`conf`	On the Power of Nodes of Degree Four in the Local Max-Cut Problem. CIAC Burkhard Monien, Tobias Tscheuschner
2010	J	`jnl`	Preface. Theory Comput. Syst. Burkhard Monien, Ulf-Peter Schroeder
2009	J	`jnl`	A new diffusion-based multilevel algorithm for computing graph partitions. J. Parallel Distributed Comput. Henning Meyerhenke, Burkhard Monien, Thomas Sauerwald
2009	J	`jnl`	Fair cost-sharing methods for scheduling jobs on parallel machines. J. Discrete Algorithms Yvonne Bleischwitz, Burkhard Monien
2009	—	`conf`	From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future. Algorithmics of Large and Complex Networks Sven Grothklags, Ulf Lorenz, Burkhard Monien
2009	J	`jnl`	Graph partitioning and disturbed diffusion. Parallel Comput. Henning Meyerhenke, Burkhard Monien, Stefan Schamberger
2009	—	`conf`	MultiProcessor Scheduling is PLS-Complete. HICSS Dominic Dumrauf, Burkhard Monien, Karsten Tiemann
2009	—	`conf`	Nash Equilibria for Voronoi Games on Transitive Graphs. WINE Rainer Feldmann, Marios Mavronicolas, Burkhard Monien
2008	A	`conf`	A new diffusion-based multilevel algorithm for computing graph partitions of very high quality. IPDPS Henning Meyerhenke, Burkhard Monien, Thomas Sauerwald
2008	J	`jnl`	A new model for selfish routing. Theor. Comput. Sci. Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
2008	B	`ed.`	Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings SAGT Burkhard Monien, Ulf-Peter Schroeder
2008	—	`ch.`	Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen?. Taschenbuch der Algorithmen Burkhard Monien, Ulf Lorenz, Daniel Warner
2008	—	`conf`	How Many Attackers Can Selfish Defenders Catch? HICSS Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou
2008	J	`jnl`	How Many Attackers Can Selfish Defenders Catch? CoRR Marios Mavronicolas, Burkhard Monien, Vicky Papadopoulou
2008	J	`jnl`	Nash equilibria in discrete routing games with convex latency functions. J. Comput. Syst. Sci. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
2008	—	`conf`	On the Road to -Completeness: 8 Agents in a Singleton Congestion Game. WINE Dominic Dumrauf, Burkhard Monien
2008	J	`jnl`	Selfish Routing with Incomplete Information. Theory Comput. Syst. Martin Gairing, Burkhard Monien, Karsten Tiemann
2008	B	`conf`	Voronoi Games on Cycle Graphs. MFCS Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou, Florian Schoppmann
2007	J	`jnl`	A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theor. Comput. Sci. Martin Gairing, Burkhard Monien, Andreas Woclaw
2007	—	`ch.`	Approximation Algorithms for Multilevel Graph Partitioning. Handbook of Approximation Algorithms and Metaheuristics Robert Preis, Burkhard Monien, Stefan Schamberger
2007	B	`conf`	Congestion Games with Player-Specific Constants. MFCS Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann
2007	A	`conf`	Routing and Scheduling with Incomplete Information. DISC Burkhard Monien, Karsten Tiemann
2007	B	`conf`	The Power of Two Prices: Beyond Cross-Monotonicity. MFCS Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, Karsten Tiemann
2007	—	`conf`	To Be or Not to Be (Served). WINE Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann
2007	—	`conf`	Weighted Boolean Formula Games. WINE Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner
2006	J	`jnl`	A 5/4-approximation algorithm for scheduling identical malleable tasks. Theor. Comput. Sci. Thomas Decker, Thomas Lücking, Burkhard Monien
2006	A	`conf`	Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid. IPDPS Henning Meyerhenke, Burkhard Monien, Stefan Schamberger
2006	J	`jnl`	Distributing Unit Size Workload Packages in Heterogeneous Networks. J. Graph Algorithms Appl. Robert Elsässer, Burkhard Monien, Stefan Schamberger
2006	A	`conf`	Exact Price of Anarchy for Polynomial Congestion Games. STACS Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann
2006	C	`conf`	Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines. CIAC Yvonne Bleischwitz, Burkhard Monien
2006	J	`jnl`	Introduction. J. Parallel Distributed Comput. Burkhard Monien, Guang Gao, Horst D. Simon, Paul G. Spirakis, Per Stenström
2006	—	`book`	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. Friedhelm Meyer auf der Heide, Burkhard Monien
2006	—	`conf`	Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions. ICALP (1) Martin Gairing, Burkhard Monien, Karsten Tiemann
2006	—	`conf`	Scheduling Unrelated Parallel Machines Computational Results. WEA Burkhard Monien, Andreas Woclaw
2006	B	`conf`	Selfish Routing in Networks. SOFSEM Burkhard Monien
2006	J	`jnl`	The Price of Anarchy for Restricted Parallel Links. Parallel Process. Lett. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2006	J	`jnl`	The price of anarchy for polynomial social cost. Theor. Comput. Sci. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2006	J	`jnl`	Upper bounds on the bisection width of 3- and 4-regular graphs. J. Discrete Algorithms Burkhard Monien, Robert Preis
2006	—	`conf`	Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic. WINE Vladimir V. Mazalov, Burkhard Monien, Florian Schoppmann, Karsten Tiemann
2005	A*	`conf`	A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines. ICALP Martin Gairing, Burkhard Monien, Andreas Woclaw
2005	—	`conf`	A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. WINE Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2005	J	`jnl`	Edge-disjoint spanning trees for the generalized butterfly networks and their applications. J. Parallel Distributed Comput. Abderezak Touzene, Khaled Day, Burkhard Monien
2005	A*	`conf`	Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. ICALP Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann
2005	B	`conf`	Selfish routing with incomplete information. SPAA Martin Gairing, Burkhard Monien, Karsten Tiemann
2005	J	`jnl`	Structure and complexity of extreme Nash equilibria. Theor. Comput. Sci. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis
2005	—	`conf`	The Price of Anarchy for Polynomial Social Cost. Computing and Markets Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2004	A	`conf`	A New Model for Selfish Routing. STACS Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
2004	A*	`conf`	Computing Nash equilibria for scheduling on restricted parallel links. STOC Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2004	J	`jnl`	Error analysis in minimax trees. Theor. Comput. Sci. Ulf Lorenz, Burkhard Monien
2004	C	`conf`	Graph Partitioning with the Party Library: Helpful-Sets in Practice. SBAC-PAD Burkhard Monien, Stefan Schamberger
2004	J	`jnl`	Improved bounds on cutwidths of shuffle-exchange and de Bruijn graphs. Parallel Process. Lett. Burkhard Monien, Imrich Vrto
2004	—	`conf`	Load Balancing in Dynamic Networks. ISPAN Robert Elsässer, Burkhard Monien, Stefan Schamberger
2004	A	`conf`	Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks. ESA Robert Elsässer, Burkhard Monien, Stefan Schamberger
2004	A*	`conf`	Nash Equilibria in Discrete Routing Games with Convex Latency Functions. ICALP Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
2004	J	`jnl`	New spectral lower bounds on the bisection width of graphs. Theor. Comput. Sci. Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich
2004	J	`jnl`	Optimal Diffusion Schemes And Load Balancing On Product Graphs. Parallel Process. Lett. Robert Elsässer, Burkhard Monien, Robert Preis, Andreas Frommer
2004	B	`conf`	The Price of Anarchy for Polynomial Social Cost. MFCS Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2003	B	`conf`	A 5/4-Approximation Algorithm for Scheduling Identical Malleable Tasks. WAOA Thomas Decker, Thomas Lücking, Burkhard Monien
2003	—	`conf`	Extreme Nash Equilibria. ICTCS Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis
2003	B	`conf`	Fault Tolerances Analysis of Distributed Reconfigurable Systems Using SAT-Based Techniques. FPL Rainer Feldmann, Christian Haubelt, Burkhard Monien, Jürgen Teich
2003	B	`conf`	Load balancing of unit size tokens and expansion properties of graphs. SPAA Robert Elsässer, Burkhard Monien
2003	A*	`conf`	Nashification and the Coordination Ratio for a Selfish Routing Game. ICALP Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
2003	J	`jnl`	On Spectral Bounds for the k-Partitioning of Graphs. Theory Comput. Syst. Robert Elsässer, Thomas Lücking, Burkhard Monien
2003	A	`conf`	SAT-Based Techniques in System Synthesis. DATE Christian Haubelt, Jürgen Teich, Rainer Feldmann, Burkhard Monien
2003	J	`jnl`	Selfish Routing in Non-Cooperative Networks: A Survey. Bull. EATCS Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
2003	B	`conf`	Selfish Routing in Non-cooperative Networks: A Survey. MFCS Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
2003	J	`jnl`	Sparse topologies with small spectrum size. Theor. Comput. Sci. Robert Elsässer, Rastislav Kralovic, Burkhard Monien
2003	—	`conf`	The Aircraft Sequencing Problem. Computer Science in Perspective Torsten Fahle, Rainer Feldmann, Silvia Götz, Sven Grothklags, Burkhard Monien
2003	B	`conf`	Which Is the Worst-Case Nash Equilibrium? MFCS Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto
2002	J	`jnl`	Diffusion Schemes for Load Balancing on Heterogeneous Networks. Theory Comput. Syst. Robert Elsässer, Burkhard Monien, Robert Preis
2002	—	`ed.`	Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002, Proceedings Euro-Par Burkhard Monien, Rainer Feldmann
2002	B	`conf`	On the Problem of Scheduling Flows on Distributed Networks. MFCS Thomas Lücking, Burkhard Monien, Manuel Rode
2002	A	`conf`	The Secret of Selective Game Tree Search, When Using Random-Error Evaluations. STACS Ulf Lorenz, Burkhard Monien
2002	A	`conf`	Toward Optimal Diffusion Matrices. IPDPS Robert Elsässer, Burkhard Monien, Günter Rote, Stefan Schamberger
2001	Misc	`ed.`	High Performance Computing - HiPC 2001, 8th International Conference, Hyderabad, India, December, 17-20, 2001, Proceedings HiPC Burkhard Monien, Viktor K. Prasanna, Sriram Vajapeyam
2001	B	`conf`	New spectral bounds on k-partitioning of graphs. SPAA Robert Elsässer, Thomas Lücking, Burkhard Monien
2001	A	`conf`	Scalable Sparse Topologies with Small Spectrum. STACS Robert Elsässer, Rastislav Kralovic, Burkhard Monien
2001	B	`conf`	Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. MFCS Burkhard Monien, Robert Preis
2000	—	`conf`	A Distributed Algorithm to Evaluate Quantified Boolean Formulae. AAAI/IAAI Rainer Feldmann, Burkhard Monien, Stefan Schamberger
2000	B	`conf`	Diffusive load balancing schemes on heterogeneous networks. SPAA Robert Elsässer, Burkhard Monien, Robert Preis
2000	B	`conf`	New Spectral Lower Bounds on the Bisection Width of Graphs. WG Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich
2000	J	`jnl`	Quality matching and local improvement for multilevel graph-partitioning. Parallel Comput. Burkhard Monien, Robert Preis, Ralf Diekmann
2000	—	`conf`	Towards Optimal Load Balancing Topologies. Euro-Par Thomas Decker, Burkhard Monien, Robert Preis
1999	J	`jnl`	Call for Participation: Advances in Computer Chess 9 Conference. ICCA J. H. Jaap van den Herik, Burkhard Monien
1999	J	`jnl`	Efficient schemes for nearest neighbor load balancing. Parallel Comput. Ralf Diekmann, Andreas Frommer, Burkhard Monien
1999	J	`jnl`	More Information on the 9 ICCA J. Burkhard Monien, Rainer Feldmann, H. Jaap van den Herik
1999	—	`conf`	Optimal and Alternating-Direction Load Balancing Schemes. Euro-Par Robert Elsässer, Andreas Frommer, Burkhard Monien, Robert Preis
1999	J	`jnl`	Programme of the ACC9 Conference. ICCA J. H. Jaap van den Herik, Burkhard Monien
1999	J	`jnl`	The Latest Information on the 9 ICCA J. Burkhard Monien, Rainer Feldmann, H. Jaap van den Herik
1998	—	`conf`	An Integrated Approach to Semantic Evaluation and Content-Based Retrieval of Multimedia Documents. ECDL 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
1998	J	`jnl`	Call for Papers Advances in Computer Chess 9 Conference. ICCA J. H. Jaap van den Herik, Burkhard Monien
1998	J	`jnl`	Compressing cube-connected cycles and butterfly networks. Networks Ralf Klasing, Reinhard Lüling, Burkhard Monien
1998	J	`jnl`	Embedding ladders and caterpillars into the hypercube. Discret. Appl. Math. Sergei L. Bezrukov, Burkhard Monien, Walter Unger, Gerd Wechsung
1998	A	`conf`	Nearest Neighbor Load Balancing on Graphs. ESA Ralf Diekmann, Andreas Frommer, Burkhard Monien
1998	J	`jnl`	Optimal Embedding of Complete Binary Trees into Lines and Grids. J. Parallel Distributed Comput. Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger
1998	J	`jnl`	Parallel Decomposition of Unstructured FEM-Meshes. Concurr. Pract. Exp. Ralf Diekmann, Derk Meyer, Burkhard Monien
1998	J	`jnl`	Specifying Resources and Services in Metacomputing Environments. Parallel Comput. Matthias Brune, Jörn Gehring, Axel Keller, Burkhard Monien, Friedhelm Ramme, Alexander Reinefeld
1998	J	`jnl`	The 9 ICCA J. Burkhard Monien, Rainer Feldmann
1997	A	`conf`	A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract). STACS Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Stefan Tschöke
1997	—	`conf`	A Local Graph Partitioning Heuristic Meeting Bisection Bounds. PP Burkhard Monien, Ralf Diekmann
1997	—	`conf`	Online Scheduling of Continuous Media Streams. Foundations of Computer Science: Potential - Theory - Cognition Burkhard Monien, Petra Berenbrink, Reinhard Lüling, Marco Riedel
1997	—	`conf`	Parallel Sparse Cholesky Factorization. IRREGULAR Burkhard Monien, Jürgen Schulze
1997	J	`jnl`	The Construction of Large Scale Reconfigurable Parallel Computing Systems (The Architecture of the SC320). Int. J. Found. Comput. Sci. Burkhard Monien, Ralf Diekmann, Reinhard Lüling
1996	A*	`ed.`	Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings ICALP Friedhelm Meyer auf der Heide, Burkhard Monien
1996	J	`jnl`	Combining Helpful Sets and Parallel Simulated Annealing for the Graph-partitioning Problem. Parallel Algorithms Appl. Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Carsten Spräner
1996	—	`conf`	Mapping tree-structured combinatorial optimization problems onto parallel computers. Solving Combinatorial Optimization Problems in Parallel Reinhard Lüling, Burkhard Monien, Alexander Reinefeld, Stefan Tschöke
1996	B	`conf`	On the Communication Throughput of Buffered Multistage Interconnection Networks. SPAA Ralf Rehrmann, Burkhard Monien, Reinhard Lüling, Ralf Diekmann
1995	A	`conf`	A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs. GD Burkhard Monien, Friedhelm Ramme, Helmut Salmen
1995	—	`conf`	A parallel local-search algorithm for the k-partitioning problem. HICSS (2) Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Carsten Spräner
1995	—	`conf`	An analytical comparison of nearest neighbor algorithms for load balancing in parallel computers. IPPS Cheng-Zhong Xu, Burkhard Monien, Reinhard Lüling, Francis C. M. Lau
1995	—	`ch.`	Efficient Use of Parallel & Distributed Systems: From Theory to Practice. Computer Science Today Burkhard Monien, Ralf Diekmann, Rainer Feldmann, Ralf Klasing, Reinhard Lüling, Knut Menzel, Thomas Römke, Ulf-Peter Schroeder
1995	J	`jnl`	Nearest-neighbor algorithms for load-balancing in parallel computers. Concurr. Pract. Exp. Cheng-Zhong Xu, Francis C. M. Lau, Burkhard Monien, Reinhard Lüling
1995	—	`conf`	Parallel Decomposition of Unstructured FEM-Meshes. IRREGULAR Ralf Diekmann, Derk Meyer, Burkhard Monien
1995	—	`conf`	Performance evaluation of load distribution strategies in parallel branch and bound computations. SPDP Cheng-Zhong Xu, Stefan Tschöke, Burkhard Monien
1995	—	`conf`	Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network. IPPS Stefan Tschöke, Reinhard Lüling, Burkhard Monien
1995	—	`conf`	Towards developing universal dynamic mapping algorithms. SPDP Thomas Decker, Ralf Diekmann, Reinhard Lüling, Burkhard Monien
1995	J	`jnl`	Verteilte Spielbaumsuche. Informationstechnik Tech. Inform. Rainer Feldmann, Burkhard Monien, Peter Mysliwietz
1994	J	`jnl`	Broadcasting in Butterfly and deBruijn Networks. Discret. Appl. Math. Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr
1994	B	`conf`	Communication Throughput of Interconnection Networks. MFCS Burkhard Monien, Ralf Diekmann, Reinhard Lüling
1994	J	`jnl`	Corrigendum: Fast Recognition of Deterministic CFL's with a Smaller Number of Processors. Theor. Comput. Sci. Burkhard Monien, Wojciech Rytter, Helmut Schäpers
1994	J	`jnl`	Note on Optimal Gossiping in Some Weak-Connected Graphs. Theor. Comput. Sci. Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien
1994	J	`jnl`	Optimal algorithms for dissemination of information in generalized communication modes. Discret. Appl. Math. Rainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz
1994	—	`conf`	Sorting large data sets on a massively parallel system. SPDP Ralf Diekmann, Jörn Gehring, Reinhard Lüling, Burkhard Monien, Markus Nubel, Rolf Wanka
1994	B	`conf`	Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation. SPAA Rainer Feldmann, Peter Mysliwietz, Burkhard Monien
1994	—	`conf`	Using helpful sets to improve graph bisections. Interconnection Networks and Mapping and Scheduling Parallel Computations Ralf Diekmann, Burkhard Monien, Robert Preis
1993	B	`conf`	A Dynamic Distributed Load Balancing Algorithm with Provable Good Performance. SPAA Reinhard Lüling, Burkhard Monien
1993	J	`jnl`	Fast recognition of deterministic cfl's with a smaller number of processors. Theor. Comput. Sci. Burkhard Monien, Wojciech Rytter, Leopold Schäpers
1993	J	`jnl`	Optimal Algorithms for Dissemination of Information in Some Interconnection Networks. Algorithmica Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien
1993	—	`ed.`	Parallel Architectures and Their Efficient Use, First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992, Proceedings Heinz Nixdorf Symposium Friedhelm Meyer auf der Heide, Burkhard Monien, Arnold L. Rosenberg
1993	A	`conf`	Parallel Architectures: Design and Efficient Use. STACS Burkhard Monien, Rainer Feldmann, Ralf Klasing, Reinhard Lüling
1992	—	`conf`	A Realizable Efficient Parallel Architecture. Heinz Nixdorf Symposium Burkhard Monien, Reinhard Lüling, Falk Langhammer
1992	A	`conf`	Broadcasting in Butterfly and DeBruijn Networks. STACS Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr
1992	—	`ed.`	Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative Data Structures and Efficient Algorithm Burkhard Monien, Thomas Ottmann
1992	—	`conf`	Distributed Game Tree Search on a Massively Parallel System. Data Structures and Efficient Algorithms Rainer Feldmann, Peter Mysliwietz, Burkhard Monien
1992	—	`conf`	Load Balancing for Distributed Branch and Bound Algorithms. IPPS Reinhard Lüling, Burkhard Monien
1992	—	`conf`	Mapping und Lastverteilung in parallelen Systemen. Transputer-Anwender-Treffen Burkhard Monien, Reinhard Lüling
1992	—	`conf`	Optimal Algorithms for Disemination of Information in Generalized Communication Modes. PARLE Rainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz
1992	—	`ch.`	The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). Informatik Juraj Hromkovic, Burkhard Monien
1991	A*	`ed.`	Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings ICALP Javier Leach Albert, Burkhard Monien, Mario Rodríguez-Artalejo
1991	J	`jnl`	Bandwidth Minimization: An Approximation Algorithm for Caterpillars. Math. Syst. Theory James Haralambides, Fillia Makedon, Burkhard Monien
1991	—	`conf`	Implementierung von Simulated Annealing auf Transputer-Systemen. Transputer-Anwender-Treffen Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Jens Simon
1991	—	`conf`	Load balancing in large networks: a comparative study. SPDP Reinhard Lüling, Burkhard Monien, Friedhelm Ramme
1991	J	`jnl`	On the Parallel Recognition of Unambiguous Context-Free Languages. Theor. Comput. Sci. Michal Chytil, Maxime Crochemore, Burkhard Monien, Wojciech Rytter
1991	B	`conf`	Optimal Embedding of Complete Binary Trees into Lines and Grids. WG Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger
1991	B	`conf`	Simulating Binary Trees on X-Trees (Extended Abstract). SPAA Burkhard Monien
1991	B	`conf`	The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). MFCS Juraj Hromkovic, Burkhard Monien
1990	—	`conf`	An Improved Algorithm to Detect Communication Deadlocks in Distributed Systems. WDAG Berthold Kröger, Reinhard Lüling, Burkhard Monien, Oliver Vornberger
1990	—	`conf`	Approximation algorithms for the bandwidth minimization problem for caterpillar graphs. SPDP James Haralambides, Fillia Makedon, Burkhard Monien
1990	A	`conf`	Caterpillars and Context-Free Languages. STACS Michal Chytil, Burkhard Monien
1990	—	`conf`	Compressing cube-connected cycles and butterfly networks. SPDP Ralf Klasing, Reinhard Lüling, Burkhard Monien
1990	B	`conf`	Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract). MFCS Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien
1990	J	`jnl`	Response to a Comment on 'Distributed Game-Tree Search'. ICCA J. Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Oliver Vornberger
1989	J	`jnl`	Distributed Game-Tree Search. ICCA J. Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Oliver Vornberger
1989	B	`conf`	On the Number of Rounds Necessary to Disseminate Information. SPAA Shimon Even, Burkhard Monien
1989	A	`ed.`	STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989, Proceedings STACS Burkhard Monien, Robert Cori
1989	—	`conf`	Two Strategies for Solving the Vertex Cover Problem on a Transputer Network. WDAG Reinhard Lüling, Burkhard Monien
1989	B	`conf`	WEighted Parallel Triangulation of Simple Polygons. WG Knut Menzel, Burkhard Monien
1988	B	`conf`	Bandwidth and Profile Minimization. WG Manfred Wiegers, Burkhard Monien
1988	B	`conf`	Comparing Interconnection Networks. MFCS Burkhard Monien, Ivan Hal Sudborough
1988	J	`jnl`	Min Cut is NP-Complete for Edge Weighted Treees. Theor. Comput. Sci. Burkhard Monien, Ivan Hal Sudborough
1988	—	`conf`	Simulating Binary Trees on Hypercubes. AWOC Burkhard Monien, Ivan Hal Sudborough
1987	—	`conf`	Parallel Processing of Combinatorial Search. Parallel Algorithms and Architectures Burkhard Monien, Oliver Vornberger
1987	A	`conf`	Superlinear Speedup for Parallel Backtracking. ICS Ewald Speckenmeyer, Burkhard Monien, Oliver Vornberger
1986	A*	`conf`	Min Cut is NP-Complete for Edge Weigthed Trees. ICALP Burkhard Monien, Ivan Hal Sudborough
1986	A	`ed.`	STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986, Proceedings STACS Burkhard Monien, Guy Vidal-Naquet
1985	J	`jnl`	Bandwidth Constrained NP-Complete Problems. Theor. Comput. Sci. Burkhard Monien, Ivan Hal Sudborough
1985	A	`conf`	On the Complexity of Deadlock Recovery. STACS Joseph Y.-T. Leung, Burkhard Monien
1985	J	`jnl`	Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. Acta Informatica Burkhard Monien, Ewald Speckenmeyer
1985	J	`jnl`	Solving satisfiability in less than 2 Discret. Appl. Math. Burkhard Monien, Ewald Speckenmeyer
1985	B	`conf`	The complexity of embedding graphs into binary trees. FCT Burkhard Monien
1984	J	`jnl`	Deterministic Two-Way One-Head Pushdown Automata are Very Powerful. Inf. Process. Lett. Burkhard Monien
1983	—	`conf`	Some Further Approximation Algorithms for the Vertex Cover Problem. CAAP Burkhard Monien, Ewald Speckenmeyer
1983	B	`conf`	The Complexity of Determining Paths of Length k. WG Burkhard Monien
1983	J	`jnl`	The complexity of determining a shortest cycle of even length. Computing Burkhard Monien
1982	J	`jnl`	On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space. Theor. Comput. Sci. Burkhard Monien, Ivan Hal Sudborough
1982	B	`conf`	The Complexity of Determing a Shortest Cycle of Even Length. WG Burkhard Monien
1981	A*	`conf`	Bandwidth Constrained NP-Complete Problems STOC Burkhard Monien, Ivan Hal Sudborough
1981	B	`conf`	Four Approximation Algorithms for the Feedback Vertex Set Problem. WG Burkhard Monien, Reinald Schulz
1981	B	`conf`	On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). MFCS Ronald V. Book, Matthias Jantzen, Burkhard Monien, Colm Ó'Dúnlaing, Celia Wrathall
1981	B	`conf`	On the LBA Problem. FCT Burkhard Monien
1981	B	`conf`	Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey). MFCS Burkhard Monien, Ivan Hal Sudborough
1980	B	`conf`	Bounding the Bandwidth of NP-Complete Problems. WG Burkhard Monien, Ivan Hal Sudborough
1980	B	`conf`	On a Subclass of Pseudopolynomial Problems. MFCS Burkhard Monien
1980	J	`jnl`	Two-Way Multihead Automata Over a One-Letter Alphabet. RAIRO Theor. Informatics Appl. Burkhard Monien
1979	A*	`conf`	On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space. ICALP Burkhard Monien, Ivan Hal Sudborough
1977	A*	`conf`	About the Derivation Languages of Grammars and Machines. ICALP Burkhard Monien
1977	J	`jnl`	Corrigenda: Transformational Methods and Their Application to Complexity Problems Acta Informatica Burkhard Monien
1977	J	`jnl`	The LBA-Problem and the Deterministic Tape Complexity of Two-Way One-Counter Languages over a One-Letter Alphabet. Acta Informatica Burkhard Monien
1977	—	`conf`	The LBA-problem and the transormability of the class epsilon Theoretical Computer Science Burkhard Monien
1976	J	`jnl`	A Recursive and a Grammatical Characterization of the Exponential-Time Languages. Theor. Comput. Sci. Burkhard Monien
1976	J	`jnl`	Transformational Methods and their Application to Complexity Problems. Acta Informatica Burkhard Monien
1975	—	`conf`	About the deterministic simulation of nondeterministic (log n)-tape bounded Turing machines. Automata Theory and Formal Languages Burkhard Monien
1975	J	`jnl`	Relationships between Pushdown Automata with Counters and Complexity Classes. Math. Syst. Theory Burkhard Monien
1974	J	`jnl`	Beschreibung von Zeitkomplexitätsklassen bei Turingmaschinen durch andere Automatenmodelle. J. Inf. Process. Cybern. Burkhard Monien
1974	A*	`conf`	Characterizations of Time-Bounded Computations by Limited Primitive Recursion. ICALP Burkhard Monien
1973	—	`conf`	On the simulation of time bounded machines. Automatentheorie und Formale Sprachen Burkhard Monien
1972	A*	`conf`	Relationship between Pushdown Automata and Tape-Bounded Turing Machines. ICALP Burkhard Monien
1970	J	`jnl`	Über die Konvergenzordnung von Differenzenverfahren, die parabolische Anfangsrandwertaufgaben approximieren. Computing Burkhard Monien