 | 2012 |
| 14 |  | Fedor V. Fomin,
Serge Gaspers,
Petr A. Golovach,
Karol Suchan,
Stefan Szeider,
Erik Jan van Leeuwen,
Martin Vatshelle,
Yngve Villanger:
k-Gap Interval Graphs.
LATIN 2012: 350-361 |
| 2011 |
| 13 |  | Eivind Magnus Hvidevold,
Sadia Sharmin,
Jan Arne Telle,
Martin Vatshelle:
Finding Good Decompositions for Dynamic Programming on Dense Graphs.
IPEC 2011: 219-231 |
| 12 |  | Rémy Belmonte,
Martin Vatshelle:
Graph Classes with Structured Neighborhoods and Algorithmic Applications.
WG 2011: 47-58 |
| 11 |  | Fedor V. Fomin,
Serge Gaspers,
Petr A. Golovach,
Karol Suchan,
Stefan Szeider,
Erik Jan van Leeuwen,
Martin Vatshelle,
Yngve Villanger:
k-Gap Interval Graphs
CoRR abs/1112.3244: (2011) |
| 10 |  | Binh-Minh Bui-Xuan,
Jan Arne Telle,
Martin Vatshelle:
Boolean-width of graphs.
Theor. Comput. Sci. 412(39): 5187-5204 (2011) |
| 2010 |
| 9 |  | Hans L. Bodlaender,
Erik Jan van Leeuwen,
Johan M. M. van Rooij,
Martin Vatshelle:
Faster Algorithms on Branch and Clique Decompositions.
MFCS 2010: 174-185 |
| 8 |  | Isolde Adler,
Binh-Minh Bui-Xuan,
Yuri Rabinovich,
Gabriel Renault,
Jan Arne Telle,
Martin Vatshelle:
On the Boolean-Width of a Graph: Structure and Applications.
WG 2010: 159-170 |
| 7 |  | Rémy Belmonte,
Martin Vatshelle:
On graph classes with logarithmic boolean-width
CoRR abs/1009.0216: (2010) |
| 6 |  | Daniel Meister,
Jan Arne Telle,
Martin Vatshelle:
Recognizing digraphs of Kelly-width 2.
Discrete Applied Mathematics 158(7): 741-746 (2010) |
| 5 |  | Binh-Minh Bui-Xuan,
Jan Arne Telle,
Martin Vatshelle:
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth.
Discrete Applied Mathematics 158(7): 809-819 (2010) |
| 2009 |
| 4 |  | Binh-Minh Bui-Xuan,
Jan Arne Telle,
Martin Vatshelle:
Feedback Vertex Set on Graphs of Low Cliquewidth.
IWOCA 2009: 113-124 |
| 3 |  | Binh-Minh Bui-Xuan,
Jan Arne Telle,
Martin Vatshelle:
Boolean-Width of Graphs.
IWPEC 2009: 61-74 |
| 2 |  | Binh-Minh Bui-Xuan,
Jan Arne Telle,
Martin Vatshelle:
Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions
CoRR abs/0903.4796: (2009) |
| 2007 |
| 1 |  | Daniel Meister,
Jan Arne Telle,
Martin Vatshelle:
Characterization and Recognition of Digraphs of Bounded Kelly-width.
WG 2007: 270-279 |