We define a notion called leftmost separator of size at most k. A leftmo...
We present a new approximation algorithm for the treewidth problem which...
An NP-hard graph problem may be intractable for general graphs but it co...
An algorithm is presented that solves the Minimum Dominating Set problem...