Sommaire

Drawing planar graphs with large vertices and thick edges.

Barequet, Gill ; Goodrich, Michael T. ; Riley, Chris

Access to full text
Full (PDF)
p. 3-20

The Electronic Library of Mathematics
The maximum number of edges in a three-dimensional grid-drawing.

Bose, Prosenjit ; Czyzowicz, Jurek ; Morin, Pat ; Wood, David R.

Access to full text
Full (PDF)
p. 21-26

The Electronic Library of Mathematics
Extreme distances in multicolored point sets.

Dumitrescu, Adrian ; Guha, Sumanta

Access to full text
Full (PDF)
p. 27-38

The Electronic Library of Mathematics
Fast approximation of centrality.

Eppstein, David ; Wang, Joseph

Access to full text
Full (PDF)
p. 39-45

The Electronic Library of Mathematics
I/O-optimal algorithms for outerplanar graphs.

Maheshwari, Anil ; Zeh, Norbert

Access to full text
Full (PDF)
p. 47-87

The Electronic Library of Mathematics
A note on rectilinearity and angular resolution.

Bodlaender, Hans L. ; Tel, Gerard

Access to full text
Full (PDF)
p. 89-94

The Electronic Library of Mathematics
The star clustering algorithm for static and dynamic information organization.

Aslam, Javed A. ; Pelekhov, Ekaterina ; Rus, Daniela

Access to full text
Full (PDF)
p. 95-129

The Electronic Library of Mathematics
Straight-line drawings of binary trees with linear area and arbitrary aspect ratio.

Garg, Ashim ; Rusu, Adrian

Access to full text
Full (PDF)
p. 135-160

The Electronic Library of Mathematics
Drawing graphs on two and three lines.

Cornelsen, Sabine ; Schank, Thomas ; Wagner, Dorothea

Access to full text
Full (PDF)
p. 161-177

The Electronic Library of Mathematics
Simple and efficient bilayer cross counting.

Barth, Wilhelm ; Mutzel, Petra ; Jünger, Michael

Access to full text
Full (PDF)
p. 179-194

The Electronic Library of Mathematics
Graph drawing by high-dimensional embedding.

Harel, David ; Koren, Yehuda

Access to full text
Full (PDF)
p. 195-214

The Electronic Library of Mathematics
Computing and drawing isomorphic subgraphs.

Bachl, S. ; Brandenburg, F.-J. ; Gmach, D.

Access to full text
Full (PDF)
p. 215-238

The Electronic Library of Mathematics
On the cutting edge: simplified O(n) planarity by edge addition.

Boyer, John M. ; Myrvold, Wendy J.

Access to full text
Full (PDF)
p. 241-273

The Electronic Library of Mathematics
Algorithms for single link failure recovery and related problems.

Bhosle, Amit M. ; Gonzalez, Teofilo F.

Access to full text
Full (PDF)
p. 275-294

The Electronic Library of Mathematics
NP-completeness of minimal width unordered tree layout.

Marriott, Kim ; Stuckey, Peter J.

Access to full text
Full (PDF)
p. 295-312

The Electronic Library of Mathematics
Algorithm and experiments in testing planar graphs for isomorphism.

Kukluk, Jacek P. ; Holder, Lawrence B. ; Cook, Diane J.

Access to full text
Full (PDF)
p. 313-356

The Electronic Library of Mathematics
Three-dimensional 1-bend graph drawings.

Morin, Pat ; Wood, David R.

Access to full text
Full (PDF)
p. 357-366

The Electronic Library of Mathematics