Parameterized Complexity

1999/01/01 by Rodney G. Downey, R. G. Downey, Michael R. Fellows +1 · 13 citations
Chemistry · Mathematics · #Combinatorics #Computer science #Genealogy #History #History and advancements in chemistry #Mathematics #Parameterized complexity

paper · doi:10.1007/978-1-4612-0515-9

crossref issued 1999/01/01 · crossref published 1999/01/01 · crossref published-print 1999/01/01 · openalex publication_date 1999/01/01 · crossref created 2011/08/11 · crossref deposited 2019/04/05 · openalex created_date 2025/10/10 · crossref indexed 2026/07/31 · openalex updated_date 2026/08/08

Cited by

• Vertex Cover: Further Observations and Further Improvements
• On problems without polynomial kernels
• A 4 k 2 kernel for feedback vertex set
• Approximating clique-width and branch-width
• Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
• New upper bounds on the decomposability of planar graphs
• Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions
• Graph separators: a parameterized view
• Max-Cut Parameterized Above the Edwards-Erdős Bound
• Satisfying more than half of a system of linear equations over GF(2): A multivariate approach
• Maximum balanced subgraph problem parameterized above lower bound
• Covering graphs with few complete bipartite subgraphs
• Kernelization [wikipedia]