Pages that link to "Item:Q958209"
From MaRDI portal
The following pages link to Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209):
Displaying 27 items.
- Parameterized approximation algorithms for packing problems (Q313963) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- Improved deterministic algorithms for weighted matching and packing problems (Q534565) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- Parameterized algorithms for weighted matching and packing problems (Q955335) (← links)
- A faster parameterized algorithm for set packing (Q1041711) (← links)
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} (Q1679222) (← links)
- Maximum disjoint paths on edge-colored graphs: approximability and tractability (Q1736537) (← links)
- On the complexity of broadcast domination and multipacking In digraphs (Q1979448) (← links)
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
- Narrow sieves for parameterized paths and packings (Q2396725) (← links)
- The control complexity of \(r\)-Approval: from the single-peaked case to the general case (Q2402374) (← links)
- Edge-disjoint packing of stars and cycles (Q2629232) (← links)
- Complexity results for rainbow matchings (Q2637345) (← links)
- A dynamic programming algorithm for tree-like weighted set packing problem (Q2638196) (← links)
- Using parametric transformations toward polynomial kernels for packing problems allowing overlaps (Q2828236) (← links)
- Kernelization Algorithms for Packing Problems Allowing Overlaps (Q2948487) (← links)
- Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets (Q3195130) (← links)
- Mixing Color Coding-Related Techniques (Q3452864) (← links)
- Edge-Disjoint Packing of Stars and Cycles (Q3467879) (← links)
- A Problem Kernelization for Graph Packing (Q3599088) (← links)
- (Q5743378) (← links)
- (Q5743381) (← links)
- Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
- The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)
- Packing arc-disjoint cycles in oriented graphs (Q6126480) (← links)