207 results on '"Sau, Ignasi"'
Search Results
2. Redicolouring digraphs: Directed treewidth and cycle-degeneracy
Catalog
Books, media, physical & digital resources
3. FPT algorithms for packing [formula omitted]-safe spanning rooted sub(di)graphs
4. Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets
5. Target set selection with maximum activation time
6. Reducing the vertex cover number via edge contractions
7. k-apices of minor-closed graph classes. I. Bounding the obstructions
8. Introducing lop-Kernels: A Framework for Kernelization Lower Bounds
9. A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps
10. Hitting forbidden induced subgraphs on bounded treewidth graphs
11. Reducing graph transversals via edge contractions
12. On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings
13. Target set selection with maximum activation time
14. Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
15. Hitting minors on bounded treewidth graphs. III. Lower bounds
16. Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
17. Dual Parameterization of Weighted Coloring
18. On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths
19. Counting Gallai 3-colorings of complete graphs
20. Approximating maximum uniquely restricted matchings in bipartite graphs
21. Adapting The Directed Grid Theorem into an FPT Algorithm
22. Weighted proper orientations of trees and graphs of bounded treewidth
23. A more accurate view of the Flat Wall Theorem.
24. On the (parameterized) complexity of recognizing well-covered (r,ℓ)-graph
25. Complexity dichotomies for the Minimum[formula omitted]-Overlay problem
26. Ruling out FPT algorithms for Weighted Coloring on forests
27. On the number of labeled graphs of bounded treewidth
28. Improved FPT algorithms for weighted independent set in bull-free graphs
29. How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?
30. Explicit Linear Kernels for Packing Problems
31. A polynomial-time algorithm for Outerplanar Diameter Improvement
32. Minors in graphs of large [formula omitted]-girth
33. Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
34. Parameterized algorithms for min-max multiway cut and list digraph homomorphism
35. On the complexity of computing the k-restricted edge-connectivity of a graph
36. A linear kernel for planar red–blue dominating set
37. An O(logOPT)θr-Approximation for Covering and Packing Minor Models of O(logOPT)θr
38. An edge variant of the Erdős–Pósa property
39. The role of planarity in connectivity problems parameterized by treewidth
40. Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion
41. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
42. Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes
43. An FPT 2-Approximation for Tree-Cut Decomposition
44. On approximating the [formula omitted]-girth of a graph
45. Asymptotic enumeration of non-crossing partitions on surfaces
46. HITTING MINORS ON BOUNDED TREEWIDTH GRAPHS. IV. AN OPTIMAL ALGORITHM.
47. On the approximability of some degree-constrained subgraph problems
48. GMPLS label space minimization through hypergraph layouts
49. Simpler multicoloring of triangle-free hexagonal graphs
50. Parameterized complexity of finding small degree-constrained subgraphs
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.