We show that a good choice of the measure, made in the very first stages of exact algorithms design, can have a tremendous impact on the running time bounds achievable.Expand

We present O(n5R + n3R3) time algorithms to compute the treewidth, pathwidth, minimum fill-in and minimum interval graph completion of asteroidal triple-free graphs, where n is the number of vertices and R is thenumber of minimal separators of the input graph.Expand

We present a refined analysis, based on a different measure of the size of the subproblems generated and show that the same algorithm has running time O(20.850n) on n-nodes graphs.Expand

A vertex (edge) coloring $\phi:V\rightarrow \{1,2,\ldots,$ $t\}$) of a graph G=(V,E) is the smallest value of t such that G has a vertex ( edge) t-ranking.Expand

In this paper we apply "Measure and Conquer" to the analysis of a very simple backtracking algorithm solving the maximum independent set problem.Expand

This survey concerns techniques in design and analysis of algo- rithms that can be used to solve NP hard problems faster than ex- haustive search algorithms (but still in exponential time).Expand

We present an algorithm to solve the Maximum Leaf Spanning Tree problem from an exponential time viewpoint, where it is equivalent to the Connected Dominating Set problem.Expand