The following pages link to (Q5092394):
Displaying 7 items.
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- Parameterized Complexity of Fair Feedback Vertex Set Problem (Q5042245) (← links)
- Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5874480) (← links)
- Extended MSO model checking via small vertex integrity (Q6185940) (← links)
- Parameterized complexity of the \(\mathcal{T}_{h+1} \)-free edge deletion problem (Q6546594) (← links)