scientific article; zbMATH DE number 5604125

MaRDI QIDQ3396009zbMATH OpenFDO

Authors Jörg Flum, Martin Grohe

Publication date 15 September 2009

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
• The parameterized complexity of stabbing rectangles
• Backdoor DNFs
• 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
• Confronting intractability via parameters
• Analysis parameterized algorithms on the bases of elasticity to functions complexity
• 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)