18 results on '"Baste, Julien"'
Search Results
2. Γ-Clustering Problems: Classical and Parametrized Complexity
3. Acyclic matchings in graphs of bounded maximum degree
4. Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory
5. An Fpt Algorithm for Node-Disjoint Subtrees Problems Parameterized by Treewidth
6. Bounding and approximating minimum maximal matchings in regular graphs
7. Linear programming based approximation for unweighted induced matchings—Breaking the Δ barrier
8. Domination versus edge domination
9. Hitting minors on bounded treewidth graphs. III. Lower bounds
10. Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
11. Temporal matching
12. Approximating maximum uniquely restricted matchings in bipartite graphs
13. On the number of labeled graphs of bounded treewidth
14. Ruling out FPT algorithms for Weighted Coloring on forests
15. Degenerate matchings and edge colorings
16. Ruling out FPT algorithms for Weighted Coloring on forests
17. On the parameterized complexity of the Edge Monitoring problem
18. The role of planarity in connectivity problems parameterized by treewidth
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.