scientific article; zbMATH DE number 2080999
From MaRDI portal
Publication:4474097
zbMath1077.68651MaRDI QIDQ4474097
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2223/22230291.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (11)
A fixed-parameter algorithm for minimum quartet inconsistency ⋮ Graph separators: A parameterized view ⋮ Computing the similarity of two sequences with nested arc annotations ⋮ FPT Suspects and Tough Customers: Open Problems of Downey and Fellows ⋮ Polynomial time approximation schemes and parameterized complexity ⋮ What Is Known About Vertex Cover Kernelization? ⋮ Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms ⋮ Confronting intractability via parameters ⋮ Sources of complexity in subset choice ⋮ Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs ⋮ Parameterized computation and complexity: a new approach dealing with NP-hardness
This page was built for publication:
