Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=1984

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

The visual representation of information structures
Colin Ware
Lecture Notes in Computer Science 1984, 2001, pp. 1-4
User preference of graph layout aesthetics: A UML study
Helen C. Purchase, Jo-Anne Allder, David Carrington
Lecture Notes in Computer Science 1984, 2001, pp. 5-18
A user study in similarity measures for graph drawing
Stina Bridgeman, Roberto Tamassia
Lecture Notes in Computer Science 1984, 2001, pp. 19-30
Interactive partitioning (system demonstration, short)
Neal Lesh, Joe Marks, Maurizio Patrignani
Lecture Notes in Computer Science 1984, 2001, pp. 31-36
An experimental comparison of orthogonal compaction algorithms
Gunnar W. Klau, Karsten Klein, Petra Mutzel
Lecture Notes in Computer Science 1984, 2001, pp. 37-51
Graph XML -- An XML-based graph description format
Ivan Herman, M. Scott Marshall
Lecture Notes in Computer Science 1984, 2001, pp. 52-62
On polar visibility representations of graphs
Joan P. Hutchinson
Lecture Notes in Computer Science 1984, 2001, pp. 63-76
A linear time implementation of SPQR-trees
Carsten Gutwenger, Petra Mutzel
Lecture Notes in Computer Science 1984, 2001, pp. 77-90
Labeling points with rectangles of various shapes
Shin-ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe
Lecture Notes in Computer Science 1984, 2001, pp. 91-102
How to draw the minimum cuts of a planar graph
Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner
Lecture Notes in Computer Science 1984, 2001, pp. 103-114
2D-structure drawings of similar molecules
J.D. Boissonnat, F. Cazals, J. Flötotto
Lecture Notes in Computer Science 1984, 2001, pp. 115-126
Fast layout methods for timetable graphs
Ulrik Brandes, Galina Shubina, Roberto Tamassia, Dorothea Wagner
Lecture Notes in Computer Science 1984, 2001, pp. 127-138
An algorithmic framework for visualizing statecharts
R. Castelló, R. Mili, I.G. Tollis
Lecture Notes in Computer Science 1984, 2001, pp. 139-149
Visualization of the autonomous systems interconnections with HERMES
Andrea Carmignani, Giuseppe di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia
Lecture Notes in Computer Science 1984, 2001, pp. 150-163
Drawing hypergraphs in the subset standard
François Bertault, Peter Eades
Lecture Notes in Computer Science 1984, 2001, pp. 164-169
Knowledge discovery from graphs
David Jensen
Lecture Notes in Computer Science 1984, 2001, pp. 170-170
A multilevel algorithm for force-directed graph drawing
C. Walshaw
Lecture Notes in Computer Science 1984, 2001, pp. 171-182
A fast multi-scale method for drawing large graphs
David Harel, Yehuda Koren
Lecture Notes in Computer Science 1984, 2001, pp. 183-196
FADE: Graph drawing, clustering, and visual abstraction
Aaron Quigley, Peter Eades
Lecture Notes in Computer Science 1984, 2001, pp. 197-210
A multi-dimensional approach to force-directed layouts of large graphs
Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov
Lecture Notes in Computer Science 1984, 2001, pp. 211-221
GRIP: Graph dRawing with Intelligent Placement
Pawel Gajer, Stephen G. Kobourov
Lecture Notes in Computer Science 1984, 2001, pp. 222-228
A fast layout algorithm for k-level graphs
Christoph Buchheim, Michael Jünger, Sebastian Leipert
Lecture Notes in Computer Science 1984, 2001, pp. 229-240
Graph layout for displaying data structures
Vance Waddle
Lecture Notes in Computer Science 1984, 2001, pp. 241-252
k-layer straightline crossing minimization by speeding up sifting
Wolfgang Günther, Robby Schönfeld, Bernd Becker, Paul Molitor
Lecture Notes in Computer Science 1984, 2001, pp. 253-258
Lower bounds for the number of bends in three-dimensional orthogonal graph drawings
David R. Wood
Lecture Notes in Computer Science 1984, 2001, pp. 259-271

Seiten 1 2 >