Volume 16, Issue 1 | Algorithmica

Search all Algorithmica articles

Volume 16, Issue 1

July 1996

Filter by

Volume:

Sort by

Date published:

New to old Old to new

7 articles in this issue

Guest editors' introduction
G. Di Battista
R. Tamassia
EditorialNotes Pages: 1 - 3
Drawing planar graphs using the canonical ordering
G. Kant
OriginalPaper Pages: 4 - 32
Maximum planar subgraphs and nice embeddings: Practical layout tools
M. Jünger
P. Mutzel
OriginalPaper Pages: 33 - 59
The realization problem for Euclidean minimum spanning trees is NP-hard
P. Eades
S. Whitesides
OriginalPaper Pages: 60 - 82
Characterizing proximity trees
P. Bose
W. Lenhart
G. Liotta
OriginalPaper Pages: 83 - 110
Applications of the crossing number
J. Pach
F. Shahrokhi
M. Szegedy
OriginalPaper Pages: 111 - 117
Drawings of graphs on surfaces with few crossings
F. Shahrokhi
L. A. Székely
I. Vrt'o
OriginalPaper Pages: 118 - 131