Pages that link to "Item:Q1003461"
From MaRDI portal
The following pages link to Parameterized algorithmics for linear arrangement problems (Q1003461):
Displaying 9 items.
- On a binary distance model for the minimum linear arrangement problem (Q458974) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- Parameterized algorithms for \(d\)-hitting set: the weighted case (Q964386) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- Minimum leaf out-branching and related problems (Q1035689) (← links)
- On an ordering problem in weighted hypergraphs (Q2115861) (← links)
- Faster deterministic algorithm for \textsc{Co-Path Set} (Q2680227) (← links)
- Smaller Kernels for Several FPT Problems Based on Simple Observations (Q3452562) (← links)
- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges (Q5041192) (← links)
