The following pages link to (Q3396009):
Displaying 11 items.
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On miniaturized problems in parameterized complexity theory (Q820145) (← links)
- Parameterized graph separation problems (Q820151) (← links)
- Parameterized coloring problems on chordal graphs (Q820152) (← links)
- Backdoor sets for DLL subsolvers (Q862400) (← links)
- Searching the \(k\)-change neighborhood for TSP is W[1]-hard (Q924881) (← links)
- The parameterized complexity of stabbing rectangles (Q2428672) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
- (Q4966309) (← links)
- Backdoor DNFs (Q6564620) (← links)
