The following pages link to Ignasi Sau (Q284715):
Displaying 50 items.
- A New Intersection Model and Improved Algorithms for Tolerance Graphs (Q3058531) (← links)
- On Approximating the d-Girth of a Graph (Q3075539) (← links)
- Traffic grooming in bidirectional WDM ring networks (Q3113504) (← links)
- The recognition of tolerance and bounded tolerance graphs. (Q3113782) (← links)
- The Recognition of Tolerance and Bounded Tolerance Graphs (Q3115865) (← links)
- A Polynomial-Time Algorithm for Outerplanar Diameter Improvement (Q3194712) (← links)
- Explicit Linear Kernels via Dynamic Programming (Q3195132) (← links)
- Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs (Q3225135) (← links)
- Traffic Grooming: Combinatorial Results and Practical Resolutions (Q3404459) (← links)
- Permutation Routing and (ℓ, k)-Routing on Plane Grids (Q3404473) (← links)
- Designing Hypergraph Layouts to GMPLS Routing Strategies (Q3408160) (← links)
- Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem (Q3503575) (← links)
- Traffic Grooming in Star Networks via Matching Techniques (Q3569115) (← links)
- Faster Parameterized Algorithms for Minor Containment (Q3569902) (← links)
- (Q3575430) (← links)
- Fast Minor Testing in Planar Graphs (Q3586454) (← links)
- Dynamic Programming for Graphs on Surfaces (Q3587392) (← links)
- Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests (Q3587450) (← links)
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
- Edge-Simple Circuits through 10 Ordered Vertices in Square Grids (Q3651541) (← links)
- (Q4558957) (← links)
- (Q4560237) (← links)
- Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions (Q4962217) (← links)
- A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth (Q5009462) (← links)
- Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel (Q5048303) (← links)
- (Q5089236) (← links)
- A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. (Q5089241) (← links)
- Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs (Q5089257) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
- (Q5111862) (← links)
- (Q5111863) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary (Q5146828) (← links)
- Parameterized Domination in Circle Graphs (Q5200517) (← links)
- Upper bounds on the uniquely restricted chromatic index (Q5229533) (← links)
- Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph (Q5302064) (← links)
- Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism (Q5363762) (← links)
- A Tight Erdös--Pósa Function for Wheel Minors (Q5374439) (← links)
- Hardness and Approximation of Traffic Grooming (Q5387787) (← links)
- Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4 (Q5392901) (← links)
- Dynamic programming for graphs on surfaces (Q5501962) (← links)
- Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph (Q5851110) (← links)
- A New Intersection Model and Improved Algorithms for Tolerance Graphs (Q5851113) (← links)
- Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization (Q5875553) (← links)
- Hitting and Harvesting Pumpkins (Q5892008) (← links)
- On the number of labeled graphs of bounded treewidth (Q5915790) (← links)
- Ruling out FPT algorithms for weighted coloring on forests (Q5916046) (← links)
- On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
- On the complexity of finding large odd induced subgraphs and odd colorings (Q5918590) (← links)
