A compact representation for permutation groups

Finite Permutation Groups.

Franklin Haimo, Helmut Wielandt · American Mathematical Monthly · 1966 · 1.7K citations

Data Structures and Algorithms

Niklaus Wirth · Scientific American · 1984 · 1.4K citations

Computing, Computer Science, Algorithms +9

The Transitive Reduction of a Directed Graph

Alfred V. Aho, M. R. Garey, Jeffrey D. Ullman · SIAM Journal on Computing · 1972 · 723 citations

Computing, Computer Science, Mathematics +15

Isomorphism of graphs of bounded valence can be tested in polynomial time

Eugene M. Luks · Journal of Computer and System Sciences · 1982 · 660 citations

Computing, Computer Science, Mathematics +11

Combinatorial algorithms

Gian‐Carlo Rota · Advances in Mathematics · 1976 · 286 citations