| 2008 | SAGT | Facets of the Fully Mixed Nash Equilibrium Conjecture. | Rainer Feldmann, Marios Mavronicolas, Andreas Pieris |
| 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 |
| 2002 | EuroPar | Discrete Optimization. | Rainer Feldmann, Catherine Roucairol |
| 2001 | EuroPar | Topic 06: Complexity Theory and Algorithms. | Gianfranco Bilardi, Rainer Feldmann, Kieran T. Herley, Bruce M. Maggs |
| 2000 | AAAI | A Distributed Algorithm to Evaluate Quantified Boolean Formulae. | Rainer Feldmann, Burkhard Monien, Stefan Schamberger |
| 1997 | STACS | A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract). | Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Stefan Tschke |
| 1997 | SOFSEM | Computer Chess: Algorithms and Heuristics for a Deep Look into the Future. | Rainer Feldmann |
| 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 |
| 1992 | MFCS | The Shuffle Exchange Network has a Hamiltonian Path. | Rainer Feldmann, Peter Mysliwietz |