The following pages link to Martin Vatshelle (Q322245):
Displaying 25 items.
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025) (← links)
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Recognizing digraphs of Kelly-width 2 (Q972333) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- Feedback vertex set on graphs of low clique-width (Q1933648) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- Upper Bounds on Boolean-Width with Applications to Exact Algorithms (Q2867092) (← links)
- The point-set embeddability problem for plane graphs (Q2874563) (← links)
- THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS (Q2875647) (← links)
- Finding Good Decompositions for Dynamic Programming on Dense Graphs (Q2891352) (← links)
- k-Gap Interval Graphs (Q2894479) (← links)
- On the Boolean-Width of a Graph: Structure and Applications (Q3057622) (← links)
- Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
- Solving MaxSAT and #SAT on Structured CNF Formulas (Q3192052) (← links)
- Solving #SAT and MAXSAT by Dynamic Programming (Q3196312) (← links)
- Characterization and Recognition of Digraphs of Bounded Kelly-width (Q3508574) (← links)
- Faster Algorithms on Branch and Clique Decompositions (Q3586082) (← links)
- Feedback Vertex Set on Graphs of Low Cliquewidth (Q3651539) (← links)
- Boolean-Width of Graphs (Q3656851) (← links)
- (Q5298910) (← links)
- Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time (Q5384003) (← links)
- Hardness of computing width parameters based on branch decompositions over the vertex set (Q5890909) (← links)
- Hardness of computing width parameters based on branch decompositions over the vertex set (Q5899662) (← links)
