Pages that link to "Item:Q2380001"
From MaRDI portal
The following pages link to Parameterized complexity of the induced subgraph problem in directed graphs (Q2380001):
Displaying 7 items.
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs (Q259037) (← links)
- Parameterized complexity of finding connected induced subgraphs (Q897959) (← links)
- Possible winner problems on partial tournaments: a parameterized study (Q2359793) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- The Parameterized Complexity of k-Edge Induced Subgraphs (Q2843289) (← links)
- Directed acyclic subgraph problem parameterized above the Poljak-Turzík bound (Q2957516) (← links)
- Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)