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

• A linear-time algorithm for four-partitioning four-connected planar graphs
  Shin-ichi Nakano, M. Saidur Rahman, Takao Nishizeki
  Lecture Notes in Computer Science 1190, 1997, pp. 334-344
• Graphs drawn with few crossings per edge
  János Pach, Géza Tóth
  Lecture Notes in Computer Science 1190, 1997, pp. 345-354
• A pairing technique for area-efficient orthogonal drawings
  Achilleas Papakostas, Ioannis G. Tollis
  Lecture Notes in Computer Science 1190, 1997, pp. 355-370
• Experimental and theoretical results in interactive orthogonal graph drawing
  Achilleas Papakostas, Janet M. Six, Ioannis G. Tollis
  Lecture Notes in Computer Science 1190, 1997, pp. 371-386
• An interactive system for drawing graphs
  Kathy Ryall, Joe Marks, Stuart Shieber
  Lecture Notes in Computer Science 1190, 1997, pp. 387-394
• Automatic graph clustering
  Reinhard Sablowski, Arne Frick
  Lecture Notes in Computer Science 1190, 1997, pp. 395-400
• Qualitative visualization of processes: Attributed graph layout and focusing techniques
  Kent Wittenburg, Louis Weitzman
  Lecture Notes in Computer Science 1190, 1997, pp. 401-408