63 results on '"Sau, Ignasi"'
Search Results
2. On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings
3. Complexity Dichotomies for the Minimum $$\mathcal {F}$$-Overlay Problem
4. On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths
5. Uniquely Restricted Matchings and Edge Colorings
6. On the Number of Labeled Graphs of Bounded Treewidth
7. On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs
8. Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability
9. On the Complexity of Computing the k-restricted Edge-connectivity of a Graph
10. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
11. An FPT 2-Approximation for Tree-cut Decomposition
12. An $$O(\log \mathrm{OPT})$$ O ( log OPT ) -Approximation for Covering/Packing Minor Models of $$\theta _{r}$$ θ r
13. A Polynomial-Time Algorithm for Outerplanar Diameter Improvement
14. Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs
15. The Role of Planarity in Connectivity Problems Parameterized by Treewidth
16. Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions
17. Dynamic Programming for H-minor-free Graphs
18. Parameterized Domination in Circle Graphs
19. On Approximating the d-Girth of a Graph
20. Hitting and Harvesting Pumpkins
21. Traffic Grooming in Star Networks via Matching Techniques
22. Faster Parameterized Algorithms for Minor Containment
23. Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph
24. Designing Hypergraph Layouts to GMPLS Routing Strategies
25. Dynamic Programming for Graphs on Surfaces
26. A New Intersection Model and Improved Algorithms for Tolerance Graphs
27. Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
28. Fast Minor Testing in Planar Graphs
29. Permutation Routing and (ℓ, k)-Routing on Plane Grids
30. Traffic Grooming: Combinatorial Results and Practical Resolutions
31. MPLS Label Stacking on the Line Network
32. Degree-Constrained Subgraph Problems: Hardness and Approximation Results
33. Edge-Simple Circuits through 10 Ordered Vertices in Square Grids
34. Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph
35. Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
36. Hardness and Approximation of Traffic Grooming
37. Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability.
38. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.
39. On the (Parameterized) Complexity of Recognizing Well-Covered $$(R,\ELL )$$ -graphs.
40. On the Complexity of Computing the k-restricted Edge-connectivity of a Graph.
41. An $$O(\LOG \MATHRM{OPT})$$ O ( log OPT ) -Approximation for Covering/Packing Minor Models of $$\THETA _{R}$$ θ r.
42. An FPT 2-Approximation for Tree-cut Decomposition.
43. Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs.
44. The Role of Planarity in Connectivity Problems Parameterized by Treewidth.
45. Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions.
46. Parameterized Domination in Circle Graphs.
47. On Approximating the d-Girth of a Graph.
48. Fast Minor Testing in Planar Graphs.
49. Dynamic Programming for Graphs on Surfaces.
50. Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.