Graph drawing. 8th international symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20--23, 2000. Proceedings (Q1592503)

The articles of this volume will be reviewed individually. The preceding symposium (7th, 1999) has been reviewed (see Zbl 0931.00046). Indexed articles: \textit{Ware, Colin}, The visual representation of information structures, 1-4 [Zbl 1043.68638] \textit{Purchase, Helen C.; Allder, Jo-Anne; Carrington, David}, User preference of graph layout aesthetics: A UML study, 5-18 [Zbl 1043.68633] \textit{Bridgeman, Stina; Tamassia, Roberto}, A user study in similarity measures for graph drawing, 19-30 [Zbl 1043.68608] \textit{Lesh, Neal; Marks, Joe; Patrignani, Maurizio}, Interactive partitioning (system demonstration, short), 31-36 [Zbl 1043.68628] \textit{Klau, Gunnar W.; Klein, Karsten; Mutzel, Petra}, An experimental comparison of orthogonal compaction algorithms (extended abstract), 37-51 [Zbl 1043.68626] \textit{Herman, Ivan; Marshall, M. Scott}, GraphXML -- an XML-based graph description format, 52-62 [Zbl 1043.68623] \textit{Hutchinson, Joan P.}, On polar visibility representations of graphs, 63-76 [Zbl 1043.68625] \textit{Gutwenger, Carsten; Mutzel, Petra}, A linear time implementation of SPQR-trees, 77-90 [Zbl 1043.68621] \textit{Nakano, Shin-ichi; Nishizeki, Takao; Tokuyama, Takeshi; Watanabe, Shuhei}, Labeling points with rectangles of various shapes, 91-102 [Zbl 1043.68810] \textit{Brandes, Ulrik; Cornelsen, Sabine; Wagner, Dorothea}, How to draw the minimum cuts of a planar graph, 103-114 [Zbl 1043.68605] \textit{Boissonnat, J. D.; Cazals, F.; Flötotto, J.}, 2D -structure drawings of similar molecules, 115-126 [Zbl 1043.68603] \textit{Brandes, Ulrik; Shubina, Galina; Tamassia, Roberto; Wagner, Dorothea}, Fast layout methods for timetable graphs, 127-138 [Zbl 1043.68607] \textit{Castelló, R.; Mili, R.; Tollis, I. G.}, An algorithmic framework for visualizing statecharts, 139-149 [Zbl 1043.68611] \textit{Carmignani, Andrea; Di Battista, Giuseppe; Didimo, Walter; Matera, Francesco; Pizzonia, Maurizio}, Visualization of the autonomous systems interconnections with HERMES, 150-163 [Zbl 1043.68610] \textit{Bertault, François; Eades, Peter}, Drawing hypergraphs in the subset standard, 164-169 [Zbl 1043.68601] \textit{Jensen, David}, Knowledge discovery from graphs, 170 [Zbl 1043.68661] \textit{Walshaw, C.}, A multilevel algorithm for force-directed graph drawing, 171-182 [Zbl 1043.68637] \textit{Harel, David; Koren, Yehuda}, A fast multi-scale method for drawing large graphs, 183-196 [Zbl 1043.68622] \textit{Quigley, Aaron; Eades, Peter}, FADE: Graph drawing, clustering, and visual abstraction, 197-210 [Zbl 1043.68634] \textit{Gajer, Pawel; Goodrich, Michael T.; Kobourov, Stephen G.}, A multi-dimensional approach to force-directed layouts of large graphs, 211-221 [Zbl 1043.68618] \textit{Gajer, Pawel; Kobourov, Stephen G.}, GRIP: Graph drawing with intelligent placement, 222-228 [Zbl 1043.68619] \textit{Buchheim, Christoph; Jünger, Michael; Leipert, Sebastian}, A fast layout algorithm for \(k\)-level graphs, 229-240 [Zbl 1043.68609] \textit{Waddle, Vance}, Graph layout for displaying data structures, 241-252 [Zbl 1043.68636] \textit{Günther, Wolfgang; Schönfeld, Robby; Becker, Bernd; Molitor, Paul}, \(k\)-layer straightline crossing minimization by speeding up sifting, 253-258 [Zbl 1043.68620] \textit{Wood, David R.}, Lower bounds for the number of bends in three-dimensional orthogonal graph drawings, 259-271 [Zbl 1043.68639] \textit{Di Battista, Giuseppe; Liotta, Giuseppe; Lubiw, Anna; Whitesides, Sue}, Orthogonal drawings of cycles in 3D space (extended abstract), 272-283 [Zbl 1043.68616] \textit{Biedl, Therese; Thiele, Torsten; Wood, David R.}, Three-dimensional orthogonal graph drawing with optimal volume, 284-295 [Zbl 1043.68602] \textit{Nakano, Shin-ichi; Yoshikawa, Makiko}, A linear-time algorithm for bend-optimal orthogonal drawings of biconnected cubic plane graphs, 296-307 [Zbl 1043.68631] \textit{Lynn, Benjamin Y. S.; Symvonis, Antonios; Wood, David R.}, Refinement of three-dimensional orthogonal graph drawings, 308-320 [Zbl 1043.68629] \textit{Barequet, Gill}, \(\omega\)-searchlight obedient graph drawings, 321-327 [Zbl 1043.68600] \textit{Pach, János; Tóth, Géza}, Unavoidable configurations in complete topological graphs, 328-337 [Zbl 1043.68632] \textit{Lenhart, William; Liotta, Giuseppe}, Minimum weight drawings of maximal triangulations (extended abstract), 338-349 [Zbl 1043.68627] \textit{Dean, Alice M.}, A layout algorithm for bar-visibility graphs on the Möbius band, 350-359 [Zbl 1043.68614] \textit{Hong, Seok-Hee; Eades, Peter}, An algorithm for finding three dimensional symmetry in trees, 360-371 [Zbl 1043.68624] \textit{Chen, Ho-Lin; Lu, Hsueh-I.; Yen, Hsu-Chun}, On maximum symmetric subgraphs, 372-383 [Zbl 1043.68612] \textit{Shieh, Fwu-Shan; McCreary, Carolyn L.}, Clan-based incremental drawing, 384-395 [Zbl 1043.68635] \textit{Friedrich, Carsten; Eades, Peter}, The Marey graph animation tool demo, 396-406 [Zbl 1043.68617] \textit{Brandes, Ulrik; Marshall, M. Scott; North, Stephen C.}, Graph data format workshop report, 407-409 [Zbl 1043.68606] \textit{Brandenburg, Franz; Brandes, Ulrik; Himsolt, Michael; Raitner, Marcus}, Graph-drawing contest report, 410-418 [Zbl 1043.68604]