Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=4372

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

The number of triangulations on planar point sets
Emo Welzl
Lecture Notes in Computer Science 4372, 2007, pp. 1-4
The algorithmic beauty of digital nature
Oliver Deussen
Lecture Notes in Computer Science 4372, 2007, pp. 5-7
Integrating edge routing into force-directed layout
Tim Dwyer, Kim Marriott, Michael Wybrow
Lecture Notes in Computer Science 4372, 2007, pp. 8-19
Multipole-based force approximation revisited - A simple but fast implementation using a dynamized enclosing-circle-enhanced k-d-tree
Ulrich Lauther
Lecture Notes in Computer Science 4372, 2007, pp. 20-29
SSDE: Fast graph drawing using sampled spectral distance embedding
Ali Çivril, Malik Magdon-Ismail, Eli Bocek-Rivele
Lecture Notes in Computer Science 4372, 2007, pp. 30-41
Eigensolver methods for progressive multidimensional scaling of large data
Ulrik Brandes, Christian Pich
Lecture Notes in Computer Science 4372, 2007, pp. 42-53
Angle and distance constraints on tree drawings
Ulrik Brandes, Barbara Schlieper
Lecture Notes in Computer Science 4372, 2007, pp. 54-65
Schematisation of tree drawings
Joachim Gudmundsson, Marc van Kreveld, Damian Merrick
Lecture Notes in Computer Science 4372, 2007, pp. 66-76
Trees with convex faces and optimal angles
Josiah Carlson, David Eppstein
Lecture Notes in Computer Science 4372, 2007, pp. 77-88
Three-dimensional drawings of bounded degree trees
Fabrizio Frati, Giuseppe Di Battista
Lecture Notes in Computer Science 4372, 2007, pp. 89-94
Simultaneous graph embedding with bends and circular arcs
Justin Cappos, Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov
Lecture Notes in Computer Science 4372, 2007, pp. 95-107
Embedding graphs simultaneously with fixed edges
Fabrizio Frati
Lecture Notes in Computer Science 4372, 2007, pp. 108-113
Drawing cubic graphs with at most five slopes
Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
Lecture Notes in Computer Science 4372, 2007, pp. 114-125
Planarity testing and optimal edge insertion with embedding constraints
Carsten Gutwenger, Karsten Klein, Petra Mutzel
Lecture Notes in Computer Science 4372, 2007, pp. 126-137
Open rectangle-of-influence drawings of inner triangulated plane graphs
Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki
Lecture Notes in Computer Science 4372, 2007, pp. 138-149
Planar decompositions and the crossing number of graphs with an excluded minor
David R. Wood, Jan Arne Telle
Lecture Notes in Computer Science 4372, 2007, pp. 150-161
On the crossing number of almost planar graphs
Petr Hlinȇný, Gelasio Salazar
Lecture Notes in Computer Science 4372, 2007, pp. 162-173
On the decay of crossing numbers
Jacob Fox, Csaba D. Tóth
Lecture Notes in Computer Science 4372, 2007, pp. 174-183
How important is the ''mental map''? - An empirical investigation of a dynamic graph layout algorithm
Helen C. Purchase, Eve Hoggan, Carsten Görg
Lecture Notes in Computer Science 4372, 2007, pp. 184-195
Computing geometric minimum-dilation graphs is NP-hard
Rolf Klein, Martin Kutz
Lecture Notes in Computer Science 4372, 2007, pp. 196-207
Chordal graphs as intersection graphs of pseudosegments
Cornelia Dangelmayr, Stefan Felsner
Lecture Notes in Computer Science 4372, 2007, pp. 208-219
Parameterized st -orientations of graphs: Algorithms and experiments
Charalampos Papamanthou, Ioannis G. Tollis
Lecture Notes in Computer Science 4372, 2007, pp. 220-233
Straight-line drawing of quadrangulations
Éric Fusy
Lecture Notes in Computer Science 4372, 2007, pp. 234-239
Visualizing large and clustered networks
Katharina A. Lehmann, Stephan Kottler
Lecture Notes in Computer Science 4372, 2007, pp. 240-251
Partitioned drawings
Martin Siebenhaller
Lecture Notes in Computer Science 4372, 2007, pp. 252-257

Seiten 1 2 >