Publications by Martin Vatshelle
Accepted papers
Upper Bounds on Boolean-width with Applications to Exact Algorithms
Y.Rabinovich,
J.A.Telle
and M. Vatshelle
Accepted to IPEC 2013
The Point-Set Embedability Problem for Plane Graphs
with
T.Biedl,
Accepted to SOCG 2012
k-Gap Interval Graphs
F.Fomin,
S.Gaspers,
P.Golovach,
K.Suchan,
S.Szeider,
E.J.van Leeuwen,
M.Vatshelle,
and Y.Villanger,
Accepted to Latin 2012
Finding Good Decompositions for Dynamic Programming on Dense Graphs
E.M.Hvidevold,
Sadia Sharmin,
J.A.Telle
and M.Vatshelle,
, Proceedings IPEC 2011
Graph Classes with Structured Neighborhoods and Algorithmic Applications
R.Belmonte
and M.Vatshelle
, Proceedings WG 2011,
Journal version
submitted to journal.
Faster Algorithms on Branch and Clique Decompositions
H.L.Bodlaender,
E.J.van Leeuwen,
J.M.M.van Rooij,
and M.Vatshelle,
Proceedings MFCS 2010,
On the boolean-width of a graph: structure and applications
I.Adler,
B-M Bui-Xuan,
Y.Rabinovich,
G.Renault,
J.A.Telle
and M.Vatshelle,
Proceedings WG 2010
Fast FPT algorithms for vertex subset and vertex partitioning problems using unions of neighbourhoods
B-M Bui-Xuan,
J.A.Telle
and M.Vatshelle
Journal version
submitted to journal.
Boolean-width of graphs
B-M Bui-Xuan,
J.A.Telle
and M.Vatshelle ,
Proceedings IWPEC 2009
Boolean-width of graphs
B-M Bui-Xuan,
J.A.Telle
and M.Vatshelle ,
TCS, Volume 412, Issue 39, Pages 5187-5204, 2011
Feedback Vertex Set on Graphs of low Cliquewidth
B-M Bui-Xuan,
J.A.Telle
and M.Vatshelle ,
Proceedings IWOCA 2009
Feedback Vertex Set on Graphs of low Cliquewidth
B-M Bui-Xuan,
O. Suchy,
J.A.Telle
and M.Vatshelle ,
to appear in EJC
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
B-M Bui-Xuan,
J.A.Telle
and M.Vatshelle ,
Discrete Applied Mathematics, Volume 158, Issue 7, 2010
Characterization and recognition of digraphs of bounded Kelly-width
D. Meister, J.A.Telle and M. Vatshelle , WG 2007
Recognizing digraphs of Kelly-width 2
D. Meister,
J.A. Telle
and M. Vatshelle ,
Discrete Applied Mathematics, Volume 158, Issue 7, 2010
Thesis
New Width Parameters of Graphs
Martin Vatshelle
Work in progress
Faster Algorithms for Domination Problems Parameterized by Clique-width
S. Oum,
S. Sæther
and M. Vatshelle
Independent Set in P_5-Free Graphs in Polynomial Time
D. Lokshtanov,
M. Vatshelle
and Y. Villanger
A Polynomial time Algorithm for the Maximum Weight Independent Set Problem on Outerstring Graphs
M. Keil,
D. Pradhan
and M. Vatshelle
Cops-and-robbers: remarks and problems
M.Boyer,
S.El Harti,
A.El Ouarari,
R.Ganian,
G.Hahn,
C.Moldenauer,
I.Rutter,
B.Theriault,
and M.Vatshelle
The boolean-width of a grid
S. Sharmin and M. Vatshelle
Online Matching from a New Perspective
L.M. Favrholdt and M. Vatshelle