Über die Konvergenzordnung von Differenzenverfahren, die parabolische Anfangsrandwertaufgaben approximieren. - Burkhard Monien (Computing, 1970)

Relationship between Pushdown Automata and Tape-Bounded Turing Machines. - Burkhard Monien (ICALP, 1972)

On the simulation of time bounded machines. - Burkhard Monien (Automatentheorie und Formale Sprachen, 1973)

Characterizations of Time-Bounded Computations by Limited Primitive Recursion. - Burkhard Monien (ICALP, 1974)

Beschreibung von Zeitkomplexitätsklassen bei Turingmaschinen durch andere Automatenmodelle. - Burkhard Monien (J. Inf. Process. Cybern., 1974)

About the deterministic simulation of nondeterministic (log n)-tape bounded Turing machines. - Burkhard Monien (Automata Theory and Formal Languages, 1975)

Relationships between Pushdown Automata with Counters and Complexity Classes. - Burkhard Monien (Math. Syst. Theory, 1975)

Transformational Methods and their Application to Complexity Problems. - Burkhard Monien (Acta Informatica, 1976)

A Recursive and a Grammatical Characterization of the Exponential-Time Languages. - Burkhard Monien (Theor. Comput. Sci., 1976)

About the Derivation Languages of Grammars and Machines. - Burkhard Monien (ICALP, 1977)

The LBA-problem and the transormability of the class epsilon2. - Burkhard Monien (Theoretical Computer Science, 1977)

The LBA-Problem and the Deterministic Tape Complexity of Two-Way One-Counter Languages over a One-Letter Alphabet. - Burkhard Monien (Acta Informatica, 1977)

Corrigenda: Transformational Methods and Their Application to Complexity Problems - Burkhard Monien (Acta Informatica, 1977)

On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space. - Burkhard Monien; Ivan Hal Sudborough (ICALP, 1979)

On a Subclass of Pseudopolynomial Problems. - Burkhard Monien (MFCS, 1980)

Bounding the Bandwidth of NP-Complete Problems. - Burkhard Monien; Ivan Hal Sudborough (WG, 1980)

Two-Way Multihead Automata Over a One-Letter Alphabet. - Burkhard Monien (RAIRO Theor. Informatics Appl., 1980)

On the LBA Problem. - Burkhard Monien (FCT, 1981)

On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). - Ronald V. Book; Matthias Jantzen; Burkhard Monien; Colm Ó'Dúnlaing; Celia Wrathall (MFCS, 1981)

Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey). - Burkhard Monien; Ivan Hal Sudborough (MFCS, 1981)

Four Approximation Algorithms for the Feedback Vertex Set Problem. - Burkhard Monien; Reinald Schulz (WG, 1981)

The Complexity of Determing a Shortest Cycle of Even Length. - Burkhard Monien (WG, 1982)

On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space. - Burkhard Monien; Ivan Hal Sudborough (Theor. Comput. Sci., 1982)

Some Further Approximation Algorithms for the Vertex Cover Problem. - Burkhard Monien; Ewald Speckenmeyer (CAAP, 1983)

The Complexity of Determining Paths of Length k. - Burkhard Monien (WG, 1983)

The complexity of determining a shortest cycle of even length. - Burkhard Monien (Computing, 1983)

Deterministic Two-Way One-Head Pushdown Automata are Very Powerful. - Burkhard Monien (Inf. Process. Lett., 1984)

The complexity of embedding graphs into binary trees. - Burkhard Monien (FCT, 1985)

On the Complexity of Deadlock Recovery. - Joseph Y.-T. Leung; Burkhard Monien (STACS, 1985)

Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. - Burkhard Monien; Ewald Speckenmeyer (Acta Informatica, 1985)

Solving satisfiability in less than 2n steps. - Burkhard Monien; Ewald Speckenmeyer (Discret. Appl. Math., 1985)

Bandwidth Constrained NP-Complete Problems. - Burkhard Monien; Ivan Hal Sudborough (Theor. Comput. Sci., 1985)

Min Cut is NP-Complete for Edge Weigthed Trees. - Burkhard Monien; Ivan Hal Sudborough (ICALP, 1986)

