| 2013 | GD | Slanted Orthogonal Drawings. | Michael A. Bekos, Michael Kaufmann, Robert Krug, Stefan Nher, Vincenzo Roselli |
| 2002 | ESA | Design and Implementation of Efficient Data Types for Static Graphs. | Stefan Nher, Oliver Zlotowski |
| 1998 | GD | A Library of Algorithms for Graph Drawing. | Petra Mutzel, Carsten Gutwenger, Ralf Brockenauer, Sergej Fialko, Gunnar W. Klau, Michael Krger, Thomas Ziegler, Stefan Nher, David Alberts, Dirk Ambras, Gunter Koch, Michael Jnger, Christoph Buchheim, Sebastian Leipert |
| 1998 | MFCS | From Algorithms to Working Programs: On the Use of Program Checking in LEDA. | Kurt Mehlhorn, Stefan Nher |
| 1997 | ICALP | The LEDA Platform of Combinatorial and Geometric Computing. | Kurt Mehlhorn, Stefan Nher, Christian Uhrig |
| 1996 | GI | The LEDA Platform for Combinatorial and Geometric Computing. | Kurt Mehlhorn, Stefan Nher, Christian Uhrig |
| 1993 | STACS | LEDA: A Library of Efficient Data Types and Algorithms. | Stefan Nher |
| 1990 | GI | LEDA - A Library of Efficient Data Types and Algorithms. | Stefan Nher, Kurt Mehlhorn |
| 1990 | ICALP | LEDA: A Library of Efficient Data Types and Algorithms. | Stefan Nher, Kurt Mehlhorn |
| 1989 | FOCS | On the Complexity of a Game Related to the Dictionary Problem | Kurt Mehlhorn, Stefan Nher, Monika Rauch |
| 1989 | MFCS | LEDA: A Library of Efficient Data Types and Algorithms. | Kurt Mehlhorn, Stefan Nher |
| 1987 | ICALP | A Lower Bound for the Complexity of the Union-Split-Find Problem. | Kurt Mehlhorn, Stefan Nher, Helmut Alt |