SIAM Journal on Algebraic and Discrete Methods

Complexity of Finding Embeddings in a <i>k</i>-Tree

Stefan Arnborg, Derek G. Corneil, Andrzej Proskurowski · 1987 · 1.2K citations

Computing, Computer Science, Mathematics +15

Computing the Minimum Fill-In is NP-Complete

Mihalis Yannakakis · 1981 · 709 citations

Computing, Computer Science, Mathematics +11

Crossing Number is NP-Complete

M. R. Garey, David S. Johnson · 1983 · 669 citations

Computing, Computer Science, Mathematics +17

Amortized Computational Complexity

Robert E. Tarjan · 1985 · 525 citations

Computing, Computer Science, Algorithms +16

Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property

Richard P. Stanley · 1980 · 450 citations

Natural Sciences, Mathematics, Combinatorics +9