| 2017 | SAGT | Conditional Value-at-Risk: Structure and Complexity of Equilibria. | Marios Mavronicolas, Burkhard Monien |
| 2012 | EuroPar | Selfish Distributed Optimization. | Burkhard Monien, Christian Scheideler |
| 2012 | SAGT | Minimizing Expectation Plus Variance. | Marios Mavronicolas, Burkhard Monien |
| 2010 | CIAC | On the Power of Nodes of Degree Four in the Local Max-Cut Problem. | Burkhard Monien, Tobias Tscheuschner |
| 2010 | ICALP | Local Search: Simple, Successful, But Sometimes Sluggish. | Burkhard Monien, Dominic Dumrauf, Tobias Tscheuschner |
| 2008 | MFCS | Voronoi Games on Cycle Graphs. | Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou, Florian Schoppmann |
| 2007 | MFCS | The Power of Two Prices: Beyond Cross-Monotonicity. | Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, Karsten Tiemann |
| 2007 | MFCS | Congestion Games with Player-Specific Constants. | Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann |
| 2006 | CIAC | Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines. | Yvonne Bleischwitz, Burkhard Monien |
| 2006 | ICALP | Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions. | Martin Gairing, Burkhard Monien, Karsten Tiemann |
| 2006 | STACS | Exact Price of Anarchy for Polynomial Congestion Games. | Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann |
| 2006 | SOFSEM | Selfish Routing in Networks. | Burkhard Monien |
| 2005 | ICALP | Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. | Martin Gairing, Thomas Lcking, Burkhard Monien, Karsten Tiemann |
| 2005 | ICALP | A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines. | Martin Gairing, Burkhard Monien, Andreas Woclaw |
| 2005 | SPAA | Selfish routing with incomplete information. | Martin Gairing, Burkhard Monien, Karsten Tiemann |
| 2004 | ESA | Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks. | Robert Elssser, Burkhard Monien, Stefan Schamberger |
| 2004 | ICALP | Nash Equilibria in Discrete Routing Games with Convex Latency Functions. | Martin Gairing, Thomas Lcking, Marios Mavronicolas, Burkhard Monien, Manuel Rode |
| 2004 | MFCS | The Price of Anarchy for Polynomial Social Cost. | Martin Gairing, Thomas Lcking, Marios Mavronicolas, Burkhard Monien |
| 2004 | STOC | Computing Nash equilibria for scheduling on restricted parallel links. | Martin Gairing, Thomas Lcking, Marios Mavronicolas, Burkhard Monien |
| 2004 | STACS | A New Model for Selfish Routing. | Thomas Lcking, Marios Mavronicolas, Burkhard Monien, Manuel Rode |
| 2004 | SBAC-PAD | Graph Partitioning with the Party Library: Helpful-Sets in Practice. | Burkhard Monien, Stefan Schamberger |
| 2003 | DATE | SAT-Based Techniques in System Synthesis. | Christian Haubelt, Jrgen Teich, Rainer Feldmann, Burkhard Monien |
| 2003 | FPL | Fault Tolerances Analysis of Distributed Reconfigurable Systems Using SAT-Based Techniques. | Rainer Feldmann, Christian Haubelt, Burkhard Monien, Jrgen Teich |
| 2003 | ICALP | Nashification and the Coordination Ratio for a Selfish Routing Game. | Rainer Feldmann, Martin Gairing, Thomas Lcking, Burkhard Monien, Manuel Rode |
| 2003 | MFCS | Selfish Routing in Non-cooperative Networks: A Survey. | Rainer Feldmann, Martin Gairing, Thomas Lcking, Burkhard Monien, Manuel Rode |
| 2003 | MFCS | Which Is the Worst-Case Nash Equilibrium? | Thomas Lcking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto |
| 2003 | SPAA | Load balancing of unit size tokens and expansion properties of graphs. | Robert Elssser, Burkhard Monien |
| 2003 | WAOA | A 5/4-Approximation Algorithm for Scheduling Identical Malleable Tasks. | Thomas Decker, Thomas Lcking, Burkhard Monien |
| 2002 | MFCS | On the Problem of Scheduling Flows on Distributed Networks. | Thomas Lcking, Burkhard Monien, Manuel Rode |
| 2002 | STACS | The Secret of Selective Game Tree Search, When Using Random-Error Evaluations. | Ulf Lorenz, Burkhard Monien |
| 2001 | MFCS | Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. | Burkhard Monien, Robert Preis |
| 2001 | STACS | Scalable Sparse Topologies with Small Spectrum. | Robert Elssser, Rastislav Kralovic, Burkhard Monien |
| 2001 | SPAA | New spectral bounds on k-partitioning of graphs. | Robert Elssser, Thomas Lcking, Burkhard Monien |
| 2000 | AAAI | A Distributed Algorithm to Evaluate Quantified Boolean Formulae. | Rainer Feldmann, Burkhard Monien, Stefan Schamberger |
| 2000 | EuroPar | Towards Optimal Load Balancing Topologies. | Thomas Decker, Burkhard Monien, Robert Preis |
| 2000 | SPAA | Diffusive load balancing schemes on heterogeneous networks. | Robert Elssser, Burkhard Monien, Robert Preis |
| 2000 | WG | New Spectral Lower Bounds on the Bisection Width of Graphs. | Sergei L. Bezrukov, Robert Elssser, Burkhard Monien, Robert Preis, Jean-Pierre Tillich |
| 1999 | EuroPar | Optimal and Alternating-Direction Load Balancing Schemes. | Robert Elssser, Andreas Frommer, Burkhard Monien, Robert Preis |
| 1998 | ESA | Nearest Neighbor Load Balancing on Graphs. | Ralf Diekmann, Andreas Frommer, Burkhard Monien |
| 1997 | STACS | A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract). | Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Stefan Tschke |
| 1996 | SPAA | On the Communication Throughput of Buffered Multistage Interconnection Networks. | Ralf Rehrmann, Burkhard Monien, Reinhard Lling, Ralf Diekmann |
| 1995 | GD | A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs. | Burkhard Monien, Friedhelm Ramme, Helmut Salmen |
| 1994 | MFCS | Communication Throughput of Interconnection Networks. | Burkhard Monien, Ralf Diekmann, Reinhard Lling |
| 1994 | SPAA | Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation. | Rainer Feldmann, Peter Mysliwietz, Burkhard Monien |
| 1993 | STACS | Parallel Architectures: Design and Efficient Use. | Burkhard Monien, Rainer Feldmann, Ralf Klasing, Reinhard Lling |
| 1993 | SPAA | A Dynamic Distributed Load Balancing Algorithm with Provable Good Performance. | Reinhard Lling, Burkhard Monien |
| 1992 | STACS | Broadcasting in Butterfly and DeBruijn Networks. | Ralf Klasing, Burkhard Monien, Regine Peine, Elena Sthr |
| 1991 | MFCS | The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). | Juraj Hromkovic, Burkhard Monien |
| 1991 | SPAA | Simulating Binary Trees on X-Trees (Extended Abstract). | Burkhard Monien |
| 1991 | WG | Optimal Embedding of Complete Binary Trees into Lines and Grids. | Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger |
| 1990 | MFCS | Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract). | Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien |
| 1990 | STACS | Caterpillars and Context-Free Languages. | Michal Chytil, Burkhard Monien |
| 1989 | SPAA | On the Number of Rounds Necessary to Disseminate Information. | Shimon Even, Burkhard Monien |
| 1989 | WG | WEighted Parallel Triangulation of Simple Polygons. | Knut Menzel, Burkhard Monien |
| 1988 | MFCS | Comparing Interconnection Networks. | Burkhard Monien, Ivan Hal Sudborough |
| 1988 | WG | Bandwidth and Profile Minimization. | Manfred Wiegers, Burkhard Monien |
| 1987 | ICS | Superlinear Speedup for Parallel Backtracking. | Ewald Speckenmeyer, Burkhard Monien, Oliver Vornberger |
| 1986 | ICALP | Min Cut is NP-Complete for Edge Weigthed Trees. | Burkhard Monien, Ivan Hal Sudborough |
| 1985 | FCT | The complexity of embedding graphs into binary trees. | Burkhard Monien |
| 1985 | STACS | On the Complexity of Deadlock Recovery. | Joseph Y.-T. Leung, Burkhard Monien |
| 1983 | WG | The Complexity of Determining Paths of Length k. | Burkhard Monien |
| 1982 | WG | The Complexity of Determing a Shortest Cycle of Even Length. | Burkhard Monien |
| 1981 | FCT | On the LBA Problem. | Burkhard Monien |
| 1981 | MFCS | On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). | Ronald V. Book, Matthias Jantzen, Burkhard Monien, Colm 'Dnlaing, Celia Wrathall |
| 1981 | MFCS | Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey). | Burkhard Monien, Ivan Hal Sudborough |
| 1981 | STOC | Bandwidth Constrained NP-Complete Problems | Burkhard Monien, Ivan Hal Sudborough |
| 1981 | WG | Four Approximation Algorithms for the Feedback Vertex Set Problem. | Burkhard Monien, Reinald Schulz |
| 1980 | MFCS | On a Subclass of Pseudopolynomial Problems. | Burkhard Monien |
| 1980 | WG | Bounding the Bandwidth of NP-Complete Problems. | Burkhard Monien, Ivan Hal Sudborough |
| 1979 | ICALP | On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space. | Burkhard Monien, Ivan Hal Sudborough |
| 1977 | ICALP | About the Derivation Languages of Grammars and Machines. | Burkhard Monien |
| 1974 | ICALP | Characterizations of Time-Bounded Computations by Limited Primitive Recursion. | Burkhard Monien |
| 1972 | ICALP | Relationship between Pushdown Automata and Tape-Bounded Turing Machines. | Burkhard Monien |