The following pages link to Looking at the stars (Q820158):
Displaying 30 items.
- Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths (Q264204) (← links)
- Kernelization of the 3-path vertex cover problem (Q279214) (← links)
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
- Parameterized approximation algorithms for packing problems (Q313963) (← links)
- On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
- Matching and weighted \(P_2\)-packing: algorithms and kernels (Q393902) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- Algorithm engineering for color-coding with applications to signaling pathway detection (Q958201) (← links)
- An improved kernelization for \(P_{2}\)-packing (Q991748) (← links)
- Improved approximation algorithms for weighted 2-path partitions (Q1706113) (← links)
- On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062) (← links)
- A \(5k\)-vertex kernel for \(P_2\)-packing (Q2118855) (← links)
- Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems (Q2354298) (← links)
- Narrow sieves for parameterized paths and packings (Q2396725) (← links)
- Edge-disjoint packing of stars and cycles (Q2629232) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps (Q2828236) (← links)
- Kernelization Algorithms for Packing Problems Allowing Overlaps (Q2948487) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
- Improved Approximation Algorithms for Weighted 2-Path Partitions (Q3452854) (← links)
- Edge-Disjoint Packing of Stars and Cycles (Q3467879) (← links)
- A Problem Kernelization for Graph Packing (Q3599088) (← links)
- Arbitrary Overlap Constraints in Graph Packing Problems (Q4639933) (← links)
- (Q5743378) (← links)
- A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
