13 results on '"Sau, Ignasi"'
Search Results
2. Introducing lop-Kernels: A Framework for Kernelization Lower Bounds
3. On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings
4. Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
5. Dual Parameterization of Weighted Coloring
6. On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths
7. How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?
8. Explicit Linear Kernels for Packing Problems
9. An O(logOPT)θr-Approximation for Covering and Packing Minor Models of O(logOPT)θr
10. Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion
11. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
12. An FPT 2-Approximation for Tree-Cut Decomposition
13. Parameterized Domination in Circle Graphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.