scientific article
From MaRDI portal
Publication:2965491
DOI10.4230/LIPIcs.STACS.2014.288zbMath1359.68126arXiv1309.4022MaRDI QIDQ2965491
Michał Pilipczuk, Pål Grønås Drange, Yngve Villanger, Fedor V. Fomin
Publication date: 3 March 2017
Full work available at URL: https://arxiv.org/abs/1309.4022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Paths to Trees and Cacti ⋮ Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems ⋮ Paths to trees and cacti ⋮ Edge deletion problems: branching facilitated by modular decomposition ⋮ A polynomial kernel for trivially perfect editing ⋮ On the threshold of intractability ⋮ A Subexponential Parameterized Algorithm for Proper Interval Completion ⋮ Polynomial Kernelization for Removing Induced Claws and Diamonds
This page was built for publication:
