Sciweavers

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

114

Voted

STACS
2016
Springer

53views Theoretical Computer Science» more STACS 2016»

Polynomial Kernels for Deletion to Classes of Acyclic Digraphs

9 years 10 months ago

Polynomial Kernels for Deletion to Classes of Acyclic Digraphs

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

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)