Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=5417

• Networks in biology - From identification, analysis to interpretation
  Jesper Tegnér
  Lecture Notes in Computer Science 5417, 2009, pp. 1-1
• Graph drawing for security visualization
  Roberto Tamassia, Bernardo Palazzi, Charalampos Papamanthou
  Lecture Notes in Computer Science 5417, 2009, pp. 2-13
• Succinct greedy graph drawing in the hyperbolic plane
  David Eppstein, Michael Goodrich
  Lecture Notes in Computer Science 5417, 2009, pp. 14-25
• An algorithm to construct greedy drawings of triangulations
  Patrizio Angelini, Fabrizio Frati, Luca Grilli
  Lecture Notes in Computer Science 5417, 2009, pp. 26-37
• Crossing and weighted crossing number of near-planar graphs
  Sergio Cabello, Bojan Mohar
  Lecture Notes in Computer Science 5417, 2009, pp. 38-49
• Cubic graphs have bounded slope parameter
  Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
  Lecture Notes in Computer Science 5417, 2009, pp. 50-60
• Unimaximal sequences of pairs in rectangle visibility drawing
  Jan S̑tola
  Lecture Notes in Computer Science 5417, 2009, pp. 61-66
• Visibility representations of four-connected plane graphs with near optimal heights
  Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu
  Lecture Notes in Computer Science 5417, 2009, pp. 67-77
• The topology of bendless three-dimensional orthogonal graph drawing
  David Eppstein
  Lecture Notes in Computer Science 5417, 2009, pp. 78-89
• Rapid multipole graph drawing on the GPU
  Apeksha Godiyal, Jared Hoberock, Michael Garland, John C. Hart
  Lecture Notes in Computer Science 5417, 2009, pp. 90-101
• Clustered planarity: Clusters with few outgoing edges
  Vít Jelínek, Ondȓej Suchý, Marek Tesaȓ, Tomás̑ Vyskoc̑il
  Lecture Notes in Computer Science 5417, 2009, pp. 102-113
• Computing maximum C-planar subgraphs
  Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein, Petra Mutzel
  Lecture Notes in Computer Science 5417, 2009, pp. 114-120
• Clustered planarity: Embedded clustered graphs with two-component clusters
  Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický
  Lecture Notes in Computer Science 5417, 2009, pp. 121-132
• Visual analysis of one-to-many matched graphs
  Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino
  Lecture Notes in Computer Science 5417, 2009, pp. 133-144
• Topological morphing of planar graphs
  Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani
  Lecture Notes in Computer Science 5417, 2009, pp. 145-156
• An SPQR-tree approach to decide special cases of simultaneous embedding with fixed edges
  J. Joseph Fowler, Carsten Gutwenger, Michael Jünger, Petra Mutzel, Michael Schulz
  Lecture Notes in Computer Science 5417, 2009, pp. 157-168
• Graph Simultaneous Embedding Tool, GraphSET
  Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov
  Lecture Notes in Computer Science 5417, 2009, pp. 169-180
• Hamiltonian alternating paths on bicolored double-chains
  Josef Cibulka, Jan Kync̑l, Viola Mészáros, Rudolf Stolaȓ, Pavel Valtr
  Lecture Notes in Computer Science 5417, 2009, pp. 181-192
• The binary stress model for graph drawing
  Yehuda Koren, Ali Çivril
  Lecture Notes in Computer Science 5417, 2009, pp. 193-205
• Efficient node overlap removal using a proximity stress model
  Emden R. Gansner, Yifan Hu
  Lecture Notes in Computer Science 5417, 2009, pp. 206-217
• An experimental study on distance-based graph drawing
  Ulrik Brandes, Christian Pich
  Lecture Notes in Computer Science 5417, 2009, pp. 218-229
• Topology preserving constrained graph layout
  Tim Dwyer, Kim Marriott, Michael Wybrow
  Lecture Notes in Computer Science 5417, 2009, pp. 230-241
• Embeddability problems for upward planar digraphs
  Francesco Giordano, Giuseppe Liotta, Sue H. Whitesides
  Lecture Notes in Computer Science 5417, 2009, pp. 242-253
• A fully dynamic algorithm to test the upward planarity of single-source embedded digraphs
  Aimal Rextin, Patrick Healy
  Lecture Notes in Computer Science 5417, 2009, pp. 254-265
• On the hardness of orthogonal-order preserving graph drawing
  Ulrik Brandes, Barbara Pampel
  Lecture Notes in Computer Science 5417, 2009, pp. 266-277