Optimization for first order Delaunay triangulations

Graph minors. II. Algorithmic aspects of tree-width

Neil Robertson, Paul Seymour · Journal of Algorithms · 1986 · 1.5K citations

Computing, Computer Science, Mathematics +14

Handbook of discrete and computational geometry

Choice Reviews Online · 1998 · 1.5K citations · Full text

Natural Sciences, Computer Science, Mathematics +12

A partial k-arboretum of graphs with bounded treewidth

Hans L. Bodlaender · Theoretical Computer Science · 1998 · 1.1K citations · Full text

Natural Sciences, Mathematics, Combinatorics +6

Approximation algorithms for NP-complete problems on planar graphs

Brenda S. Baker · Journal of the ACM · 1994 · 973 citations · Full text

Computing, Computer Science, Mathematics +15

A linear-time algorithm for testing the truth of certain quantified boolean formulas

Bengt Aspvall, Michael F. Plass, Robert E. Tarjan · Information Processing Letters · 1979 · 901 citations

Computing, Computer Science, Mathematics +14