Markus W. Schäffter

According to our database, Markus W. Schäffter authored at least 6 papers between 1995 and 1999.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1999

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

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

Parallel Comput., 1999

1998

Switchbox Routing in VLSI Design: Closing the Complexity Gap.

Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz

Theor. Comput. Sci., 1998

1997

Scheduling with Forbidden Sets.

Markus W. Schäffter

Discret. Appl. Math., 1997

1996

Scheduling jobs with communication delays: complexity results and approximation algorithms.

Markus W. Schäffter

PhD thesis, 1996

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

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

Proceedings of the Algorithms, 1996

1995

Drawing Graphs on Rectangular Grids.

Markus W. Schäffter

Discret. Appl. Math., 1995