Searching for authors named Egon Wanke – sorted by Relevance.
-
The Tree-Width of Clique-Width Bounded Graphs Without K n,n
- The Tree-Width of Clique-Width Bounded Graphs Without K n;n Frank Gurski ? and Egon Wanke
- Cited by 11 (2 self) – Add To MetaCart
-
The Combinatorial Complexity of Masterkeying
- The Combinatorial Complexity of Masterkeying Wolfgang Espelage Egon Wanke y Abstract We
- Cited by 2 (0 self) – Add To MetaCart
-
k-NLC Graphs and Polynomial Algorithms
- k-NLC Graphs and Polynomial Algorithms Frank Gurski y Egon Wanke z Abstract We introduce
- Cited by 21 (2 self) – Add To MetaCart
-
How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time
- Espelage, Frank Gurski ? , and Egon Wanke Department of Computer Science, D-40225 Dusseldorf, Germany
- Cited by 20 (2 self) – Add To MetaCart
-
Deciding Clique-Width for Graphs of Bounded Tree-Width
- ) Deciding Clique-Width for Graphs of Bounded Tree-Width Wolfgang Espelage Frank Gurski Egon Wanke Department
- Cited by 7 (1 self) – Add To MetaCart
-
How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time
- Espelage, Frank Gurski ? , and Egon Wanke Department of Computer Science, D-40225 Dusseldorf, Germany
- Add To MetaCart
-
der Heinrich-Heine-Universität Düsseldorf vorgelegt von
- . Egon Wanke Tag der mündlichen Prüfung: 20.12.2006 Acknowledgments I want to thank my thesis advisor
- Add To MetaCart

