The following pages link to (Q5092393):
Displaying 5 items.
- Colored cut games (Q2087453) (← links)
- Faster algorithm for pathwidth one vertex deletion (Q2140570) (← links)
- An \(O^\ast ( 2 . 61 9^k )\) algorithm for \textsc{4-path vertex cover} (Q2659056) (← links)
- Faster parameterized algorithms for two vertex deletion problems (Q2699960) (← links)
- Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)
