Search the dblp DataBase
Wolfgang Espelage: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Wolfgang Espelage, Egon Wanke
A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing. [Citation Graph (0, 0)][DBLP]
MFCS, 2001, pp:363-374 [Conf] - Wolfgang Espelage, Egon Wanke
Movement minimization in conveyor flow shop processing. [Citation Graph (0, 0)][DBLP]
SODA, 2000, pp:233-234 [Conf] - Wolfgang Espelage, Frank Gurski, Egon Wanke
Deciding Clique-Width for Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
WADS, 2001, pp:87-98 [Conf] - Wolfgang Espelage, Frank Gurski, Egon Wanke
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. [Citation Graph (0, 0)][DBLP]
WG, 2001, pp:117-128 [Conf] - Wolfgang Espelage, Frank Gurski, Egon Wanke
Deciding Clique-Width for Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
J. Graph Algorithms Appl., 2003, v:7, n:2, pp:141-180 [Journal] - Wolfgang Espelage, Egon Wanke
A linear time approximation algorithm for movement minimization in conveyor flow shop processing. [Citation Graph (0, 0)][DBLP]
European Journal of Operational Research, 2005, v:160, n:2, pp:485-500 [Journal]
Search in 0.001secs, Finished in 0.001secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002