LEADER 05483nam 22007815 450 001 996465291703316 005 20230406035441.0 010 $a1-280-38569-3 010 $a9786613563613 010 $a3-642-11805-4 024 7 $a10.1007/978-3-642-11805-0 035 $a(CKB)2670000000010124 035 $a(SSID)ssj0000399485 035 $a(PQKBManifestationID)11249185 035 $a(PQKBTitleCode)TC0000399485 035 $a(PQKBWorkID)10376641 035 $a(PQKB)10385020 035 $a(DE-He213)978-3-642-11805-0 035 $a(MiAaPQ)EBC3065141 035 $a(PPN)149059647 035 $a(EXLCZ)992670000000010124 100 $a20100305d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph Drawing$b[electronic resource] $e17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers /$fedited by David Eppstein, Emden R Gansner 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (426 p. 199 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5849 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-11804-6 327 $aInvited Talks -- Why Are String Graphs So Beautiful? -- The Art of Cheating When Drawing a Graph -- Papers -- Drawing Hamiltonian Cycles with No Large Angles -- Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings -- On the Perspectives Opened by Right Angle Crossing Drawings -- Drawing 3-Polytopes with Good Vertex Resolution -- Planar Drawings of Higher-Genus Graphs -- Splitting Clusters to Get C-Planarity -- On the Characterization of Level Planar Trees by Minimal Patterns -- Characterization of Unlabeled Radial Level Planar Graphs -- Upward Planarization Layout -- More Flexible Radial Layout -- WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizations -- Port Constraints in Hierarchical Layout of Data Flow Diagrams -- Fast Edge-Routing for Large Graphs -- Leftist Canonical Ordering -- Succinct Greedy Drawings Do Not Always Exist -- Geometric Simultaneous Embeddings of a Graph and a Matching -- Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs -- Removing Independently Even Crossings -- Manhattan-Geodesic Embedding of Planar Graphs -- Orthogonal Connector Routing -- On Rectilinear Drawing of Graphs -- Semi-bipartite Graph Visualization for Gene Ontology Networks -- On Open Problems in Biological Network Visualization -- A Novel Grid-Based Visualization Approach for Metabolic Networks with Advanced Focus&Context View -- Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs -- Drawing Trees in a Streaming Model -- The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree -- Drawing Planar 3-Trees with Given Face-Areas -- 3D Visibility Representations by Regular Polygons -- Complexity of Some Geometric and Topological Problems -- On Planar Supports for Hypergraphs -- DAGmaps and ?-Visibility Representations of DAGs -- Drawing Directed Graphs Clockwise -- An Improved Algorithm for the Metro-line Crossing Minimization Problem -- Layout with Circular and Other Non-linear Constraints Using Procrustes Projection -- Posters -- GMap: Drawing Graphs as Maps -- Using High Dimensions to Compare Drawings of Graphs -- On ?-Constrained Upward Topological Book Embeddings -- 4-Labelings and Grid Embeddings of Plane Quadrangulations -- IBM ILOG Graph Layout for Eclipse -- Layout Techniques Coupled with Web2.0-Based Business Process Modeling -- Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles -- Visualization of Complex BPEL Models -- DAGmaps and Dominance Relationships -- Scaffold Hunter ? Interactive Exploration of Chemical Space -- Graph Drawing Contest -- Graph Drawing Contest Report. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5849 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aComputer science 606 $aUser interfaces (Computer systems) 606 $aHuman-computer interaction 606 $aDiscrete Mathematics in Computer Science 606 $aMathematical Applications in Computer Science 606 $aAlgorithms 606 $aModels of Computation 606 $aSymbolic and Algebraic Manipulation 606 $aUser Interfaces and Human Computer Interaction 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aComputer science. 615 0$aUser interfaces (Computer systems). 615 0$aHuman-computer interaction. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aMathematical Applications in Computer Science. 615 24$aAlgorithms. 615 24$aModels of Computation. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aUser Interfaces and Human Computer Interaction. 676 $a004.0151 702 $aEppstein$b David$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aGansner$b Emden R$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aSymposium on Graph Drawing 906 $aBOOK 912 $a996465291703316 996 $aGraph Drawing$9773153 997 $aUNISA