Journal of Algorithms · 1998 · 317 citations · 35 references
ComputingComputer ScienceMathematicsAlgorithmsDiscrete MathematicsTheory Of ComputationApproximation AlgorithmsComputational ComplexityGraph AlgorithmsRandomized Geometric AlgorithmsApproximation ComplexityApproximation SchemesDiscrete Approximation SchemesExact AlgorithmsGraph Problems In Nc
35
V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 17K citations
Brent N. Clark, Charles J. Colbourn, David Johnson · Discrete Mathematics · 1990 · 1.4K citations
A Separator Theorem for Planar Graphs
Richard J. Lipton, Robert E. Tarjan · SIAM Journal on Applied Mathematics · 1979 · 1.4K citations
Frequency assignment: Theory and applications
William K. Hale · Proceedings of the IEEE · 1980 · 1.3K citations
Approximation algorithms for NP-complete problems on planar graphs
Brenda S. Baker · Journal of the ACM · 1994 · 973 citations · Full text