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 [2]	Hilfe

Suche: Series=LNCS AND Volume=6502

• On the size of graphs that admit polyline drawings with few bends and crossing angles
  Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth
  Lecture Notes in Computer Science 6502, 2011, pp. 1-12
• Monotone drawings of graphs
  Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
  Lecture Notes in Computer Science 6502, 2011, pp. 13-24
• Upward geometric graph embeddings into point sets
  Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis
  Lecture Notes in Computer Science 6502, 2011, pp. 25-37
• On a tree and a path with no geometric simultaneous embedding
  Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth
  Lecture Notes in Computer Science 6502, 2011, pp. 38-49
• Difference map readability for dynamic graphs
  Daniel Archambault, Helen C. Purchase, Bruno Pinaud
  Lecture Notes in Computer Science 6502, 2011, pp. 50-61
• Maximizing the total resolution of graphs
  Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis
  Lecture Notes in Computer Science 6502, 2011, pp. 62-67
• Plane drawings of queue and deque graphs
  Christopher Auer, Christian Bachmaier, Franz Josef Brandenburg, Wolfgang Brunner, Andreas Gleißner
  Lecture Notes in Computer Science 6502, 2011, pp. 68-79
• An experimental evaluation of multilevel layout methods
  Gereon Bartel, Carsten Gutwenger, Karsten Klein, Petra Mutzel
  Lecture Notes in Computer Science 6502, 2011, pp. 80-91
• Orthogonal graph drawing with flexibility constraints
  Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner
  Lecture Notes in Computer Science 6502, 2011, pp. 92-104
• Drawing ordered (k-1)-ary trees on k-grids
  Wolfgang Brunner, Marco Matzeder
  Lecture Notes in Computer Science 6502, 2011, pp. 105-116
• Optimizing regular edge labelings
  Kevin Buchin, Bettina Speckmann, Sander Verdonschot
  Lecture Notes in Computer Science 6502, 2011, pp. 117-128
• Drawing graphs in the plane with a prescribed outer face and polynomial area
  Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler
  Lecture Notes in Computer Science 6502, 2011, pp. 129-140
• Crossing minimization and layouts of directed hypergraphs with port constraints
  Markus Chimani, Carsten Gutwenger, Petra Mutzel, Miro Spönemann, Hoi-Ming Wong
  Lecture Notes in Computer Science 6502, 2011, pp. 141-152
• Drawing graphs on a smartphone
  Giordano Da Lozzo, Giuseppe Di Battista, Francesco Ingrassia
  Lecture Notes in Computer Science 6502, 2011, pp. 153-164
• Topology-driven force-directed algorithms
  Walter Didimo, Giuseppe Liotta, Salvatore A. Romeo
  Lecture Notes in Computer Science 6502, 2011, pp. 165-176
• On graphs supported by line sets
  Vida Dujmović, William Evans, Stephen Kobourov, Giuseppe Liotta, Christophe Weibel, Stephen Wismath
  Lecture Notes in Computer Science 6502, 2011, pp. 177-182
• Drawing trees with perfect angular resolution and polynomial area
  Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
  Lecture Notes in Computer Science 6502, 2011, pp. 183-194
• Lombardi drawings of graphs
  Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
  Lecture Notes in Computer Science 6502, 2011, pp. 195-207
• Optimal 3D angular resolution for low-degree graphs
  David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg
  Lecture Notes in Computer Science 6502, 2011, pp. 208-219
• Improved lower bounds on the area requirements of series-parallel graphs
  Fabrizio Frati
  Lecture Notes in Computer Science 6502, 2011, pp. 220-225
• A computational approach to Conway's thrackle conjecture
  Radoslav Fulek, János Pach
  Lecture Notes in Computer Science 6502, 2011, pp. 226-237
• Optimal k-level planarization and crossing minimization
  Graeme Gange, Peter J. Stuckey, Kim Marriott
  Lecture Notes in Computer Science 6502, 2011, pp. 238-249
• On touching triangle graphs
  Emden R. Gansner, Yifan Hu, Stephen G. Kobourov
  Lecture Notes in Computer Science 6502, 2011, pp. 250-261
• Triangle contact representations and duality
  Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
  Lecture Notes in Computer Science 6502, 2011, pp. 262-273
• On maximum differential graph coloring
  Yifan Hu, Stephen Kobourov, Sankar Veeramoni
  Lecture Notes in Computer Science 6502, 2011, pp. 274-286