38 results on '"BASTE, JULIEN"'
Search Results
2. An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth
3. Γ-Clustering Problems: Classical and Parametrized Complexity
4. A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
5. Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies
6. Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm
7. Minimum Reload Cost Graph Factors
8. Towards hybridization of multi-agent simulation and metaheuristics applied to selective deconstruction
9. Uniquely Restricted Matchings and Edge Colorings
10. On the Number of Labeled Graphs of Bounded Treewidth
11. Acyclic matchings in graphs of bounded maximum degree
12. Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree
13. Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory
14. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
15. Contraction Bidimensionality of Geometric Intersection Graphs
16. An Fpt Algorithm for Node-Disjoint Subtrees Problems Parameterized by Treewidth
17. The Role of Planarity in Connectivity Problems Parameterized by Treewidth
18. Bounding and approximating minimum maximal matchings in regular graphs
19. Minimum Reload Cost Graph Factors
20. Linear programming based approximation for unweighted induced matchings—Breaking the Δ barrier
21. Domination versus edge domination
22. Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory
23. Hitting minors on bounded treewidth graphs. III. Lower bounds
24. Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
25. Temporal matching
26. Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds
27. Parameterized complexity of finding a spanning tree with minimum reload cost diameter
28. FPT Algorithms for Diverse Collections of Hitting Sets
29. Approximating maximum uniquely restricted matchings in bipartite graphs
30. Upper bounds on the uniquely restricted chromatic index
31. On the number of labeled graphs of bounded treewidth
32. Ruling out FPT algorithms for Weighted Coloring on forests
33. Degenerate matchings and edge colorings
34. Ruling out FPT algorithms for Weighted Coloring on forests
35. On the parameterized complexity of the Edge Monitoring problem
36. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
37. Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion
38. 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.