Looking at the stars
From MaRDI portal
Publication:820158
DOI10.1016/j.tcs.2005.10.009zbMath1087.68076OpenAlexW2152550583MaRDI QIDQ820158
Christian Sloper, Elena Prieto
Publication date: 6 April 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.009
Related Items
Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths ⋮ Kernelization of the 3-path vertex cover problem ⋮ Edge-disjoint packing of stars and cycles ⋮ An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs ⋮ Improved Approximation Algorithms for Weighted 2-Path Partitions ⋮ Parameterized approximation algorithms for packing problems ⋮ Almost Induced Matching: Linear Kernels and Parameterized Algorithms ⋮ Edge-Disjoint Packing of Stars and Cycles ⋮ On a generalization of Nemhauser and Trotter's local optimization theorem ⋮ Narrow sieves for parameterized paths and packings ⋮ Matching and weighted \(P_2\)-packing: algorithms and kernels ⋮ Kernelization Algorithms for Packing Problems Allowing Overlaps ⋮ A \(5k\)-vertex kernel for 3-path vertex cover ⋮ Improved approximation algorithms for weighted 2-path partitions ⋮ Parameterized algorithms and kernels for almost induced matching ⋮ Kernelization and Parameterized Algorithms for 3-Path Vertex Cover ⋮ A generalization of Nemhauser and Trotter's local optimization theorem ⋮ Parameterized complexity of induced graph matching on claw-free graphs ⋮ Arbitrary Overlap Constraints in Graph Packing Problems ⋮ Algorithm engineering for color-coding with applications to signaling pathway detection ⋮ Graph editing problems with extended regularity constraints ⋮ Kernels for packing and covering problems ⋮ A Problem Kernelization for Graph Packing ⋮ On maximum \(P_3\)-packing in claw-free subcubic graphs ⋮ Hitting Forbidden Minors: Approximation and Kernelization ⋮ An improved kernelization for \(P_{2}\)-packing ⋮ Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps ⋮ Unnamed Item ⋮ Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems ⋮ A \(5k\)-vertex kernel for \(P_2\)-packing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- Maximum bounded \(H\)-matching is Max SNP-complete
- On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
- Packings by Complete Bipartite Graphs
- Color-coding
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Looking at the stars
