Pages that link to "Item:Q2908541"

The following pages link to Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541):

Displaying 13 items.

• Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
• Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
• Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)
• Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations (Q2947879) (← links)
• The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments (Q4632200) (← links)
• (Q4993600) (← links)
• A Retrospective on (Meta) Kernelization (Q5042460) (← links)
• Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5136332) (← links)
• Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
• Parameterized Traveling Salesman Problem: Beating the Average (Q5743554) (← links)
• The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)
• Perfect forests in graphs and their extensions (Q6057643) (← links)