LEADER 06157nam 22007695 450 001 996465395803316 005 20200702135515.0 010 $a3-540-45848-4 024 7 $a10.1007/3-540-45848-4 035 $a(CKB)1000000000211675 035 $a(SSID)ssj0000323588 035 $a(PQKBManifestationID)11247882 035 $a(PQKBTitleCode)TC0000323588 035 $a(PQKBWorkID)10318925 035 $a(PQKB)11294699 035 $a(DE-He213)978-3-540-45848-7 035 $a(MiAaPQ)EBC3073185 035 $a(PPN)155211269 035 $a(EXLCZ)991000000000211675 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph Drawing$b[electronic resource] $e9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers /$fedited by Petra Mutzel, Michael Jünger, Sebastian Leipert 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (XVI, 528 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2265 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-43309-0 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aHierarchical Drawing -- A Fixed-Parameter Approach to Two-Layer Planarization -- How to Layer a Directed Acyclic Graph -- Fast and Simple Horizontal Coordinate Assignment -- Automated Visualization of Process Diagrams -- Planarity -- Planarization of Clustered Graphs -- An Algorithm for Finding Large Induced Planar Subgraphs -- A Characterization of DFS Cotree Critical Graphs -- Crossing Theory -- An Improved Lower Bound for Crossing Numbers -- Crossing-Critical Graphs and Path-Width -- One Sided Crossing Minimization Is NP-Hard for Sparse Graphs -- Compaction -- Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size -- Labeling Heuristics for Orthogonal Drawings -- Planar Graphs -- Untangling a Polygon -- Drawing with Fat Edges -- Symmetries -- Detecting Symmetries by Branch & Cut -- Drawing Graphs Symmetrically in Three Dimensions -- Interactive Drawing -- User Hints for Directed Graph Drawing -- Graph Drawing in Motion II -- Online Hierarchical Graph Drawing -- Representations -- Recognizing String Graphs Is Decidable -- On Intersection Graphs of Segments with Prescribed Slopes -- Aesthetics -- A Short Note on the History of Graph Drawing -- Towards an Aesthetic Invariant for Graph Drawing -- 2D-and 3D-Embeddings -- Orthogonal Drawings with Few Layers -- Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing -- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions -- Low-Distortion Embeddings of Trees -- Data Visualization -- Insight into Data through Visualization -- Floor-Planning -- Floor-Planning via Orderly Spanning Trees -- Disconnected Graph Layout and the Polyomino Packing Approach -- Planar Drawings -- Orthogonal Drawings of Plane Graphs without Bends -- Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution -- Corrected Printing of GD 2000 Paper -- On Polar Visibility Representations of Graphs -- Software Exhibition -- Tulip -- The ILOG JViews Graph Layout Module -- WAVE -- WilmaScope? An Interactive 3D Graph Visualisation System -- Exploration and Visualization of Computer Networks: Polyphemus and Hermes -- CrocoCosmos -- The Graph Drawing Server -- Drawing Database Schemas with DBdraw -- yFiles: Visualization and Automatic Layout of Graphs -- BioPath -- Graph Visualization API Library for Application Builders -- JGraph? A Java Based System for Drawing Graphs and Running Graph Algorithms -- Caesar Automatic Layout of UML Class Diagrams -- Visone Software for Visual Social Network Analysis -- Generating Schematic Cable Plans Using Springembedder Methods -- SugiBib -- Knowledge Index Manager -- Planarity Testing of Graphs on Base of a Spring Model -- AGD: A Library of Algorithms for Graph Drawing -- Industrial Plant Drawer -- Pajek? Analysis and Visualization of Large Networks -- GLIDE -- ViSta -- Graphviz? Open Source Graph Drawing Tools -- Graph Exchange Formats -- Exchanging Graphs with GXL -- GraphML Progress Report Structural Layer Proposal -- Graph Drawing Contest -- Graph-Drawing Contest Report. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2265 606 $aComputer software 606 $aEngineering design 606 $aComputer science?Mathematics 606 $aComputer graphics 606 $aAlgorithms 606 $aMathematical Software$3https://scigraph.springernature.com/ontologies/product-market-codes/M14042 606 $aEngineering Design$3https://scigraph.springernature.com/ontologies/product-market-codes/T17020 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 615 0$aComputer software. 615 0$aEngineering design. 615 0$aComputer science?Mathematics. 615 0$aComputer graphics. 615 0$aAlgorithms. 615 14$aMathematical Software. 615 24$aEngineering Design. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 615 24$aAlgorithm Analysis and Problem Complexity. 676 $a511/.5 702 $aMutzel$b Petra$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJünger$b Michael$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLeipert$b Sebastian$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aSymposium on Graph Drawing 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465395803316 996 $aGraph Drawing$9773153 997 $aUNISA