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

• Why are string graphs so beautiful?
  János Pach
  Lecture Notes in Computer Science 5849, 2010, pp. 1-1
• The art of cheating when drawing a graph
  Martin Wattenberg
  Lecture Notes in Computer Science 5849, 2010, pp. 2-2
• Drawing Hamiltonian cycles with no large angles
  Adrian Dumitrescu, János Pach, Géza Tóth
  Lecture Notes in Computer Science 5849, 2010, pp. 3-14
• Area, curve complexity, and crossing resolution of non-planar graph drawings
  Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
  Lecture Notes in Computer Science 5849, 2010, pp. 15-20
• On the perspectives opened by right angle crossing drawings
  Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann, Antonios Symvonis
  Lecture Notes in Computer Science 5849, 2010, pp. 21-32
• Drawing 3-polytopes with good vertex resolution
  André Schulz
  Lecture Notes in Computer Science 5849, 2010, pp. 33-44
• Planar drawings of higher-genus graphs
  Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
  Lecture Notes in Computer Science 5849, 2010, pp. 45-56
• Splitting clusters to get C-planarity
  Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani
  Lecture Notes in Computer Science 5849, 2010, pp. 57-68
• On the characterization of level planar trees by minimal patterns
  Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov
  Lecture Notes in Computer Science 5849, 2010, pp. 69-80
• Characterization of unlabeled radial level planar graphs
  J. Joseph Fowler
  Lecture Notes in Computer Science 5849, 2010, pp. 81-93
• Upward planarization layout
  Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong
  Lecture Notes in Computer Science 5849, 2010, pp. 94-106
• More flexible radial layout
  Ulrik Brandes, Christian Pich
  Lecture Notes in Computer Science 5849, 2010, pp. 107-118
• WiGis: A framework for scalable Web-based Interactive Graph Visualizations
  Brynjar Gretarsson, Svetlin Bostandjiev, John O'Donovan, Tobias Höllerer
  Lecture Notes in Computer Science 5849, 2010, pp. 119-134
• Port constraints in hierarchical layout of data flow diagrams
  Miro Spönemann, Hauke Fuhrmann, Reinhard von Hanxleden, Petra Mutzel
  Lecture Notes in Computer Science 5849, 2010, pp. 135-146
• Fast edge-routing for large graphs
  Tim Dwyer, Lev Nachmanson
  Lecture Notes in Computer Science 5849, 2010, pp. 147-158
• Leftist canonical ordering
  Melanie Badent, Michael Baur, Ulrik Brandes, Sabine Cornelsen
  Lecture Notes in Computer Science 5849, 2010, pp. 159-170
• Succinct greedy drawings do not always exist
  Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati
  Lecture Notes in Computer Science 5849, 2010, pp. 171-182
• Geometric simultaneous embeddings of a graph and a matching
  Sergio Cabello, Marc van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek
  Lecture Notes in Computer Science 5849, 2010, pp. 183-194
• Algebraic methods for counting Euclidean embeddings of rigid graphs
  Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios E. Varvitsiotis
  Lecture Notes in Computer Science 5849, 2010, pp. 195-200
• Removing independently even crossings
  Michael J. Pelsmajer, Marcus Schaefer, Daniel S̑tefankovic̑
  Lecture Notes in Computer Science 5849, 2010, pp. 201-206
• Manhattan-geodesic embedding of planar graphs
  Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander Wolff
  Lecture Notes in Computer Science 5849, 2010, pp. 207-218
• Orthogonal connector routing
  Michael Wybrow, Kim Marriott, Peter J. Stuckey
  Lecture Notes in Computer Science 5849, 2010, pp. 219-231
• On rectilinear drawing of graphs
  Peter Eades, Seok-Hee Hong, Sheung-Hung Poon
  Lecture Notes in Computer Science 5849, 2010, pp. 232-243
• Semi-bipartite graph visualization for gene ontology networks
  Kai Xu, Rohan Williams, Seok-Hee Hong, Qing Liu, Ji Zhang
  Lecture Notes in Computer Science 5849, 2010, pp. 244-255
• On open problems in biological network visualization
  Mario Albrecht, Andreas Kerren, Karsten Klein, Oliver Kohlbacher, Petra Mutzel, Wolfgang Paul, Falk Schreiber, Michael Wybrow
  Lecture Notes in Computer Science 5849, 2010, pp. 256-267