Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

98

Voted

SOFSEM
2009
Springer

106views Theoretical Computer Science» more SOFSEM 2009»

A Problem Kernelization for Graph Packing

15 years 9 months ago

A Problem Kernelization for Graph Packing

Download theinf1.informatik.uni-jena.de

Hannes Moser

Real-time Traffic

SOFSEM 2009 | Theoretical Computer Science |

claim paper

Related Content

» Kernelization of packing problems

» Linear Problem Kernels for NPHard Problems on Planar Graphs

» Faster FixedParameter Tractable Algorithms for Matching and Packing Problems

» Packing Edge Disjoint Triangles A Parameterized View

» Induced Packing of Odd Cycles in a Planar Graph

» Meta Kernelization

» Packing multiway cuts in capacitated graphs

» Jamming and Geometric Representations of Graphs

» Multidimensional Packing with Conflicts

Post Info
More Details (n/a)

Added	20 May 2010
Updated	20 May 2010
Type	Conference
Year	2009
Where	SOFSEM
Authors	Hannes Moser

Comments (0)