Martin Vatshelle

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