Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
WG
/
Paper
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time.
Wolfgang Espelage
,
Frank Gurski
,
Egon Wanke
Venue
B
WG
Year
2001
Proceedings
WG
DBLP record
conf/wg/EspelageGW01 ↗
Browse the full
WG paper archive
.