Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1547

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

Drawing of two-dimensional irregular meshes
Alok Aggarwal, S. Rao Kosaraju, Mihai Pop
Lecture Notes in Computer Science 1547, 1998, pp. 1-14
Quasi-upward planarity
Paola Bertolazzi, Giuseppe di Battista, Walter Didimo
Lecture Notes in Computer Science 1547, 1998, pp. 15-29
Three approaches to 3D-orthogonal box-drawings
Therese C. Biedl
Lecture Notes in Computer Science 1547, 1998, pp. 30-43
Using graph layout to visualize train interconnection data
Ulrik Brandes, Dorothea Wagner
Lecture Notes in Computer Science 1547, 1998, pp. 44-56
Difference metrics for interactive orthogonal graph drawing algorithms
Stina Bridgeman, Roberto Tamassia
Lecture Notes in Computer Science 1547, 1998, pp. 57-71
Upward planarity checking: ''Faces are more than polygons''
Giuseppe di Battista, Giuseppe Liotta
Lecture Notes in Computer Science 1547, 1998, pp. 72-86
A split&push approach to 3D orthogonal drawing
Giuseppe di Battista, Maurizio Patrignani, Francesco Vargiu
Lecture Notes in Computer Science 1547, 1998, pp. 87-101
Geometric thickness of complete graphs
Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
Lecture Notes in Computer Science 1547, 1998, pp. 102-110
Balanced aspect ratio trees and their use for drawing very large graphs
Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
Lecture Notes in Computer Science 1547, 1998, pp. 111-124
On improving orthogonal drawings: The 4M-algorithm
Ulrich Fößmeier, Carsten Heß, Michael Kaufmann
Lecture Notes in Computer Science 1547, 1998, pp. 125-137
Algorithmic patterns for orthogonal graph drawing
Natasha Gelfand, Roberto Tamassia
Lecture Notes in Computer Science 1547, 1998, pp. 138-152
A framework for drawing planar graphs with curves and polylines
Michael T. Goodrich, Christopher G. Wagner
Lecture Notes in Computer Science 1547, 1998, pp. 153-166
Planar polyline drawings with good angular resolution
Carsten Gutwenger, Petra Mutzel
Lecture Notes in Computer Science 1547, 1998, pp. 167-182
A layout adjustment problem for disjoint rectangles preserving orthogonal order
Kunihiko Hayashi, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara
Lecture Notes in Computer Science 1547, 1998, pp. 183-197
Drawing algorithms for series-parallel digraphs in two and three dimensions
Seok-Hee Hong, Peter Eades, Aaron Quigley, Sang-Ho Lee
Lecture Notes in Computer Science 1547, 1998, pp. 198-209
Approximation algorithms for finding best viewpoints
Michael E. Houle, Richard Webber
Lecture Notes in Computer Science 1547, 1998, pp. 210-223
Level planarity testing in linear time
Michael Jünger, Sebastian Leipert, Petra Mutzel
Lecture Notes in Computer Science 1547, 1998, pp. 224-237
Crossing number of abstract topological graphs
Jan Kratochvíl
Lecture Notes in Computer Science 1547, 1998, pp. 238-245
Self-organizing graphs - A neural network perspective of graph layout
Bernd Meyer
Lecture Notes in Computer Science 1547, 1998, pp. 246-262
Embedding planar graphs at fixed vertex locations
János Pach, Rephael Wenger
Lecture Notes in Computer Science 1547, 1998, pp. 263-274
Proximity drawings: Three dimensions are better than two
Paolo Penna, Paola Vocca
Lecture Notes in Computer Science 1547, 1998, pp. 275-287
NP-completeness of some tree-clustering problems
Falk Schreiber, Konstantinos Skodinis
Lecture Notes in Computer Science 1547, 1998, pp. 288-301
Refinement of orthogonal graph drawings
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G. Tollis
Lecture Notes in Computer Science 1547, 1998, pp. 302-315
A combinatorial framework for map labeling
Frank Wagner, Alexander Wolff
Lecture Notes in Computer Science 1547, 1998, pp. 316-331
An algorithm for three-dimensional orthogonal graph drawing
David R. Wood
Lecture Notes in Computer Science 1547, 1998, pp. 332-346

Seiten 1 2 >