• Publications
  • Influence
New Width Parameters of Graphs
Abstract The main focus of this thesis is on using the divide and conquer technique toeciently solve graph problems that are in general intractable. We work inthe eld of parameterized algorithms,Expand
  • 91
  • 17
  • PDF
Graph classes with structured neighborhoods and algorithmic applications
TLDR
We show how to compute decompositions with the number of d-neighborhoods bounded by a polynomial of the input size. Expand
  • 57
  • 16
  • PDF
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
TLDR
We provide dynamic programming algorithms for many locally checkable vertex subset and vertex partitioning problems. Expand
  • 49
  • 9
  • PDF
Independent Set in P5-Free Graphs in Polynomial Time
TLDR
In this paper we give the first polynomial time algorithm for Independent Set on P5-free graphs. Expand
  • 108
  • 8
  • PDF
Boolean-Width of Graphs
TLDR
We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. Expand
  • 37
  • 6
Faster algorithms for vertex partitioning problems parameterized by clique-width
TLDR
We show that for graphs of clique-width k given with a k-expression, Dominating Set can be solved in 4 k n O ( 1 ) time. Expand
  • 18
  • 5
  • PDF
Solving #SAT and MAXSAT by Dynamic Programming
TLDR
We look at dynamic programming algorithms for propositional model counting, also called #SAT, and MaxSAT using similar, but more modern, graph structure tools. Expand
  • 27
  • 5
  • PDF
Constructions of k-critical P5-free graphs
With respect to a hereditary class C of graphs, a k -chromatic graph G ? C is said to be k -critical if every proper subgraph of G belonging to C is k - 1 colorable. It is known that there is aExpand
  • 24
  • 4
  • PDF
On the Boolean-Width of a Graph: Structure and Applications
Boolean-width is a recently introduced graph invariant. Similar to tree-width, it measures the structural complexity of graphs. Given any graph G and a decomposition of G of boolean-width k, we giveExpand
  • 23
  • 3
  • PDF
Boolean-width of graphs
TLDR
We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods-Boolean sums of neighborhoods–across a cut of a graph. Expand
  • 53
  • 2
  • PDF