Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
31
click to vote
SOFSEM
2009
Springer
favorite
Email
discuss
report
106
views
Theoretical Computer Science
»
more
SOFSEM 2009
»
A Problem Kernelization for Graph Packing
14 years 5 months ago
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
more »
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)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision