A Combinatorial Theorem on Circulant Matrices

Parallel program schemata

Richard M. Karp, Raymond E. Miller · Journal of Computer and System Sciences · 1969 · 984 citations

Crossing Number is NP-Complete

M. R. Garey, David S. Johnson · SIAM Journal on Algebraic and Discrete Methods · 1983 · 669 citations

Computing, Computer Science, Mathematics +17

An Algorithm for the General Petri Net Reachability Problem

Ernst Mayr · SIAM Journal on Computing · 1984 · 457 citations

Computing, Computer Science, Algorithms +14

On the reachability problem for 5-dimensional vector addition systems

John E. Hopcroft, Jean‐Jacques Pansiot · Theoretical Computer Science · 1979 · 286 citations

Natural Sciences, Computer Science, Mathematics +4

Comparison of labeled trees with valency three

D. F. Robinson · Journal of Combinatorial Theory Series B · 1971 · 233 citations

Natural Resources, Forestry, Data Structures +2