The following pages link to Algorithms - ESA 2003 (Q5897291):
Displaying 14 items.
- On triangulating \(k\)-outerplanar graphs (Q479051) (← links)
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
- Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
- Computational study on a PTAS for planar dominating set problem (Q1736542) (← links)
- Improved bounds on the planar branchwidth with respect to the largest grid minor size (Q1934314) (← links)
- Branch decomposition heuristics for linear matroids (Q2445840) (← links)
- Planar branch decompositions. I: The ratcatcher (Q2892257) (← links)
- Planar branch decompositions. II: The cycle method (Q2892258) (← links)
- Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time (Q3652285) (← links)
- An analysis of heuristics for graph planarization (Q4354090) (← links)
- (Q4724430) (← links)
- Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs (Q5233518) (← links)
- Automata, Languages and Programming (Q5716790) (← links)