Superlinear Speedup for Parallel Backtracking. - Ewald Speckenmeyer; Burkhard Monien; Oliver Vornberger (ICS, 1987)

Parallel Processing of Combinatorial Search. - Burkhard Monien; Oliver Vornberger (Parallel Algorithms and Architectures, 1987)

Simulating Binary Trees on Hypercubes. - Burkhard Monien; Ivan Hal Sudborough (AWOC, 1988)

Comparing Interconnection Networks. - Burkhard Monien; Ivan Hal Sudborough (MFCS, 1988)

Bandwidth and Profile Minimization. - Manfred Wiegers; Burkhard Monien (WG, 1988)

Min Cut is NP-Complete for Edge Weighted Treees. - Burkhard Monien; Ivan Hal Sudborough (Theor. Comput. Sci., 1988)

On the Number of Rounds Necessary to Disseminate Information. - Shimon Even; Burkhard Monien (SPAA, 1989)

Two Strategies for Solving the Vertex Cover Problem on a Transputer Network. - Reinhard Lüling; Burkhard Monien (WDAG, 1989)

WEighted Parallel Triangulation of Simple Polygons. - Knut Menzel; Burkhard Monien (WG, 1989)

Distributed Game-Tree Search. - Rainer Feldmann; Burkhard Monien; Peter Mysliwietz; Oliver Vornberger (J. Int. Comput. Games Assoc., 1989)

Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract). - Juraj Hromkovic; Claus-Dieter Jeschke; Burkhard Monien (MFCS, 1990)

Approximation algorithms for the bandwidth minimization problem for caterpillar graphs. - James Haralambides; Fillia Makedon; Burkhard Monien (SPDP, 1990)

Caterpillars and Context-Free Languages. - Michal Chytil; Burkhard Monien (STACS, 1990)

An Improved Algorithm to Detect Communication Deadlocks in Distributed Systems. - Berthold Kröger; Reinhard Lüling; Burkhard Monien; Oliver Vornberger (WDAG, 1990)

Response to a Comment on 'Distributed Game-Tree Search'. - Rainer Feldmann; Burkhard Monien; Peter Mysliwietz; Oliver Vornberger (J. Int. Comput. Games Assoc., 1990)

The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). - Juraj Hromkovic; Burkhard Monien (MFCS, 1991)

Simulating Binary Trees on X-Trees (Extended Abstract). - Burkhard Monien (SPAA, 1991)

Load balancing in large networks: a comparative study. - Reinhard Lüling; Burkhard Monien; Friedhelm Ramme (SPDP, 1991)

Implementierung von Simulated Annealing auf Transputer-Systemen. - Ralf Diekmann; Reinhard Lüling; Burkhard Monien; Jens Simon (Transputer-Anwender-Treffen, 1991)

Bandwidth Minimization: An Approximation Algorithm for Caterpillars. - James Haralambides; Fillia Makedon; Burkhard Monien (Math. Syst. Theory, 1991)

On the Parallel Recognition of Unambiguous Context-Free Languages. - Michal Chytil; Maxime Crochemore; Burkhard Monien; Wojciech Rytter (Theor. Comput. Sci., 1991)

The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). - Juraj Hromkovic; Burkhard Monien (Informatik, 1992)

Distributed Game Tree Search on a Massively Parallel System. - Rainer Feldmann; Peter Mysliwietz; Burkhard Monien (Data Structures and Efficient Algorithms, 1992)

Load Balancing for Distributed Branch and Bound Algorithms. - Reinhard Lüling; Burkhard Monien (IPPS, 1992)

A Realizable Efficient Parallel Architecture. - Burkhard Monien; Reinhard Lüling; Falk Langhammer (Heinz Nixdorf Symposium, 1992)

Optimal Algorithms for Disemination of Information in Generalized Communication Modes. - Rainer Feldmann; Juraj Hromkovic; Seshu Madhavapeddy; Burkhard Monien; Peter Mysliwietz (PARLE, 1992)

Mapping und Lastverteilung in parallelen Systemen. - Burkhard Monien; Reinhard Lüling (Transputer-Anwender-Treffen, 1992)

