scientific article; zbMATH DE number 5604125

zbMATH Open1169.68428MaRDI QIDQ3396009FDOQ3396009

Authors: Jörg Flum, Martin Grohe 

Publication date: 15 September 2009

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (11)

• Searching the \(k\)-change neighborhood for TSP is W[1]-hard
• Backdoor DNFs
• The parameterized complexity of stabbing rectangles
• Incremental list coloring of graphs, parameterized by conservation
• Parameterized graph separation problems
• On miniaturized problems in parameterized complexity theory
• Parameterized coloring problems on chordal graphs
• Analysis parameterized algorithms on the bases of elasticity to functions complexity
• Confronting intractability via parameters
• Backdoor sets for DLL subsolvers
• Parameterized complexity and subexponential-time computability

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3396009)