Digraph measures: Kelly decompositions, games, and orderings

Approximation algorithms for NP-complete problems on planar graphs

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

Upper bounds to the clique width of graphs

Bruno Courcelle, Stephan Olariu · Discrete Applied Mathematics · 2000 · 624 citations

Clique Width, Network Science, Graph Theory +8

The Role of Elimination Trees in Sparse Factorization

Joseph W. H. Liu · SIAM Journal on Matrix Analysis and Applications · 1990 · 520 citations

Computational Science, Sparse Representation, Engineering +14

Approximating clique-width and branch-width

Sang‐il Oum, Paul Seymour · Journal of Combinatorial Theory Series B · 2006 · 497 citations

Mathematical Programming, Branch-and-bound Algorithm, Engineering +7

Triangulated graphs and the elimination process

Donald J. Rose · Journal of Mathematical Analysis and Applications · 1970 · 494 citations

Geometric Graph Theory, Graph Theory, Planar Graph +6