Pages that link to "Item:Q3177805"
From MaRDI portal
The following pages link to Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms (Q3177805):
Displaying 27 items.
- (Q5092396) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- Going Far from Degeneracy (Q5130907) (← links)
- Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth (Q5131225) (← links)
- Editing to Connected F-Degree Graph (Q5232130) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- (Q5874519) (← links)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
- Linear representation of transversal matroids and gammoids parameterized by rank (Q5918110) (← links)
- On the complexity of finding internally vertex-disjoint long directed paths (Q5918120) (← links)
- Parameterized complexity of conflict-free set cover (Q5918356) (← links)
- Fast exact algorithms for survivable network design with uniform requirements (Q5918784) (← links)
- Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
- Finding Temporal Paths Under Waiting Time Constraints. (Q6065432) (← links)
- Polynomial Kernel for Interval Vertex Deletion (Q6075746) (← links)
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs (Q6087215) (← links)
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
- Multistage \(s-t\) path: confronting similarity with dissimilarity (Q6107891) (← links)
- Detours in directed graphs (Q6113279) (← links)
- Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm (Q6115414) (← links)
- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space (Q6170447) (← links)
- Long directed detours: reduction to 2-disjoint paths (Q6551717) (← links)
- On kernels for \(d\)-path vertex cover (Q6564612) (← links)
- Approximating long cycle above Dirac's guarantee (Q6586667) (← links)
- A survey of cover-free families: constructions, applications, and generalizations (Q6613366) (← links)
- Computing paths of large rank in planar frameworks deterministically (Q6668350) (← links)
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard) (Q6670813) (← links)
