Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=5849

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

A novel grid-based visualization approach for metabolic networks with advanced focus&context view
Markus Rohrschneider, Christian Heine, André Reichenbach, Andreas Kerren, Gerik Scheuermann
Lecture Notes in Computer Science 5849, 2010, pp. 268-279
Small drawings of series-parallel graphs and other subclasses of planar graphs
Therese Biedl
Lecture Notes in Computer Science 5849, 2010, pp. 280-291
Drawing trees in a streaming model
Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Zweig
Lecture Notes in Computer Science 5849, 2010, pp. 292-303
The planar slope number of planar partial 3-trees of bounded degree
Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesaȓ, Tomás̑ Vyskoc̑il
Lecture Notes in Computer Science 5849, 2010, pp. 304-315
Drawing planar 3-trees with given face-areas
Therese Biedl, Lesvia Elena Ruiz Velázquez
Lecture Notes in Computer Science 5849, 2010, pp. 316-322
3D visibility representations by regular polygons
Jan S̑tola
Lecture Notes in Computer Science 5849, 2010, pp. 323-333
Complexity of some geometric and topological problems
Marcus Schaefer
Lecture Notes in Computer Science 5849, 2010, pp. 334-344
On planar supports for hypergraphs
Kevin Buchin, Marc van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek
Lecture Notes in Computer Science 5849, 2010, pp. 345-356
DAGmaps and \varepsilon-visibility representations of DAGs
Vassilis Tsiaras, Ioannis G. Tollis
Lecture Notes in Computer Science 5849, 2010, pp. 357-368
Drawing directed graphs clockwise
Christian Pich
Lecture Notes in Computer Science 5849, 2010, pp. 369-380
An improved algorithm for the metro-line crossing minimization problem
Martin Nöllenburg
Lecture Notes in Computer Science 5849, 2010, pp. 381-392
Layout with circular and other non-linear constraints using procrustes projection
Tim Dwyer, George Robertson
Lecture Notes in Computer Science 5849, 2010, pp. 393-404
GMap: Drawing graphs as maps
Emden R. Gansner, Yifan Hu, Stephen G. Kobourov
Lecture Notes in Computer Science 5849, 2010, pp. 405-407
Using high dimensions to compare drawings of graphs
Stina Bridgeman
Lecture Notes in Computer Science 5849, 2010, pp. 408-410
On \rho-constrained upward topological book embeddings
Tamara Mchedlidze, Antonios Symvonis
Lecture Notes in Computer Science 5849, 2010, pp. 411-412
4-labelings and grid embeddings of plane quadrangulations
Lali Barri`ere, Clemens Huemer
Lecture Notes in Computer Science 5849, 2010, pp. 413-414
IBM ILOG Graph Layout for Eclipse
Jerome Joubert, Stephane Lizeray, Romain Raugi, Georg Sander
Lecture Notes in Computer Science 5849, 2010, pp. 415-416
Layout techniques coupled with Web2.0-based Business Process Modeling
Philip Effinger, Gero Decker
Lecture Notes in Computer Science 5849, 2010, pp. 417-418
Proving or disproving planar straight-line embeddability onto given rectangles
Michael Kaufmann, Stephan Kottler
Lecture Notes in Computer Science 5849, 2010, pp. 419-420
Visualization of complex BPEL models
Benjamin Albrecht, Philip Effinger, Markus Held, Michael Kaufmann, Stephan Kottler
Lecture Notes in Computer Science 5849, 2010, pp. 421-423
DAGmaps and dominance relationships
Vassilis Tsiaras, Ioannis G. Tollis
Lecture Notes in Computer Science 5849, 2010, pp. 424-425
Scaffold Hunter - Interactive exploration of chemical space
Karsten Klein, Nils Kriege, Petra Mutzel, Herbert Waldmann, Stefan Wetzel
Lecture Notes in Computer Science 5849, 2010, pp. 426-427
Graph Drawing Contest Report
Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander
Lecture Notes in Computer Science 5849, 2010, pp. 428-433

Seiten < 1 2