Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1353

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

Drawable and forbidden minimum weight triangulations
William Lenhart, Giuseppe Liotta
Lecture Notes in Computer Science 1353, 1998, pp. 1-12
A polyhedral approach to the multi-layer crossing minimization problem
Michael Jünger, Eva K. Lee, Petra Mutzel, Thomas Odenthal
Lecture Notes in Computer Science 1353, 1998, pp. 13-24
On embedding an outer-planar graph in a point set
Prosenjit Bose
Lecture Notes in Computer Science 1353, 1998, pp. 25-36
Bipartite crossing numbers of meshes and hypercubes
Farhad Shahrokhi, Ondrej Sýkora, Lászlo A. Székely, Imrich Vrt'o
Lecture Notes in Computer Science 1353, 1998, pp. 37-46
Three-dimensional grid drawings of graphs
János Pach, Torsten Thiele, Géza Tóth
Lecture Notes in Computer Science 1353, 1998, pp. 47-51
Incremental orthogonal graph drawing in three dimensions
Achilleas Papakostas, Ioannis G. Tollis
Lecture Notes in Computer Science 1353, 1998, pp. 52-63
On three-dimensional layout of interconnection networks
Tiziana Calamoneri, Annalisa Massini
Lecture Notes in Computer Science 1353, 1998, pp. 64-75
Orthogonal 3-D graph drawing
T. Biedl, T. Shermer, S. Whitesides, S. Wismath
Lecture Notes in Computer Science 1353, 1998, pp. 76-86
Finding the best viewpoints for three-dimensional graph drawings
Peter Eades, Michael E. Houle, Richard Webber
Lecture Notes in Computer Science 1353, 1998, pp. 87-98
A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs
Md. Saidur Rahman, Shin-ichi Nakano, Takao Nishizeki
Lecture Notes in Computer Science 1353, 1998, pp. 99-110
Interactive orthogonal graph drawing: Algorithms and bounds
Ulrich Föss̈meier
Lecture Notes in Computer Science 1353, 1998, pp. 111-123
Embedding a graph in the grid of a surface with the minimum number of bends is NP-hard
M.A. Garrido, A. Márquez
Lecture Notes in Computer Science 1353, 1998, pp. 124-133
Algorithms and area bounds for nonplanar orthogonal drawings
Ulrich Föss̈meier, Michael Kaufmann
Lecture Notes in Computer Science 1353, 1998, pp. 134-145
Drawing clustered graphs on an orthogonal grid
Peter Eades, Qing-Wen Feng
Lecture Notes in Computer Science 1353, 1998, pp. 146-157
Graph clustering I: Cycles of cliques
F.J. Brandenburg
Lecture Notes in Computer Science 1353, 1998, pp. 158-168
An algorithm for labeling edges of hierarchical drawings
Konstantinos G. Kakoulis, Ioannis G. Tollis
Lecture Notes in Computer Science 1353, 1998, pp. 169-180
Elastic labels: The two-axis case
Claudia Iturriaga, Anna Lubiw
Lecture Notes in Computer Science 1353, 1998, pp. 181-192
Pitfalls of using PQ-trees in automatic graph drawing
Michael Jünger, Sebastian Leipert, Petra Mutzel
Lecture Notes in Computer Science 1353, 1998, pp. 193-204
Graph drawing with no k pairwise crossing edges
Pavel Valtr
Lecture Notes in Computer Science 1353, 1998, pp. 205-218
Area requirements for drawing hierarchically planar graphs
Xuemin Lin, Peter Eades
Lecture Notes in Computer Science 1353, 1998, pp. 219-229
A short proof of a Gauss Problem
H. de Fraysseix, P. Ossona de Mendez
Lecture Notes in Computer Science 1353, 1998, pp. 230-235
A Bayesian paradigm for dynamic graph layout
Ulrik Brandes, Dorothea Wagner
Lecture Notes in Computer Science 1353, 1998, pp. 236-247
Which aesthetic has the greatest effect on human understanding?
Helen Purchase
Lecture Notes in Computer Science 1353, 1998, pp. 248-261
Implementing a general-purpose edge router
David P. Dobkin, Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North
Lecture Notes in Computer Science 1353, 1998, pp. 262-271
The wobbly logic engine: Proving hardness on non-rigid geometric graph representation problems
Sándor P. Fekete, Michael E. Houle, Sue Whitesides
Lecture Notes in Computer Science 1353, 1998, pp. 272-283

Seiten 1 2 >