Pages that link to "Item:Q733736"

The following pages link to The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736):

Displaying 12 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)