Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Wanke, Egon - Institut für Informatik, Heinrich-Heine-Universität Düsseldorf
How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time
Discrete Optimization A linear time approximation algorithm for movement
How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time
The Combinatorial Complexity of Masterkeying Wolfgang Espelage Egon Wanke y
Journal of Graph Algorithms and Applications http://jgaa.info/
Math Meth Oper Res (2003) 57:173206 Movement minimization for unit distances in conveyor
Math Meth Oper Res (2000) 51:495513 Movement optimization in ow shop processing with
Math Meth Oper Res (2000) 51:203233 An approximation algorithm for the stack-up problem*
Math Meth Oper Res (2000) 52:325348 The combinatorial complexity of masterkeying
kNLC Graphs and Polynomial Algorithms \Lambda Egon Wanke y Frank Gurski z
The Tree-Width of Clique-Width Bounded Graphs Without K n;n
