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

• 3DCube: A tool for three dimensional graph drawing
  Maurizio Patrignani, Francesco Vargiu
  Lecture Notes in Computer Science 1353, 1998, pp. 284-290
• Graph clustering using multiway ratio cut
  Tom Roxborough, Arunabha Sen
  Lecture Notes in Computer Science 1353, 1998, pp. 291-296
• ArchE: A graph drawing system for archaeology
  Christoph Hundack, Petra Mutzel, Igor Pouchkarev, Stefan Thome
  Lecture Notes in Computer Science 1353, 1998, pp. 297-302
• InteractiveGiotto: An algorithm for interactive orthogonal graph drawing
  Stina S. Bridgeman, Jody Fanto, Ashim Garg, Roberto Tamassia, Luca Vismara
  Lecture Notes in Computer Science 1353, 1998, pp. 303-308
• GRID: An interactive tool for computing orthogonal drawings with the minimum numer of bends
  Walter Didimo, Antonio Leonforte
  Lecture Notes in Computer Science 1353, 1998, pp. 309-315
• Lexical navigation: Using incremental graph drawing for query refinement
  Daniel Tunkelang, Roy J. Byrd, James W. Cooper
  Lecture Notes in Computer Science 1353, 1998, pp. 316-321
• Desigh gallery browsers based on 2D and 3D graph drawing
  Brad Andalman, Kathy Ryall, Wheeler Ruml, Joe Marks, Stuart Shieber
  Lecture Notes in Computer Science 1353, 1998, pp. 322-329
• Online animated graph drawing for Web navigation
  Peter Eades, Robert F. Cohen, Mao Lin Huang
  Lecture Notes in Computer Science 1353, 1998, pp. 330-335
• Grappa: A GRAPh PAckage in Java
  Naser S. Barghouti, John M. Mocenigo, Wenke Lee
  Lecture Notes in Computer Science 1353, 1998, pp. 336-343
• GraVis - System demonstration
  Harald Lauer, Matthias Ettrich, Klaus Soukup
  Lecture Notes in Computer Science 1353, 1998, pp. 344-349
• Touching graphs of unit balls
  Petr Hlinȇný
  Lecture Notes in Computer Science 1353, 1998, pp. 350-358
• Discrete realizations of contact and intersection graphs
  Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia
  Lecture Notes in Computer Science 1353, 1998, pp. 359-370
• Minimum-area h-v drawings of complete binary trees
  P. Crescenzi, P. Penna
  Lecture Notes in Computer Science 1353, 1998, pp. 371-382
• Packing trees into planar graphs
  A. García, C. Hernando, F. Hurtado, M. Noy, J. Tejel
  Lecture Notes in Computer Science 1353, 1998, pp. 383-390
• The three-phase method: A unified approach to orthogonal graph drawing
  Therese C. Biedl, Brendan P. Madden, Ioannis G. Tollis
  Lecture Notes in Computer Science 1353, 1998, pp. 391-402
• NicheWorks - Interactive visualization of very large graphs
  Graham J. Wills
  Lecture Notes in Computer Science 1353, 1998, pp. 403-414
• Extending the Sugiyama algorithm for drawing UML class diagrams: Towards automatic layout of object-oriented software diagrams
  Jochen Seemann
  Lecture Notes in Computer Science 1353, 1998, pp. 415-424
• Graph drawing and manipulation with LINK
  Jonathan Berry, Nathaniel Dean, Mark Goldberg, Gregory Shannon, Steven Skiena
  Lecture Notes in Computer Science 1353, 1998, pp. 425-437
• Graph-drawing contest report
  Peter Eades, Joe Marks, Stephen North
  Lecture Notes in Computer Science 1353, 1998, pp. 438-445