Pages that link to "Item:Q5311506"
From MaRDI portal
The following pages link to Parameterized and Exact Computation (Q5311506):
Displaying 21 items.
- Confronting intractability via parameters (Q465686) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
- Parameterized algorithms for weighted matching and packing problems (Q955335) (← links)
- Algorithm engineering for color-coding with applications to signaling pathway detection (Q958201) (← links)
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← 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)
- Towards optimal kernel for edge-disjoint triangle packing (Q2446590) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- Edge-disjoint packing of stars and cycles (Q2629232) (← links)
- Parameterized counting matching and packing: a family of hard problems that admit FPTRAS (Q2636502) (← links)
- An improved kernel for planar vertex-disjoint triangle packing (Q2672577) (← links)
- Edge-Disjoint Packing of Stars and Cycles (Q3467879) (← links)
- (Q4415391) (← links)
- On Counting Parameterized Matching and Packing (Q4632178) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710805) (← links)
- (Q5743378) (← links)
- Kernelization for edge triangle packing and covering via a discharging method (Q6558639) (← links)
- A discharging method: improved kernels for edge triangle packing and covering (Q6591629) (← links)
