The following pages link to Call routing and the ratcatcher (Q1330799):
Displayed 16 items.
- Minor-Minimal Planar Graphs of Even Branch-Width (Q3068814) (← links)
- A Local Search Algorithm for Branchwidth (Q3075536) (← links)
- Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339) (← links)
- Connected Graph Searching in Outerplanar Graphs (Q3439336) (← links)
- Improved Induced Matchings in Sparse Graphs (Q3656857) (← links)
- Constructive linear time algorithms for branchwidth (Q4571992) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- The Effect of Planarization on Width (Q4625143) (← links)
- The Effect of Planarization on Width (Q4961755) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) (← links)
- Dynamic programming for graphs on surfaces (Q5501962) (← links)
- (Q5743390) (← links)
- (Q5743430) (← links)
- Hardness of computing width parameters based on branch decompositions over the vertex set (Q5890909) (← links)
- Hardness of computing width parameters based on branch decompositions over the vertex set (Q5899662) (← links)