The following pages link to (Q4217593):
Displaying 18 items.
- Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
- Machine-based methods in parameterized complexity theory (Q557897) (← links)
- W-hierarchies defined by symmetric gates (Q970108) (← links)
- The complexity of nonrepetitive coloring (Q1003751) (← links)
- Threshold dominating sets and an improved characterization of \(W[2]\) (Q1274918) (← links)
- On the complexity of database queries (Q1307689) (← links)
- Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733) (← links)
- FO model checking on geometric graphs (Q1631773) (← links)
- Describing parameterized complexity classes (Q1877556) (← links)
- An existential locality theorem (Q1887659) (← links)
- Parameterized Complexity (Q2841253) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- Surfing with Rod (Q2973715) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- On the Parameterized Complexity of Contraction to Generalization of Trees. (Q5111860) (← links)
- (Q5111878) (← links)
- (Q5136298) (← links)
- Enumeration for FO Queries over Nowhere Dense Graphs (Q5889796) (← links)
