• Publications
  • Influence
A measure & conquer approach for the analysis of exact algorithms
TLDR
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
  • 221
  • 21
  • PDF
On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs
TLDR
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
  • 92
  • 12
  • PDF
Measure and Conquer: Domination - A Case Study
TLDR
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
  • 145
  • 10
  • PDF
Rankings of Graphs
TLDR
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
  • 132
  • 8
  • PDF
Measure and conquer: a simple O(20.288n) independent set algorithm
TLDR
In this paper we apply "Measure and Conquer" to the analysis of a very simple backtracking algorithm solving the maximum independent set problem. Expand
  • 143
  • 7
  • PDF
Exact (Exponential) Algorithms for the Dominating Set Problem
TLDR
We design fast exact algorithms for the problem of computing a minimum dominating set in undirected graphs. Expand
  • 125
  • 7
  • PDF
Treewidth and Pathwidth of Permutation Graphs
TLDR
In this paper, we show that the treewidth and pathwidth of a permutation graph can be computed in polynomial time. Expand
  • 101
  • 6
  • PDF
Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms
TLDR
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
  • 134
  • 6
  • PDF
Certifying algorithms for recognizing interval graphs and permutation graphs
TLDR
A certifying algorithm for a decision problem is an algorithm that provides a certificate with each answer that it produces. Expand
  • 131
  • 6
  • PDF
An exact algorithm for the Maximum Leaf Spanning Tree problem
TLDR
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
  • 65
  • 6
  • PDF