Pages that link to "Item:Q733736"
From MaRDI portal
The following pages link to The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736):
Displayed 27 items.
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
- Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
- Dominating complex networks by identifying minimum skeletons (Q1694056) (← links)
- Algorithmic meta-theorems for restrictions of treewidth (Q1759681) (← links)
- The parameterized complexity of some minimum label problems (Q1959420) (← links)
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- Data Reduction for Graph Coloring Problems (Q3088272) (← links)
- Bivariate Complexity Analysis of Almost Forest Deletion (Q3196379) (← links)
- On the analysis of the (1+1) evolutionary algorithm for the maximum leaf spanning tree problem (Q3451414) (← links)
- Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
- Robust Connectivity of Graphs on Surfaces (Q5084099) (← links)
- The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6039422) (← links)
- Bounds and algorithms for geodetic hulls (Q6102275) (← links)
- Packing arc-disjoint cycles in oriented graphs (Q6126480) (← links)
- Monitoring edge-geodetic sets in graphs (Q6132539) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)