Drawing Clustered Graphs on an Orthogonal Grid

On visual formalisms

David Harel · Communications of the ACM · 1988 · 1.3K citations · Full text

Architecture, Computer Science, Systems Engineering +16

Fast Algorithms for Finding Nearest Common Ancestors

Dov Harel, Robert E. Tarjan · SIAM Journal on Computing · 1984 · 1.1K citations

Computing, Computer Science, Algorithms +7

On Embedding a Graph in the Grid with the Minimum Number of Bends

Roberto Tamassia · SIAM Journal on Computing · 1987 · 540 citations

Computing, Computer Science, Electrical Engineering +15

On Finding Lowest Common Ancestors: Simplification and Parallelization

Baruch Schieber, Uzi Vishkin · SIAM Journal on Computing · 1988 · 535 citations

Computing, Computer Science, Algorithms +11

Universality considerations in VLSI circuits

Leslie G. Valiant · IEEE Transactions on Computers · 1981 · 393 citations

Engineering, Computer Engineering, Computer Science +11