Martin Vatshelle

Publication Activity (10 Years)

Years Active: 2007-2023
Publications (10 Years): 6

Top Topics

Top Venues

Theor. Comput. Sci.

Publications

Emmanuel Arrighi, Pål Grønås Drange, Kenneth Langedal, Farhad Vadiee, Martin Vatshelle, Petra Wolf
PACE Solver Description: Zygosity. IPEC (2023)
Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle
Recognition of Linear and Star Variants of Leaf Powers is in P. WG (2022)
Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle
On Alternative Models for Leaf Powers. CoRR (2021)
Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen, Peter Rossmanith, Martin Vatshelle
Fast Dynamic Programming on Graph Decompositions. CoRR (2018)
J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle
An algorithm for the maximum weight independent set problem on outerstring graphs. Comput. Geom. 60 (2017)
Sigve Hortemo Sæther, Martin Vatshelle
Hardness of computing width parameters based on branch decompositions over the vertex set. Theor. Comput. Sci. 615 (2016)
J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle
An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs. CCCG (2015)
Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle
Solving #SAT and MAXSAT by Dynamic Programming. J. Artif. Intell. Res. 54 (2015)
Sigve Hortemo Sæther, Martin Vatshelle
Hardness of computing width parameters based on branch decompositions over the vertex set. Electron. Notes Discret. Math. 49 (2015)
Chính T. Hoàng, Brian Moore, Daniel Recoskie, Joe Sawada, Martin Vatshelle
Constructions of k-critical P5-free graphs. Discret. Appl. Math. 182 (2015)
Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle
Solving MaxSAT and #SAT on Structured CNF Formulas. SAT (2014)
Daniel Lokshantov, Martin Vatshelle, Yngve Villanger
-Free Graphs in Polynomial Time. SODA (2014)
Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle
Solving MaxSAT and #SAT on structured CNF formulas. CoRR (2014)
Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle
Faster algorithms for vertex partitioning problems parameterized by clique-width. Theor. Comput. Sci. 535 (2014)
Therese C. Biedl, Martin Vatshelle
The Point-Set Embeddability Problem for Plane graphs. Int. J. Comput. Geom. Appl. 23 (4-5) (2013)
Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle
Faster Algorithms Parameterized by Clique-width. CoRR (2013)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theor. Comput. Sci. 511 (2013)
Binh-Minh Bui-Xuan, Ondrej Suchý, Jan Arne Telle, Martin Vatshelle
Feedback vertex set on graphs of low clique-width. Eur. J. Comb. 34 (3) (2013)
Yuri Rabinovich, Jan Arne Telle, Martin Vatshelle
Upper Bounds on Boolean-Width with Applications to Exact Algorithms. IPEC (2013)
Rémy Belmonte, Martin Vatshelle
Graph classes with structured neighborhoods and algorithmic applications. Theor. Comput. Sci. 511 (2013)
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)
Therese C. Biedl, Martin Vatshelle
The point-set embeddability problem for plane graphs. SCG (2012)
Rémy Belmonte, Martin Vatshelle
Graph Classes with Structured Neighborhoods and Algorithmic Applications. WG (2011)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
Boolean-width of graphs. Theor. Comput. Sci. 412 (39) (2011)
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 (2011)
Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle, Martin Vatshelle
Finding Good Decompositions for Dynamic Programming on Dense Graphs. IPEC (2011)
Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle
Faster Algorithms on Branch and Clique Decompositions. MFCS (2010)
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)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discret. Appl. Math. 158 (7) (2010)
Rémy Belmonte, Martin Vatshelle
On graph classes with logarithmic boolean-width CoRR (2010)
Daniel Meister, Jan Arne Telle, Martin Vatshelle
Recognizing digraphs of Kelly-width 2. Discret. Appl. Math. 158 (7) (2010)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions CoRR (2009)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
Feedback Vertex Set on Graphs of Low Cliquewidth. IWOCA (2009)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
Boolean-Width of Graphs. IWPEC (2009)
Daniel Meister, Jan Arne Telle, Martin Vatshelle
Characterization and Recognition of Digraphs of Bounded Kelly-width. WG (2007)