Pages that link to "Item:Q692894"
From MaRDI portal
The following pages link to Parameterizing by the number of numbers (Q692894):
Displaying 15 items.
- Polynomial kernels for weighted problems (Q340549) (← links)
- Approximating the multi-level bottleneck assignment problem (Q453052) (← links)
- Complexity of splits reconstruction for low-degree trees (Q476307) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- On explaining integer vectors by few homogeneous segments (Q2256725) (← links)
- Knapsack problems: a parameterized point of view (Q2419116) (← links)
- (Q3058697) (redirect page) (← links)
- Complexity of Splits Reconstruction for Low-Degree Trees (Q3104774) (← links)
- Parameterized complexity of min-power asymmetric connectivity (Q5918282) (← links)
- On data reduction for dynamic vector bin packing (Q6047700) (← links)