A Dynamic Distributed Load Balancing Algorithm with Provable Good Performance. - Reinhard Lüling; Burkhard Monien (SPAA, 1993)

Parallel Architectures: Design and Efficient Use. - Burkhard Monien; Rainer Feldmann; Ralf Klasing; Reinhard Lüling (STACS, 1993)

Optimal Algorithms for Dissemination of Information in Some Interconnection Networks. - Juraj Hromkovic; Claus-Dieter Jeschke; Burkhard Monien (Algorithmica, 1993)

Fast recognition of deterministic cfl's with a smaller number of processors. - Burkhard Monien; Wojciech Rytter; Leopold Schäpers (Theor. Comput. Sci., 1993)

Using helpful sets to improve graph bisections. - Ralf Diekmann; Burkhard Monien; Robert Preis (Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994)

Communication Throughput of Interconnection Networks. - Burkhard Monien; Ralf Diekmann; Reinhard Lüling (MFCS, 1994)

Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation. - Rainer Feldmann; Peter Mysliwietz; Burkhard Monien (SPAA, 1994)

Sorting large data sets on a massively parallel system. - Ralf Diekmann; Jörn Gehring; Reinhard Lüling; Burkhard Monien; Markus Nubel; Rolf Wanka (SPDP, 1994)

Optimal algorithms for dissemination of information in generalized communication modes. - Rainer Feldmann; Juraj Hromkovic; Seshu Madhavapeddy; Burkhard Monien; Peter Mysliwietz (Discret. Appl. Math., 1994)

Broadcasting in Butterfly and deBruijn Networks. - Ralf Klasing; Burkhard Monien; Regine Peine; Elena Stöhr (Discret. Appl. Math., 1994)

Note on Optimal Gossiping in Some Weak-Connected Graphs. - Juraj Hromkovic; Claus-Dieter Jeschke; Burkhard Monien (Theor. Comput. Sci., 1994)

Corrigendum: Fast Recognition of Deterministic CFL's with a Smaller Number of Processors. - Burkhard Monien; Wojciech Rytter; Helmut Schäpers (Theor. Comput. Sci., 1994)

Efficient Use of Parallel & Distributed Systems: From Theory to Practice. - Burkhard Monien; Ralf Diekmann; Rainer Feldmann; Ralf Klasing; Reinhard Lüling; Knut Menzel; Thomas Römke; Ulf-Peter Schroeder (Computer Science Today, 1995)

A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs. - Burkhard Monien; Friedhelm Ramme; Helmut Salmen (GD, 1995)

A parallel local-search algorithm for the k-partitioning problem. - Ralf Diekmann; Reinhard Lüling; Burkhard Monien; Carsten Spräner (HICSS (2), 1995)

Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network. - Stefan Tschöke; Reinhard Lüling; Burkhard Monien (IPPS, 1995)

An analytical comparison of nearest neighbor algorithms for load balancing in parallel computers. - Cheng-Zhong Xu 001; Burkhard Monien; Reinhard Lüling; Francis C. M. Lau 001 (IPPS, 1995)

Towards developing universal dynamic mapping algorithms. - Thomas Decker 001; Ralf Diekmann; Reinhard Lüling; Burkhard Monien (SPDP, 1995)

Performance evaluation of load distribution strategies in parallel branch and bound computations. - Cheng-Zhong Xu 001; Stefan Tschöke; Burkhard Monien (SPDP, 1995)

Nearest-neighbor algorithms for load-balancing in parallel computers. - Cheng-Zhong Xu 001; Francis C. M. Lau 001; Burkhard Monien; Reinhard Lüling (Concurr. Pract. Exp., 1995)

Verteilte Spielbaumsuche. - Rainer Feldmann; Burkhard Monien; Peter Mysliwietz (Informationstechnik Tech. Inform., 1995)

Mapping tree-structured combinatorial optimization problems onto parallel computers. - Reinhard Lüling; Burkhard Monien; Alexander Reinefeld; Stefan Tschöke (Solving Combinatorial Optimization Problems in Parallel, 1996)

On the Communication Throughput of Buffered Multistage Interconnection Networks. - Ralf Rehrmann; Burkhard Monien; Reinhard Lüling; Ralf Diekmann (SPAA, 1996)

