15 results on '"BASTE, JULIEN"'
Search Results
2. An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth
3. Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory
4. Bounding and approximating minimum maximal matchings in regular graphs
5. Linear programming based approximation for unweighted induced matchings—Breaking the [formula omitted] barrier
6. Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
7. Temporal matching
8. Approximating maximum uniquely restricted matchings in bipartite graphs
9. Ruling out FPT algorithms for Weighted Coloring on forests
10. Degenerate matchings and edge colorings
11. The role of planarity in connectivity problems parameterized by treewidth
12. Acyclic matchings in graphs of bounded maximum degree
13. Domination versus edge domination
14. Ruling out FPT algorithms for Weighted Coloring on forests
15. On the parameterized complexity of the Edge Monitoring problem
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.