Pages that link to "Item:Q899582"
From MaRDI portal
The following pages link to Representative families: a unified tradeoff-based approach (Q899582):
Displayed 13 items.
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- Long directed \((s,t)\)-path: FPT algorithm (Q1799598) (← links)
- Revisiting the parameterized complexity of maximum-duo preservation string mapping (Q2210511) (← links)
- Faster deterministic parameterized algorithm for \(k\)-path (Q2272387) (← links)
- Two edge-disjoint paths with length constraints (Q2330117) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Finding Two Edge-Disjoint Paths with Length Constraints (Q3181047) (← links)
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space (Q5091173) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5136332) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
- On the complexity of finding internally vertex-disjoint long directed paths (Q5918120) (← links)
- Balanced substructures in bicolored graphs (Q6169522) (← links)