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
26
click to vote
STACS
2016
Springer
favorite
Email
discuss
report
53
views
Theoretical Computer Science
»
more
STACS 2016
»
Polynomial Kernels for Deletion to Classes of Acyclic Digraphs
8 years 4 months ago
Download
drops.dagstuhl.de
Matthias Mnich, Erik Jan van Leeuwen
Real-time Traffic
STACS 2016
|
Theoretical Computer Science
|
claim paper
Related Content
»
On Making Directed Graphs Transitive
»
On the Directed DegreePreserving Spanning Tree Problem
»
On the directed Full Degree Spanning Tree problem
»
Kernels for Feedback Arc Set In Tournaments
»
Satisfiability Allows No Nontrivial Sparsification Unless The PolynomialTime Hierarchy Col...
»
Compression via matroids a randomized polynomial kernel for odd cycle transversal
more »
Post Info
More Details (n/a)
Added
10 Apr 2016
Updated
10 Apr 2016
Type
Journal
Year
2016
Where
STACS
Authors
Matthias Mnich, Erik Jan van Leeuwen
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision