10 results on '"Baste, Julien"'
Search Results
2. A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
3. Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies
4. Minimum Reload Cost Graph Factors
5. Uniquely Restricted Matchings and Edge Colorings
6. On the Number of Labeled Graphs of Bounded Treewidth
7. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
8. The Role of Planarity in Connectivity Problems Parameterized by Treewidth
9. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.
10. 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.