Pages that link to "Item:Q2921430"

The following pages link to Representative Sets of Product Families (Q2921430):

Displaying 21 items.

• A randomized algorithm for long directed cycle (Q264199) (← links)
• Deterministic parameterized algorithms for the graph motif problem (Q313814) (← links)
• Parameterized approximation algorithms for packing problems (Q313963) (← links)
• Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430) (← links)
• Stable matching games: manipulation via subgraph isomorphism (Q722540) (← links)
• Representative families: a unified tradeoff-based approach (Q899582) (← links)
• Parameterized complexity of superstring problems (Q1679230) (← links)
• Clifford algebras meet tree decompositions (Q1725639) (← links)
• Long directed \((s,t)\)-path: FPT algorithm (Q1799598) (← links)
• On the complexity of algorithms for detecting \(k\)-length negative cost cycles (Q2051903) (← links)
• Parameterized algorithms for graph partitioning problems (Q2408556) (← links)
• Finding Two Edge-Disjoint Paths with Length Constraints (Q3181047) (← links)
• Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets (Q3195130) (← links)
• Spotting Trees with Few Leaves (Q3448789) (← links)
• Deterministic Truncation of Linear Matroids (Q3448849) (← links)
• Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints (Q3452817) (← links)
• Mixing Color Coding-Related Techniques (Q3452864) (← links)
• (Q5075762) (← links)
• Spotting Trees with Few Leaves (Q5346548) (← links)
• Linear representation of transversal matroids and gammoids parameterized by rank (Q5918110) (← links)
• The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)