Search

Author:

Belbasi, Mahdi

Title:

FPT Aglorithms for NP-complete Graph Problems Parameterized by Treewidth and Tree-depth

Graduate Program:

Computer Science and Engineering

Keywords:

Computer Science
Graph Theory
Tree Decomposition
Algorithm Design
Approximation Algorithms
Hamiltonian Cycle
Dominating Set
Algebraization

File:

Download Mahdi_Belbasi_-_PhD_Dissertation.pdf

Committee Members:

Chitaranjan Das, Program Head/Chair
Martin Fürer, Chair & Dissertation Advisor
Antonio Blanca, Major Field Member
Jan Reimann, Outside Unit & Field Member
Paul Medvedev, Major Field Member