The following pages link to (Q5743430):
Displaying 8 items.
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
- Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
- On orthogonally guarding orthogonal polygons with bounded treewidth (Q2659775) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time (Q3652285) (← links)
- (Q4273851) (← links)
- (Q5743430) (← links)