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

• Centrality in policy network drawings
  Ulrik Brandes, Patrick Kenis, Dorothea Wagner
  Lecture Notes in Computer Science 1731, 1999, pp. 250-258
• Straight-line drawings of protein interactions - System demonstration
  Wojciech Basalaj, Karen Eilbeck
  Lecture Notes in Computer Science 1731, 1999, pp. 259-266
• Art of drawing
  Jaroslav Nes̑etȓil
  Lecture Notes in Computer Science 1731, 1999, pp. 267-275
• An heuristic for graph symmetry detection
  Hubert de Fraysseix
  Lecture Notes in Computer Science 1731, 1999, pp. 276-285
• Isomorphic subgraphs
  Sabine Bachl
  Lecture Notes in Computer Science 1731, 1999, pp. 286-296
• Orthogonal and quasi-upward drawings with vertices of prescribed size
  Giuseppe di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
  Lecture Notes in Computer Science 1731, 1999, pp. 297-310
• Multi-dimensional orthogonal graph drawing with small boxes
  David R. Wood
  Lecture Notes in Computer Science 1731, 1999, pp. 311-322
• Geometric realization of simplicial complexes
  Patrice Ossona de Mendez
  Lecture Notes in Computer Science 1731, 1999, pp. 323-332
• Visibility representations of complete graphs
  Robert Babilon, Helena Nyklová, Ondȓej Pangrác, Jan Vondrák
  Lecture Notes in Computer Science 1731, 1999, pp. 333-340
• Triangle-free planar graphs as segments intersection graphs
  N. de Castro, F.J. Cobos, J.C. Dana, A. Márquez, M. Noy
  Lecture Notes in Computer Science 1731, 1999, pp. 341-350
• A force-directed algorithm that preserves edge crossing properties
  François Bertault
  Lecture Notes in Computer Science 1731, 1999, pp. 351-358
• Rectangle of influence drawings of graphs without filled 3-cycles
  Therese Biedl, Anna Bretscher, Henk Meijer
  Lecture Notes in Computer Science 1731, 1999, pp. 359-368
• Voronoi drawings of trees
  Giuseppe Liotta, Henk Meijer
  Lecture Notes in Computer Science 1731, 1999, pp. 369-378
• Infinite trees and the future
  Camil Demetrescu, Giuseppe di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia
  Lecture Notes in Computer Science 1731, 1999, pp. 379-391
• Latour - A tree visualisation system
  Ivan Herman, Guy Melançon, Maurice M. de Ruiter, Maylis Delest
  Lecture Notes in Computer Science 1731, 1999, pp. 392-399
• Graph-drawing contest report
  Franz J. Brandenburg, Michael Jünger, Joe Marks, Petra Mutzel, Falk Schreiber
  Lecture Notes in Computer Science 1731, 1999, pp. 400-409
• Hunting down graph B
  Ulrik Brandes
  Lecture Notes in Computer Science 1731, 1999, pp. 410-415
• Orthogonal and straight-line drawings of graphs with succinct representations
  Ho-Lin Chen, Hsu-Chun Yen
  Lecture Notes in Computer Science 1731, 1999, pp. 416-417
• Electronic biochemical pathways
  Carl-Christian Kanne, Falk Schreiber, Dietrich Trümbach
  Lecture Notes in Computer Science 1731, 1999, pp. 418-419