Pages that link to "Item:Q2464326"
From MaRDI portal
The following pages link to The linear arrangement problem parameterized above guaranteed value (Q2464326):
Displayed 21 items.
- A faster fixed parameter algorithm for two-layer crossing minimization (Q284334) (← links)
- Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value'' (Q385510) (← links)
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- On a binary distance model for the minimum linear arrangement problem (Q458974) (← 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)
- Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
- Fixed-parameter complexity of minimum profile problems (Q958202) (← links)
- Minimum leaf out-branching and related problems (Q1035689) (← links)
- The \(S\)-\textsc{labeling} problem: an algorithmic tour (Q1647835) (← links)
- Note on maximal bisection above tight lower bound (Q1675768) (← links)
- Betweenness parameterized above tight lower bound (Q1959433) (← links)
- Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment (Q2283027) (← links)
- Parameterized and approximation algorithms for the load coloring problem (Q2408202) (← links)
- Minimum Leaf Out-Branching Problems (Q3511432) (← links)
- A Probabilistic Approach to Problems Parameterized above or below Tight Bounds (Q3656865) (← links)
- (Q5075790) (← links)
- (Q5092402) (← links)
- Going Far from Degeneracy (Q5130907) (← links)
- Detours in directed graphs (Q6113279) (← links)