Combining Helpful Sets and Parallel Simulated Annealing for the Graph-partitioning Problem. - Ralf Diekmann; Reinhard Lüling; Burkhard Monien; Carsten Spräner (Parallel Algorithms Appl., 1996)

Online Scheduling of Continuous Media Streams. - Burkhard Monien; Petra Berenbrink; Reinhard Lüling; Marco Riedel (Foundations of Computer Science: Potential - Theory - Cognition, 1997)

Parallel Sparse Cholesky Factorization. - Burkhard Monien; Jürgen Schulze 001 (IRREGULAR, 1997)

A Local Graph Partitioning Heuristic Meeting Bisection Bounds. - Burkhard Monien; Ralf Diekmann (PP, 1997)

A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract). - Rainer Feldmann; Burkhard Monien; Peter Mysliwietz; Stefan Tschöke (STACS, 1997)

The Construction of Large Scale Reconfigurable Parallel Computing Systems (The Architecture of the SC320). - Burkhard Monien; Ralf Diekmann; Reinhard Lüling (Int. J. Found. Comput. Sci., 1997)

An Integrated Approach to Semantic Evaluation and Content-Based Retrieval of Multimedia Documents. - 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 001; Norbert Sensen (ECDL, 1998)

Nearest Neighbor Load Balancing on Graphs. - Ralf Diekmann; Andreas Frommer; Burkhard Monien (ESA, 1998)

Parallel Decomposition of Unstructured FEM-Meshes. - Ralf Diekmann; Derk Meyer; Burkhard Monien (Concurr. Pract. Exp., 1998)

Embedding ladders and caterpillars into the hypercube. - Sergei L. Bezrukov; Burkhard Monien; Walter Unger; Gerd Wechsung (Discret. Appl. Math., 1998)

Call for Papers Advances in Computer Chess 9 Conference. - H. Jaap van den Herik; Burkhard Monien (J. Int. Comput. Games Assoc., 1998)

The 9th World Computer-Chess Championship. - Burkhard Monien; Rainer Feldmann (J. Int. Comput. Games Assoc., 1998)

Optimal Embedding of Complete Binary Trees into Lines and Grids. - Ralf Heckmann; Ralf Klasing; Burkhard Monien; Walter Unger (J. Parallel Distributed Comput., 1998)

Compressing cube-connected cycles and butterfly networks. - Ralf Klasing; Reinhard Lüling; Burkhard Monien (Networks, 1998)

Specifying Resources and Services in Metacomputing Environments. - Matthias Brune; Jörn Gehring; Axel Keller; Burkhard Monien; Friedhelm Ramme; Alexander Reinefeld (Parallel Comput., 1998)

Optimal and Alternating-Direction Load Balancing Schemes. - Robert Elsässer; Andreas Frommer; Burkhard Monien; Robert Preis (Euro-Par, 1999)

Call for Participation: Advances in Computer Chess 9 Conference. - H. Jaap van den Herik; Burkhard Monien (J. Int. Comput. Games Assoc., 1999)

Programme of the ACC9 Conference. - H. Jaap van den Herik; Burkhard Monien (J. Int. Comput. Games Assoc., 1999)

More Information on the 9th World Computer-Chess Championship. - Burkhard Monien; Rainer Feldmann; H. Jaap van den Herik (J. Int. Comput. Games Assoc., 1999)

The Latest Information on the 9th World Computer-Chess Championship. - Burkhard Monien; Rainer Feldmann; H. Jaap van den Herik (J. Int. Comput. Games Assoc., 1999)

Efficient schemes for nearest neighbor load balancing. - Ralf Diekmann; Andreas Frommer; Burkhard Monien (Parallel Comput., 1999)

A Distributed Algorithm to Evaluate Quantified Boolean Formulae. - Rainer Feldmann; Burkhard Monien; Stefan Schamberger (AAAI/IAAI, 2000)

Towards Optimal Load Balancing Topologies. - Thomas Decker 001; Burkhard Monien; Robert Preis (Euro-Par, 2000)

Diffusive load balancing schemes on heterogeneous networks. - Robert Elsässer; Burkhard Monien; Robert Preis (SPAA, 2000)

