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 YEAR=1998

• Drawing of two-dimensional irregular meshes
  Alok Aggarwal, S. Rao Kosaraju, Mihai Pop
  Lecture Notes in Computer Science 1547, 1998, pp. 1-14
• Quasi-upward planarity
  Paola Bertolazzi, Giuseppe di Battista, Walter Didimo
  Lecture Notes in Computer Science 1547, 1998, pp. 15-29
• Three approaches to 3D-orthogonal box-drawings
  Therese C. Biedl
  Lecture Notes in Computer Science 1547, 1998, pp. 30-43
• Using graph layout to visualize train interconnection data
  Ulrik Brandes, Dorothea Wagner
  Lecture Notes in Computer Science 1547, 1998, pp. 44-56
• Difference metrics for interactive orthogonal graph drawing algorithms
  Stina Bridgeman, Roberto Tamassia
  Lecture Notes in Computer Science 1547, 1998, pp. 57-71
• Geometric thickness of complete graphs
  Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
  Lecture Notes in Computer Science 1547, 1998, pp. 102-110
• Graph multidrawing: Finding nice drawings without defining nice
  Therese Biedl, Joe Marks, Kathy Ryall, Sue Whitesides
  Lecture Notes in Computer Science 1547, 1998, pp. 347-355
• Edge labeling in the graph layout toolkit
  Uğur Doğrusöz, Konstantinos G. Kakoulis, Brendan Madden, Ioannis G. Tollis
  Lecture Notes in Computer Science 1547, 1998, pp. 356-363
• Implementation of an efficient constraint solver for the layout of graphs in Delaunay
  Isabel F. Cruz, Donald I. Lambe
  Lecture Notes in Computer Science 1547, 1998, pp. 436-437
• Planar drawings of origami polyhedra
  Erik D. Demaine, Martin L. Demaine
  Lecture Notes in Computer Science 1547, 1998, pp. 438-440
• Human perception of laid-out graphs
  Edmund Dengler, William Cowan
  Lecture Notes in Computer Science 1547, 1998, pp. 441-443
• The discrepancy method
  Bernard Chazelle
  Lecture Notes in Computer Science 1533, 1998, pp. 1-3
• Facility location on terrains
  Boris Aronov, Marc van Kreveld, René van Oostrum, Kasturirangan Varadarajan
  Lecture Notes in Computer Science 1533, 1998, pp. 19-28
• Computing weighted rectilinear median and center set in the presence of obstacles
  Joonsoo Choi, Chan-Su Shin, Sung Kwon Kim
  Lecture Notes in Computer Science 1533, 1998, pp. 29-38
• Maximizing agreement with a classification by bounded or unbounded number of associated words
  Hiroki Arimura, Shinichi Shimozono
  Lecture Notes in Computer Science 1533, 1998, pp. 39-48
• Computing orthogonal drawings in a variable embedding setting
  Walter Didimo, Giuseppe Liotta
  Lecture Notes in Computer Science 1533, 1998, pp. 79-88
• Dynamic grid embedding with few bends and changes
  Ulrik Brandes, Dorothea Wagner
  Lecture Notes in Computer Science 1533, 1998, pp. 89-98
• On-line scheduling of parallel jobs with runtime restrictions
  Stefan Bischof, Ernst W. Mayr
  Lecture Notes in Computer Science 1533, 1998, pp. 119-128
• Testing the quality of manufactured disks and cylinders
  Prosenjit Bose, Pat Morin
  Lecture Notes in Computer Science 1533, 1998, pp. 129-138
• Casting with skewed ejection direction
  Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong
  Lecture Notes in Computer Science 1533, 1998, pp. 139-148
• Repairing flaws in a picture based on a geometric representation of a digital image
  Tetsuo Asano, Hiro Ito, Souichi Kimura, Shigeaki Shimazu
  Lecture Notes in Computer Science 1533, 1998, pp. 149-158
• Convertibility among grid filling curves
  Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
  Lecture Notes in Computer Science 1533, 1998, pp. 307-316
• Generalized self-approaching curves
  Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
  Lecture Notes in Computer Science 1533, 1998, pp. 317-326
• Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages
  Tatsuya Akutsu
  Lecture Notes in Computer Science 1533, 1998, pp. 337-346
• Visibility queries in simple polygons and applications
  Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang
  Lecture Notes in Computer Science 1533, 1998, pp. 357-366