Martin Vatshelle

According to our database1, Martin Vatshelle
  • authored at least 31 papers between 2007 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
An algorithm for the maximum weight independent set problem on outerstring graphs.
Comput. Geom., 2017

2016
Hardness of computing width parameters based on branch decompositions over the vertex set.
Theor. Comput. Sci., 2016

2015
Solving #SAT and MAXSAT by Dynamic Programming.
J. Artif. Intell. Res., 2015

Hardness of computing width parameters based on branch decompositions over the vertex set.
Electronic Notes in Discrete Mathematics, 2015

Constructions of k-critical P5-free graphs.
Discrete Applied Mathematics, 2015

An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Faster algorithms for vertex partitioning problems parameterized by clique-width.
Theor. Comput. Sci., 2014

Solving MaxSAT and #SAT on structured CNF formulas.
CoRR, 2014

Independent Set in P5-Free Graphs in Polynomial Time.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Solving MaxSAT and #SAT on Structured CNF Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

2013
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems.
Theor. Comput. Sci., 2013

Graph classes with structured neighborhoods and algorithmic applications.
Theor. Comput. Sci., 2013

The Point-Set Embeddability Problem for Plane graphs.
Int. J. Comput. Geometry Appl., 2013

Feedback vertex set on graphs of low clique-width.
Eur. J. Comb., 2013

Faster Algorithms Parameterized by Clique-width.
CoRR, 2013

Upper Bounds on Boolean-Width with Applications to Exact Algorithms.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

2012
k-Gap Interval Graphs.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

The point-set embeddability problem for plane graphs.
Proceedings of the Symposuim on Computational Geometry 2012, 2012

2011
Boolean-width of graphs.
Theor. Comput. Sci., 2011

k-Gap Interval Graphs
CoRR, 2011

Graph Classes with Structured Neighborhoods and Algorithmic Applications.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Finding Good Decompositions for Dynamic Programming on Dense Graphs.
Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

2010
Recognizing digraphs of Kelly-width 2.
Discrete Applied Mathematics, 2010

H-join decomposable graphs and algorithms with runtime single exponential in rankwidth.
Discrete Applied Mathematics, 2010

On graph classes with logarithmic boolean-width
CoRR, 2010

On the Boolean-Width of a Graph: Structure and Applications.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Faster Algorithms on Branch and Clique Decompositions.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009
Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions
CoRR, 2009

Boolean-Width of Graphs.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Feedback Vertex Set on Graphs of Low Cliquewidth.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2007
Characterization and Recognition of Digraphs of Bounded Kelly-width.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007


  Loading...