Exploiting structure to cope with NP-hard graph problems- Polynomial and exponential time exact algorithms رسالة دكتوراه