Quality matching and local improvement for multilevel graph-partitioning. - Burkhard Monien; Robert Preis; Ralf Diekmann (Parallel Comput., 2000)

New spectral bounds on k-partitioning of graphs. - Robert Elsässer; Thomas Lücking 001; Burkhard Monien (SPAA, 2001)

Scalable Sparse Topologies with Small Spectrum. - Robert Elsässer; Rastislav Kralovic; Burkhard Monien (STACS, 2001)

Toward Optimal Diffusion Matrices. - Robert Elsässer; Burkhard Monien; Günter Rote; Stefan Schamberger (IPDPS, 2002)

On the Problem of Scheduling Flows on Distributed Networks. - Thomas Lücking 001; Burkhard Monien; Manuel Rode (MFCS, 2002)

The Secret of Selective Game Tree Search, When Using Random-Error Evaluations. - Ulf Lorenz; Burkhard Monien (STACS, 2002)

Diffusion Schemes for Load Balancing on Heterogeneous Networks. - Robert Elsässer; Burkhard Monien; Robert Preis (Theory Comput. Syst., 2002)

The Aircraft Sequencing Problem. - Torsten Fahle; Rainer Feldmann; Silvia Götz; Sven Grothklags; Burkhard Monien (Computer Science in Perspective, 2003)

SAT-Based Techniques in System Synthesis. - Christian Haubelt; Jürgen Teich; Rainer Feldmann; Burkhard Monien (DATE, 2003)

Fault Tolerances Analysis of Distributed Reconfigurable Systems Using SAT-Based Techniques. - Rainer Feldmann; Christian Haubelt; Burkhard Monien; Jürgen Teich (FPL, 2003)

Nashification and the Coordination Ratio for a Selfish Routing Game. - Rainer Feldmann; Martin Gairing; Thomas Lücking 001; Burkhard Monien; Manuel Rode (ICALP, 2003)

Extreme Nash Equilibria. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Paul G. Spirakis (ICTCS, 2003)

Which Is the Worst-Case Nash Equilibrium? - Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Manuel Rode; Paul G. Spirakis; Imrich Vrto (MFCS, 2003)

Load balancing of unit size tokens and expansion properties of graphs. - Robert Elsässer; Burkhard Monien (SPAA, 2003)

Selfish Routing in Non-Cooperative Networks: A Survey. - Rainer Feldmann; Martin Gairing; Thomas Lücking 001; Burkhard Monien; Manuel Rode (Bull. EATCS, 2003)

On Spectral Bounds for the k-Partitioning of Graphs. - Robert Elsässer; Thomas Lücking 001; Burkhard Monien (Theory Comput. Syst., 2003)

Sparse topologies with small spectrum size. - Robert Elsässer; Rastislav Kralovic; Burkhard Monien (Theor. Comput. Sci., 2003)

Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks. - Robert Elsässer; Burkhard Monien; Stefan Schamberger (ESA, 2004)

Load Balancing in Dynamic Networks. - Robert Elsässer; Burkhard Monien; Stefan Schamberger (ISPAN, 2004)

Graph Partitioning with the Party Library: Helpful-Sets in Practice. - Burkhard Monien; Stefan Schamberger (SBAC-PAD, 2004)

Optimal Diffusion Schemes And Load Balancing On Product Graphs. - Robert Elsässer; Burkhard Monien; Robert Preis; Andreas Frommer (Parallel Process. Lett., 2004)

Improved bounds on cutwidths of shuffle-exchange and de Bruijn graphs. - Burkhard Monien; Imrich Vrto (Parallel Process. Lett., 2004)

New spectral lower bounds on the bisection width of graphs. - Sergei L. Bezrukov; Robert Elsässer; Burkhard Monien; Robert Preis; Jean-Pierre Tillich (Theor. Comput. Sci., 2004)

Error analysis in minimax trees. - Ulf Lorenz; Burkhard Monien (Theor. Comput. Sci., 2004)

Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. - Martin Gairing; Thomas Lücking 001; Burkhard Monien; Karsten Tiemann (ICALP, 2005)

A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. - Robert Elsässer; Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien (WINE, 2005)

