Pages that link to "Item:Q3452864"
From MaRDI portal
The following pages link to Mixing Color Coding-Related Techniques (Q3452864):
Displaying 28 items.
- A randomized algorithm for long directed cycle (Q264199) (← links)
- Parameterized approximation algorithms for packing problems (Q313963) (← links)
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Representative families: a unified tradeoff-based approach (Q899582) (← links)
- A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
- Parameterized algorithms and kernels for rainbow matching (Q1739114) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- Long directed \((s,t)\)-path: FPT algorithm (Q1799598) (← links)
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778) (← links)
- Representative families for matroid intersections, with applications to location, packing, and covering problems (Q2028091) (← links)
- A note on algebraic techniques for subgraph detection (Q2122786) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Faster deterministic parameterized algorithm for \(k\)-path (Q2272387) (← links)
- Two edge-disjoint paths with length constraints (Q2330117) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Narrow sieves for parameterized paths and packings (Q2396725) (← links)
- Discriminantal subset convolution: refining exterior-algebraic methods for parameterized algorithms (Q2672945) (← links)
- Finding Two Edge-Disjoint Paths with Length Constraints (Q3181047) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
- A Multivariate Approach for Weighted FPT Algorithms (Q3452855) (← links)
- Mixing Color Coding-Related Techniques (Q3452864) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
- Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices (Q5042455) (← links)
- (Q5075762) (← links)
- (Q5091007) (← links)
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space (Q5091173) (← links)
- Parameterized Algorithms and Kernels for Rainbow Matching (Q5111288) (← links)
