Pages that link to "Item:Q1041711"

The following pages link to A faster parameterized algorithm for set packing (Q1041711):

Displaying 13 items.

• Parameterized approximation algorithms for packing problems (Q313963) (← links)
• Improved deterministic algorithms for weighted matching and packing problems (Q534565) (← links)
• An improved kernelization algorithm for \(r\)-set packing (Q765496) (← links)
• Algorithm engineering for color-coding with applications to signaling pathway detection (Q958201) (← links)
• Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
• On counting 3-D matchings of size \(k\) (Q1040648) (← links)
• Maximum disjoint paths on edge-colored graphs: approximability and tractability (Q1736537) (← links)
• Kernels for packing and covering problems (Q2272393) (← links)
• Narrow sieves for parameterized paths and packings (Q2396725) (← links)
• An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem (Q2430016) (← links)
• Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets (Q3195130) (← links)
• Mixing Color Coding-Related Techniques (Q3452864) (← links)
• The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)