Edge-disjoint spanning trees for the generalized butterfly networks and their applications. - Abderezak Touzene; Khaled Day; Burkhard Monien (J. Parallel Distributed Comput., 2005)

Structure and complexity of extreme Nash equilibria. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Paul G. Spirakis (Theor. Comput. Sci., 2005)

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 (Heinz Nixdorf Institut, 2006)

Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions. - Martin Gairing; Burkhard Monien; Karsten Tiemann (ICALP (1), 2006)

Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid. - Henning Meyerhenke; Burkhard Monien; Stefan Schamberger (IPDPS, 2006)

Selfish Routing in Networks. - Burkhard Monien (SOFSEM, 2006)

Scheduling Unrelated Parallel Machines Computational Results. - Burkhard Monien; Andreas Woclaw (WEA, 2006)

Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic. - Vladimir V. Mazalov; Burkhard Monien; Florian Schoppmann; Karsten Tiemann (WINE, 2006)

Upper bounds on the bisection width of 3- and 4-regular graphs. - Burkhard Monien; Robert Preis (J. Discrete Algorithms, 2006)

Distributing Unit Size Workload Packages in Heterogeneous Networks. - Robert Elsässer; Burkhard Monien; Stefan Schamberger (J. Graph Algorithms Appl., 2006)

Introduction. - Burkhard Monien; Guang Gao; Horst D. Simon; Paul G. Spirakis; Per Stenström (J. Parallel Distributed Comput., 2006)

The Price of Anarchy for Restricted Parallel Links. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien (Parallel Process. Lett., 2006)

A 5/4-approximation algorithm for scheduling identical malleable tasks. - Thomas Decker 001; Thomas Lücking 001; Burkhard Monien (Theor. Comput. Sci., 2006)

The price of anarchy for polynomial social cost. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien (Theor. Comput. Sci., 2006)

The Power of Two Prices: Beyond Cross-Monotonicity. - Yvonne Bleischwitz; Burkhard Monien; Florian Schoppmann; Karsten Tiemann (MFCS, 2007)

Congestion Games with Player-Specific Constants. - Marios Mavronicolas; Igal Milchtaich; Burkhard Monien; Karsten Tiemann (MFCS, 2007)

Routing and Scheduling with Incomplete Information. - Burkhard Monien; Karsten Tiemann (DISC, 2007)

To Be or Not to Be (Served). - Yvonne Bleischwitz; Burkhard Monien; Florian Schoppmann (WINE, 2007)

A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. - Martin Gairing; Burkhard Monien; Andreas Woclaw (Theor. Comput. Sci., 2007)

Approximation Algorithms for Multilevel Graph Partitioning. - Robert Preis; Burkhard Monien; Stefan Schamberger (Handbook of Approximation Algorithms and Metaheuristics, 2007)

A new diffusion-based multilevel algorithm for computing graph partitions of very high quality. - Henning Meyerhenke; Burkhard Monien; Thomas Sauerwald (IPDPS, 2008)

Voronoi Games on Cycle Graphs. - Marios Mavronicolas; Burkhard Monien; Vicky G. Papadopoulou; Florian Schoppmann (MFCS, 2008)

On the Road to -Completeness: 8 Agents in a Singleton Congestion Game. - Dominic Dumrauf; Burkhard Monien (WINE, 2008)

Nash equilibria in discrete routing games with convex latency functions. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Manuel Rode (J. Comput. Syst. Sci., 2008)

Selfish Routing with Incomplete Information. - Martin Gairing; Burkhard Monien; Karsten Tiemann (Theory Comput. Syst., 2008)

A new model for selfish routing. - Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Manuel Rode (Theor. Comput. Sci., 2008)

Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen?. - Burkhard Monien; Ulf Lorenz; Daniel Warner 001 (Taschenbuch der Algorithmen, 2008)

From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future. - Sven Grothklags; Ulf Lorenz; Burkhard Monien (Algorithmics of Large and Complex Networks, 2009)

MultiProcessor Scheduling is PLS-Complete. - Dominic Dumrauf; Burkhard Monien; Karsten Tiemann (HICSS, 2009)

Nash Equilibria for Voronoi Games on Transitive Graphs. - Rainer Feldmann; Marios Mavronicolas; Burkhard Monien (WINE, 2009)

