Search

Your search keyword '"BASTE, JULIEN"' showing total 8 results

Search Constraints

Start Over You searched for: Author "BASTE, JULIEN" Remove constraint Author: "BASTE, JULIEN" Topic computer science - computational complexity Remove constraint Topic: computer science - computational complexity
8 results on '"BASTE, JULIEN"'

Search Results

1. Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms

2. Hitting minors on bounded treewidth graphs. IV. An optimal algorithm

3. Minimum Reload Cost Graph Factors

4. Hitting minors on bounded treewidth graphs. I. General upper bounds

5. Ruling out FPT algorithms for Weighted Coloring on forests

6. Parameterized complexity of finding a spanning tree with minimum reload cost diameter

7. Parameterized complexity dichotomy for $(r,\ell)$-Vertex Deletion

8. Parameterized complexity dichotomy for $(r,\ell)$-Vertex Deletion

Catalog

Books, media, physical & digital resources