Sommaire

An algorithm to construct greedy drawings of triangulations.

Angelini, Patrizio ; Frati, Fabrizio ; Grilli, Luca

Access to full text
Full (PDF)
p. 19-51

The Electronic Library of Mathematics
Efficient, proximity-preserving node overlap removal.

Gansner, Emden ; Hu, Yifan

Access to full text
Full (PDF)
p. 53-74

The Electronic Library of Mathematics
On metro-line crossing minimization.

Argyriou, Evmorfia ; Bekos, Michael A. ; Kaufmann, Michael ; Symvonis, Antonios

Access to full text
Full (PDF)
p. 75-96

The Electronic Library of Mathematics
Visual analysis of one-to-many matched graphs.

Di Giacomo, Emilio ; Didimo, Walter ; Liotta, Giuseppe ; Palladino, Pietro

Access to full text
Full (PDF)
p. 97-119

The Electronic Library of Mathematics
New complexity results for time-constrained dynamical optimal path problems.

Kluge, Sebastian ; Brokate, Martin ; Reif, Konrad

Access to full text
Full (PDF)
p. 123-147

The Electronic Library of Mathematics
Resource relocation on asymmetric networks.

Wildstrom, D.Jacob

Access to full text
Full (PDF)
p. 149-163

The Electronic Library of Mathematics
Computational aspects of lucidity-driven graph clustering.

Görke, Robert ; Gaertler, Marco ; Hübner, Florian ; Wagner, Dorothea

Access to full text
Full (PDF)
p. 165-197

The Electronic Library of Mathematics