Pages that link to "Item:Q958202"
From MaRDI portal
The following pages link to Fixed-parameter complexity of minimum profile problems (Q958202):
Displaying 10 items.
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- A probabilistic approach to problems parameterized above or below tight bounds (Q632807) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- Note on Max Lin-2 above average (Q656604) (← links)
- Minimum leaf out-branching and related problems (Q1035689) (← links)
- Note on maximal bisection above tight lower bound (Q1675768) (← links)
- Betweenness parameterized above tight lower bound (Q1959433) (← links)
- Parameterized and approximation algorithms for the load coloring problem (Q2408202) (← links)
- Profile minimization on products of graphs (Q2495515) (← links)
- A Probabilistic Approach to Problems Parameterized above or below Tight Bounds (Q3656865) (← links)
