Wolfgang Espelage

	2005
6		Wolfgang Espelage, Egon Wanke: A linear time approximation algorithm for movement minimization in conveyor flow shop processing. European Journal of Operational Research 160(2): 485-500 (2005)
	2003
5		Wolfgang Espelage, Frank Gurski, Egon Wanke: Deciding Clique-Width for Graphs of Bounded Tree-Width. J. Graph Algorithms Appl. 7(2): 141-180 (2003)
	2001
4		Wolfgang Espelage, Egon Wanke: A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing. MFCS 2001: 363-374
3		Wolfgang Espelage, Frank Gurski, Egon Wanke: Deciding Clique-Width for Graphs of Bounded Tree-Width. WADS 2001: 87-98
2		Wolfgang Espelage, Frank Gurski, Egon Wanke: How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. WG 2001: 117-128
	2000
1		Wolfgang Espelage, Egon Wanke: Movement minimization in conveyor flow shop processing. SODA 2000: 233-234

Coauthor Index

1	Frank Gurski	[2] [3] [5]
2	Egon Wanke	[1] [2] [3] [4] [5] [6]

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page