scientific article; zbMATH DE number 5604125
From MaRDI portal
Publication:3396009
Cited in
(11)- Incremental list coloring of graphs, parameterized by conservation
- Confronting intractability via parameters
- On miniaturized problems in parameterized complexity theory
- Searching the \(k\)-change neighborhood for TSP is W[1]-hard
- Analysis parameterized algorithms on the bases of elasticity to functions complexity
- Parameterized coloring problems on chordal graphs
- Parameterized complexity and subexponential-time computability
- Backdoor sets for DLL subsolvers
- Backdoor DNFs
- Parameterized graph separation problems
- The parameterized complexity of stabbing rectangles
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)
