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=3843

• Crossings and permutations
  Therese Biedl, Franz J. Brandenburg, Xiaotie Deng
  Lecture Notes in Computer Science 3843, 2006, pp. 1-12
• Morphing planar graphs while preserving edge directions
  Therese Biedl, Anna Lubiw, Michael J. Spriggs
  Lecture Notes in Computer Science 3843, 2006, pp. 13-24
• Dynamic spectral layout of small worlds
  Ulrik Brandes, Daniel Fleischer, Thomas Puppe
  Lecture Notes in Computer Science 3843, 2006, pp. 25-36
• Exact crossing minimization
  Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher
  Lecture Notes in Computer Science 3843, 2006, pp. 37-48
• On embedding a cycle in a plane graph
  Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia
  Lecture Notes in Computer Science 3843, 2006, pp. 49-60
• On rectilinear duals for vertex-weighted plane graphs
  Mark de Berg, Elena Mumford, Bettina Speckmann
  Lecture Notes in Computer Science 3843, 2006, pp. 61-72
• Bar k-visibility graphs: Bounds on the number of edges, chromatic number, and thickness
  Alice M. Dean, William Evans, Ellen Gethner, Joshua D. Laison, Mohammad Ali Safari, William T. Trotter
  Lecture Notes in Computer Science 3843, 2006, pp. 73-82
• Drawing K_n in three dimensions with one bend per edge
  Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath
  Lecture Notes in Computer Science 3843, 2006, pp. 83-88
• Small area drawings of outerplanar graphs
  Giuseppe Di Battista, Fabrizio Frati
  Lecture Notes in Computer Science 3843, 2006, pp. 89-100
• Volume requirements of 3D upward drawings
  Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
  Lecture Notes in Computer Science 3843, 2006, pp. 101-110
• How to embed a path onto two sets of points
  Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta
  Lecture Notes in Computer Science 3843, 2006, pp. 111-116
• Upward spirality and upward planarity testing
  Walter Didimo, Francesco Giordano, Giuseppe Liotta
  Lecture Notes in Computer Science 3843, 2006, pp. 117-128
• Graph treewidth and geometric thickness parameters
  Vida Dujmović, David R. Wood
  Lecture Notes in Computer Science 3843, 2006, pp. 129-140
• Stress majorization with orthogonal ordering constraints
  Tim Dwyer, Yehuda Koren, Kim Marriott
  Lecture Notes in Computer Science 3843, 2006, pp. 141-152
• Fast node overlap removal
  Tim Dwyer, Kim Marriott, Peter J. Stuckey
  Lecture Notes in Computer Science 3843, 2006, pp. 153-164
• Delta-confluent drawings
  David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
  Lecture Notes in Computer Science 3843, 2006, pp. 165-176
• Transversal structures on triangulations, with application to straight-line drawing
  Éric Fusy
  Lecture Notes in Computer Science 3843, 2006, pp. 177-188
• A hybrid model for drawing dynamic and evolving graphs
  Marco Gaertler, Dorothea Wagner
  Lecture Notes in Computer Science 3843, 2006, pp. 189-200
• Two trees which are self-intersecting when drawn simultaneously
  Markus Geyer, Michael Kaufmann, Imrich Vrt'o
  Lecture Notes in Computer Science 3843, 2006, pp. 201-210
• C-planarity of extrovert clustered graphs
  Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun
  Lecture Notes in Computer Science 3843, 2006, pp. 211-222
• Non-planar core reduction of graphs
  Carsten Gutwenger, Markus Chimani
  Lecture Notes in Computer Science 3843, 2006, pp. 223-234
• An experimental comparison of fast algorithms for drawing general large graphs
  Stefan Hachul, Michael Jünger
  Lecture Notes in Computer Science 3843, 2006, pp. 235-250
• Hierarchical layouts of directed graphs in three dimensions
  Seok-Hee Hong, Nikola S. Nikolov
  Lecture Notes in Computer Science 3843, 2006, pp. 251-261
• Layout effects on sociogram perception
  Weidong Huang, Seok-Hee Hong, Peter Eades
  Lecture Notes in Computer Science 3843, 2006, pp. 262-273
• On edges crossing few other edges in simple topological complete graphs
  Jan Kync̑l, Pavel Valtr
  Lecture Notes in Computer Science 3843, 2006, pp. 274-284