Algorithmica · 2012 · 56 citations · 26 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsTheory Of ComputationApproximation AlgorithmsGeometric ApproximationGraph AlgorithmsGraph TheoryApproximation SchemesComputational Complexity Of Graph AlgorithmsConnectivity AlgorithmsPolynomial-time Approximation Scheme
26
Graph minors. II. Algorithmic aspects of tree-width
Neil Robertson, Paul Seymour · Journal of Algorithms · 1986 · 1.5K citations
Approximation algorithms for NP-complete problems on planar graphs
Brenda S. Baker · Journal of the ACM · 1994 · 973 citations · Full text
Faster Shortest-Path Algorithms for Planar Graphs
Monika Henzinger, Philip N. Klein, Satish Rao et al. · Journal of Computer and System Sciences · 1997 · 410 citations · Full text