M. Vatshelle

Publications
Influence

M. Vatshelle
Mathematics
3 September 2012

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

Graph classes with structured neighborhoods and algorithmic applications

R. Belmonte, M. Vatshelle
Computer Science, Mathematics
Theor. Comput. Sci.
1 November 2013

We show how to compute decompositions with the number of d-neighborhoods bounded by a polynomial of the input size. Expand

Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems

Binh-Minh Bui-Xuan, J. Telle, M. Vatshelle
Computer Science, Mathematics
Theor. Comput. Sci.
1 November 2013

We provide dynamic programming algorithms for many locally checkable vertex subset and vertex partitioning problems. Expand

Independent Set in P5-Free Graphs in Polynomial Time

D. Lokshtanov, M. Vatshelle, Yngve Villanger
Computer Science, Mathematics
SODA
5 January 2014

In this paper we give the first polynomial time algorithm for Independent Set on P5-free graphs. Expand

Boolean-Width of Graphs

Binh-Minh Bui-Xuan, J. Telle, M. Vatshelle
Mathematics, Computer Science
IWPEC
2 December 2009

We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. Expand

Faster algorithms for vertex partitioning problems parameterized by clique-width

Sang-il Oum, Sigve Hortemo Sæther, M. Vatshelle
Computer Science, Mathematics
Theor. Comput. Sci.
1 November 2013

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

Solving #SAT and MAXSAT by Dynamic Programming

Sigve Hortemo Sæther, J. Telle, M. Vatshelle
Mathematics, Computer Science
J. Artif. Intell. Res.
1 September 2015

We look at dynamic programming algorithms for propositional model counting, also called #SAT, and MaxSAT using similar, but more modern, graph structure tools. Expand

Constructions of k-critical P5-free graphs

C. Hoàng, B. Moore, D. Recoskie, J. Sawada, M. Vatshelle
Computer Science, Mathematics
Discret. Appl. Math.
19 February 2015

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 a… Expand

On the Boolean-Width of a Graph: Structure and Applications

I. Adler, Binh-Minh Bui-Xuan, Y. Rabinovich, G. Renault, J. Telle, M. Vatshelle
Mathematics, Computer Science
WG
19 August 2009

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 give… Expand

Boolean-width of graphs

Binh-Minh Bui-Xuan, J. Telle, M. Vatshelle
Computer Science, Mathematics
Theor. Comput. Sci.
9 September 2011

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

Recommended Authors