Pages that link to "Item:Q456704"
From MaRDI portal
The following pages link to On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704):
Displaying 9 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph (Q477619) (← links)
- Directed elimination games (Q896668) (← links)
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- (Q5005146) (← links)
- (Q5092387) (← links)
- Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems (Q6040633) (← links)
