The following pages link to (Q3012402):
Displaying 14 items.
- Complexity of secure sets (Q722534) (← links)
- On parameterized complexity of liquid democracy (Q831697) (← links)
- The balanced satisfactory partition problem (Q831826) (← links)
- Defensive alliances in graphs of bounded treewidth (Q1627877) (← links)
- Matchings with lower quotas: algorithms and complexity (Q1702126) (← links)
- On the harmless set problem parameterized by treewidth (Q2154099) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5874480) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
- Extended MSO model checking via small vertex integrity (Q6185940) (← links)
