The following pages link to Ignasi Sau (Q284715):
Displaying 50 items.
- An edge variant of the Erdős-Pósa property (Q284717) (← links)
- On self-duality of branchwidth in graphs of bounded genus (Q411870) (← links)
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- GMPLS label space minimization through hypergraph layouts (Q442249) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666) (← links)
- On the parameterized complexity of the edge monitoring problem (Q509893) (← links)
- A linear kernel for planar red-blue dominating set (Q516887) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Simpler multicoloring of triangle-free hexagonal graphs (Q658035) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694) (← links)
- Complexity dichotomies for the minimum \(\mathcal{F}\)-overlay problem (Q1642689) (← links)
- Improved FPT algorithms for weighted independent set in bull-free graphs (Q1685998) (← links)
- Uniquely restricted matchings and edge colorings (Q1687907) (← links)
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem (Q1711667) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- Asymptotic enumeration of non-crossing partitions on surfaces (Q1939583) (← links)
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
- Reducing graph transversals via edge contractions (Q2037191) (← links)
- Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Adapting the directed grid theorem into an \textsf{FPT} algorithm (Q2132350) (← links)
- Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360) (← links)
- Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms (Q2304558) (← links)
- Counting Gallai 3-colorings of complete graphs (Q2312802) (← links)
- Approximating maximum uniquely restricted matchings in bipartite graphs (Q2322866) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617) (← links)
- Minors in graphs of large \(\theta_r\)-girth (Q2400974) (← links)
- A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) (← links)
- Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- On approximating the \(d\)-girth of a graph (Q2444552) (← links)
- The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)
- Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484) (← links)
- An $$O(\log \mathrm{OPT})$$ O ( log OPT ) -Approximation for Covering/Packing Minor Models of $$\theta _{r}$$ θ r (Q2788996) (← links)
- On the Complexity of Computing the k-restricted Edge-connectivity of a Graph (Q2827813) (← links)
- Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs (Q2839212) (← links)
- Dynamic Programming for H-minor-free Graphs (Q2914314) (← links)
- Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs (Q2946027) (← links)
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
- Explicit linear kernels via dynamic programming (Q2965494) (← links)
