Markus W. Schäffter

Drawing Graphs on Rectangular Grids

Markus W. Schäffter, M. Schäffter, 1995, Discret. Appl. Math..

Switchbox Routing in VLSI Design: Closing the Complexity Gap

Stephan Hartmann, Andreas S. Schulz, Markus W. Schäffter, 1998, Theor. Comput. Sci..

Scheduling with Forbidden Sets

Markus W. Schäffter, M. Schäffter, 1997, Discret. Appl. Math..

A Simple Approximation Algorithm for Scheduling Forests with Unit Processing Times and Zero-One Communication Delays

Rolf H. Möhring, Markus W. Schäffter, 1995 .

Scheduling jobs with communication delays: complexity results and approximation algorithms

Markus W. Schäffter, M. Schäffter, 1996 .

Scheduling series-parallel orders subject to 0/1-communication delays

Rolf H. Möhring, Markus W. Schäffter, 1999, Parallel Comput..

Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract)

Rolf H. Möhring, Andreas S. Schulz, Markus W. Schäffter, 1996, ESA.

Switchbox Routing in VLSI Design: Closing the Complexity Gap

Stephan Hartmann, Andreas S. Schulz, Markus W. Schäffter, 1996, Theor. Comput. Sci..