| |
| * | 1999 | |
|---|---|---|
| 6 | Rolf H. Möhring, Markus W. Schäffter: Scheduling series-parallel orders subject to 0/1-communication delays. Parallel Computing 25(1): 23-40 (1999) | |
| 1998 | ||
| 5 | EE | Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz: Switchbox Routing in VLSI Design: Closing the Complexity Gap. Theor. Comput. Sci. 203(1): 31-49 (1998) |
| 1997 | ||
| 4 | EE | Markus W. Schäffter: Scheduling with Forbidden Sets. Discrete Applied Mathematics 72(1-2): 155-166 (1997) |
| 1996 | ||
| 3 | EE | Rolf H. Möhring, Markus W. Schäffter, Andreas S. Schulz: Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract). ESA 1996: 76-90 |
| 2 | EE | Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz: Switchbox Routing in VLSI Design: Closing the Complexity Gap. WG 1996: 196-210 |
| 1995 | ||
| 1 | EE | Markus W. Schäffter: Drawing Graphs on Rectangular Grids. Discrete Applied Mathematics 63(1): 75-89 (1995) |
| 1 | Stephan Hartmann | [2] [5] |
| 2 | Rolf H. Möhring | [3] [6] |
| 3 | Andreas S. Schulz | [2] [3] [5] |