11 results on '"Sau, Ignasi"'
Search Results
2. Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
3. Weighted proper orientations of trees and graphs of bounded treewidth
4. On the (parameterized) complexity of recognizing well-covered (r,ℓ)-graph
5. Ruling out FPT algorithms for Weighted Coloring on forests
6. Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
7. On the complexity of computing the k-restricted edge-connectivity of a graph
8. The role of planarity in connectivity problems parameterized by treewidth
9. GMPLS label space minimization through hypergraph layouts
10. Faster parameterized algorithms for minor containment
11. Hardness and approximation of traffic grooming
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.