64 results on '"Sau, Ignasi"'
Search Results
2. Complexity Dichotomies for the Minimum -Overlay Problem
3. On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths
4. On the Number of Labeled Graphs of Bounded Treewidth
5. Uniquely Restricted Matchings and Edge Colorings
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. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
9. On the (Parameterized) Complexity of Recognizing Well-Covered -graphs
10. An FPT 2-Approximation for Tree-cut Decomposition
11. An
12. A Polynomial-Time Algorithm for Outerplanar Diameter Improvement
13. The Role of Planarity in Connectivity Problems Parameterized by Treewidth
14. Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs
15. Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions
16. Parameterized Domination in Circle Graphs
17. Dynamic Programming for H-minor-free Graphs
18. Hitting and Harvesting Pumpkins
19. On Approximating the d-Girth of a Graph
20. Permutation Routing and (ℓ, k)-Routing on Plane Grids
21. Traffic Grooming: Combinatorial Results and Practical Resolutions
22. Fast Minor Testing in Planar Graphs
23. Dynamic Programming for Graphs on Surfaces
24. Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
25. Faster Parameterized Algorithms for Minor Containment
26. Traffic Grooming in Star Networks via Matching Techniques
27. Designing Hypergraph Layouts to GMPLS Routing Strategies
28. A New Intersection Model and Improved Algorithms for Tolerance Graphs
29. Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph
30. Edge-Simple Circuits through 10 Ordered Vertices in Square Grids
31. MPLS Label Stacking on the Line Network
32. Degree-Constrained Subgraph Problems: Hardness and Approximation Results
33. Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph
34. Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
35. Hardness and Approximation of Traffic Grooming
36. A Turing Kernelization Dichotomy for Structural Parameterizations of -Minor-Free Deletion
37. Fast Breadth-First Search in Still Less Space
38. Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts
39. Local Approximation of the Maximum Cut in Regular Graphs
40. The 4-Steiner Root Problem
41. Maximum Independent Sets in Subcubic Graphs: New Results
42. Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs
43. Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs
44. Color Refinement, Homomorphisms, and Hypergraphs
45. Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs
46. 3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes
47. Hamiltonicity Below Dirac’s Condition
48. The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms
49. Maximum Matchings and Minimum Blocking Sets in -Graphs
50. A Polynomial-Time Algorithm for the Independent Set Problem in -Free 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.