Fair cost-sharing methods for scheduling jobs on parallel machines. - Yvonne Bleischwitz; Burkhard Monien (J. Discrete Algorithms, 2009)

A new diffusion-based multilevel algorithm for computing graph partitions. - Henning Meyerhenke; Burkhard Monien; Thomas Sauerwald (J. Parallel Distributed Comput., 2009)

Graph partitioning and disturbed diffusion. - Henning Meyerhenke; Burkhard Monien; Stefan Schamberger (Parallel Comput., 2009)

On the Power of Nodes of Degree Four in the Local Max-Cut Problem. - Burkhard Monien; Tobias Tscheuschner (CIAC, 2010)

Local Search: Simple, Successful, But Sometimes Sluggish. - Burkhard Monien; Dominic Dumrauf; Tobias Tscheuschner (ICALP (1), 2010)

Computing Nash Equilibria for Scheduling on Restricted Parallel Links. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien (Theory Comput. Syst., 2010)

Preface. - Burkhard Monien; Ulf-Peter Schroeder (Theory Comput. Syst., 2010)

Exact Price of Anarchy for Polynomial Congestion Games. - Sebastian Aland; Dominic Dumrauf; Martin Gairing; Burkhard Monien; Florian Schoppmann (SIAM J. Comput., 2011)

Routing (un-) splittable flow in games with player-specific affine latency functions. - Martin Gairing; Burkhard Monien; Karsten Tiemann (ACM Trans. Algorithms, 2011)

Selfish Distributed Optimization. - Burkhard Monien; Christian Scheideler (Euro-Par, 2012)

Letter from the President. - Burkhard Monien (Bull. EATCS, 2012)

Report form the EATCS General Assembly. - Burkhard Monien (Bull. EATCS, 2012)

Computing Nash Equilibria for Two-Player Restricted Network Congestion Games is -Complete. - Dominic Dumrauf; Burkhard Monien (Parallel Process. Lett., 2012)

How many attackers can selfish defenders catch? - Marios Mavronicolas; Burkhard Monien; Vicky Papadopoulou Lesta (Discret. Appl. Math., 2013)

On the PLS-complexity of maximum constraint assignment. - Dominic Dumrauf; Burkhard Monien (Theor. Comput. Sci., 2013)

Preface to the self-portrayals of the GI Junior Fellows. - Peter Liggesmeyer; Burkhard Monien (it Inf. Technol., 2014)

Weighted Boolean Formula Games. - Marios Mavronicolas; Burkhard Monien; Klaus W. Wagner (Algorithms, Probability, Networks, and Games, 2015)

The complexity of pure equilibria in mix-weighted congestion games on parallel links. - Marios Mavronicolas; Burkhard Monien (Inf. Process. Lett., 2015)

Minimizing Expectation Plus Variance. - Marios Mavronicolas; Burkhard Monien (Theory Comput. Syst., 2015)

The complexity of equilibria for risk-modeling valuations. - Marios Mavronicolas; Burkhard Monien (Theor. Comput. Sci., 2016)

NP NP -Hardness of Equilibria in Case of Risk-Averse Players. - Marios Mavronicolas; Burkhard Monien (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube. - Burkhard Monien; Gerd Wechsung (J. Graph Theory, 2018)

(In)Existence of Equilibria for 2-Players, 2-Values Games with Concave Valuations. - Chryssis Georgiou; Marios Mavronicolas; Burkhard Monien (CoRR, 2020)

Conditional Value-at-Risk: Structure and complexity of equilibria. - Marios Mavronicolas; Burkhard Monien (Theor. Comput. Sci., 2020)

The complexity of (E+Var)-equilibria, ESR-equilibria, and SuperE-equilibria for 2-players games with few cost values. - Chryssis Georgiou; Marios Mavronicolas; Burkhard Monien (Theor. Comput. Sci., 2021)

(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions. - Chryssis Georgiou; Marios Mavronicolas; Burkhard Monien (Theory Comput. Syst., 2022)

Which is the Worst-Case Nash Equilibrium? - Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Paul G. Spirakis; Imrich Vrto (SIAM J. Discret. Math., 2024)