Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1731

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

The anatomy of a geometric algorithm
Jiȓí Matous̑ek
Lecture Notes in Computer Science 1731, 1999, pp. 1-7
Turn-regularity and planar orthogonal drawings
Stina S. Bridgeman, Giuseppe di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara
Lecture Notes in Computer Science 1731, 1999, pp. 8-26
Combining graph labeling and compaction
Gunnar W. Klau, Petra Mutzel
Lecture Notes in Computer Science 1731, 1999, pp. 27-37
Almost bend-optimal planar orthogonal drawings of biconnected degree-3 planar graphs in quadratic time
Ashim Garg, Giuseppe Liotta
Lecture Notes in Computer Science 1731, 1999, pp. 38-48
Fully dynamic 3-dimensional orthogonal graph drawing
M. Closson, S. Gartshore, J. Johansen, S.K. Wismath
Lecture Notes in Computer Science 1731, 1999, pp. 49-58
An E \log E line crossing algorithm for levelled graphs
Vance Waddle, Ashok Malhotra
Lecture Notes in Computer Science 1731, 1999, pp. 59-71
Level planar embedding in linear time
Michael Jünger, Sebastian Leipert
Lecture Notes in Computer Science 1731, 1999, pp. 72-81
Higres - Visualization system for clustered graphs and graph algorithms
Ivan A. Lisitsyn, Victor N. Kasyanov
Lecture Notes in Computer Science 1731, 1999, pp. 82-89
Partitioning approach to visualization of large graphs
Vladimir Batagelj, Andrej Mrvar, Matjaz̆ Zavers̆nik
Lecture Notes in Computer Science 1731, 1999, pp. 90-97
Graph clustering using distance-k cliques - Software demonstration
Jubin Edachery, Arunabha Sen, Franz J. Brandenburg
Lecture Notes in Computer Science 1731, 1999, pp. 98-106
A framework for circular drawings of networks
Janet M. Six, Ioannis G. Tollis
Lecture Notes in Computer Science 1731, 1999, pp. 107-116
Drawing planar graphs with circular arcs
C.C. Cheng, C.A. Duncan, M.T. Goodrich, S.G. Kobourov
Lecture Notes in Computer Science 1731, 1999, pp. 117-126
Drawing graphs in the hyperbolic plane
Bojan Mohar
Lecture Notes in Computer Science 1731, 1999, pp. 127-136
Graph planarity and related topics
Robin Thomas
Lecture Notes in Computer Science 1731, 1999, pp. 137-144
Grid drawings of four-connected plane graphs
Kazuyuki Miura, Shin-ichi Nakano, Takao Nishizeki
Lecture Notes in Computer Science 1731, 1999, pp. 145-154
Graph embedding with topological cycle-constraints
Christoph Dornheim
Lecture Notes in Computer Science 1731, 1999, pp. 155-164
Embedding vertices at points: Few bends suffice for planar graphs
Michael Kaufmann, Roland Wiese
Lecture Notes in Computer Science 1731, 1999, pp. 165-174
The constrained crossing minimization problem
Petra Mutzel, Thomas Ziegler
Lecture Notes in Computer Science 1731, 1999, pp. 175-185
Planarity-preserving clustering and embedding for large planar graphs
Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
Lecture Notes in Computer Science 1731, 1999, pp. 186-196
An algorithm for drawing compound graphs
François Bertault, Mirka Miller
Lecture Notes in Computer Science 1731, 1999, pp. 197-204
The vertex-exchange graph: A new concept for multilevel crossing minimisation
Patrick Healy, Ago Kuusik
Lecture Notes in Computer Science 1731, 1999, pp. 205-216
Using sifting for k-layer straightline crossing minimization
Christian Matuszewski, Robby Schönfeld, Paul Molitor
Lecture Notes in Computer Science 1731, 1999, pp. 217-224
On 3-layer crossings and pseudo arrangements
Farhad Shahrokhi, Imrich Vrt'o
Lecture Notes in Computer Science 1731, 1999, pp. 225-231
Visualizing algorithms for the design and analysis of survivable networks
Ala Eddine Barouni, Ali Jaoua, Nejib Zaguia
Lecture Notes in Computer Science 1731, 1999, pp. 232-241
LayoutShow: A signed applet/application for graph drawing and experimentation - System demonstration
Lila Behzadi
Lecture Notes in Computer Science 1731, 1999, pp. 242-249

Seiten 1 2 >