Wolfgang Espelage

According to our database, Wolfgang Espelage authored at least 8 papers between 2000 and 2005.

Collaborative distances:

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

2005

A linear time approximation algorithm for movement minimization in conveyor flow shop processing.

Wolfgang Espelage, Egon Wanke

Eur. J. Oper. Res., 2005

2003

Movement minimization for unit distances in conveyor flow shop processing.

Wolfgang Espelage, Egon Wanke

Math. Methods Oper. Res., 2003

Deciding Clique-Width for Graphs of Bounded Tree-Width.

Wolfgang Espelage, Frank Gurski, Egon Wanke

J. Graph Algorithms Appl., 2003

2001

How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time.

Wolfgang Espelage, Frank Gurski, Egon Wanke

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing.

Wolfgang Espelage, Egon Wanke

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000

The combinatorial complexity of masterkeying.

Wolfgang Espelage, Egon Wanke

Math. Methods Oper. Res., 2000

Movement optimization in flow shop processing with buffers.

Wolfgang Espelage, Egon Wanke

Math. Methods Oper. Res., 2000

Movement minimization in conveyor flow shop processing.

Wolfgang Espelage, Egon Wanke

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000