LEADER 01185cas0 2200325 450 001 SOBP300093 005 20180323084858.0 011 $a18274986 100 $a20050505a19979999|||||ita|0103 ba 101 $aita 102 $aIT 110 $aa 200 1 $aClose-up$estorie della visione 207 1$aA. 1, n. 1 (1997)-a. 5, n. 11 (2001); n.s., a. 1, n.1 (2002)-a 14, n. 27-28 (2011); n.s., a. 15, n. 1 (2011)- 210 $aTorino$cLindau 215 $av.$cill.$d23 cm 300 $aQuadrimestrale, semestrale dal 2002, bimestrale dal 2011 300 $aDal 2011 altro sottotitolo: bimestrale di critica e informazione cinematografica 300 $aL'editore varia : Roma : Edizioni associate (2002); Sovera (2011) 300 $aIl formato varia: 23-30 cm 300 $aNumerazione dei fascicoli progressiva nelle annate 801 0$aIT$bUNISOB$c20180323$gRICA 850 $aUNISOB 852 $aUNISOB$jIt$m98743 912 $aSOBP300093 940 $aS 120 Periodico SBN 941 $aS 957 $aIt$b000309$gCON$d98743$racquisto$uCessato$1carrano$2UNISOB$3UNISOB$420051209091931.0$520150121105138.0$6bethb 996 $aClose-up$91545288 997 $aUNISOB LEADER 08220nam 22007335 450 001 9910144209403321 005 20251116234504.0 010 $a1-280-30672-6 010 $a9786610306725 010 $a3-540-24595-2 024 7 $a10.1007/b94919 035 $a(CKB)1000000000212286 035 $a(DE-He213)978-3-540-24595-7 035 $a(SSID)ssj0000165086 035 $a(PQKBManifestationID)11180168 035 $a(PQKBTitleCode)TC0000165086 035 $a(PQKBWorkID)10141723 035 $a(PQKB)10575167 035 $a(MiAaPQ)EBC3087412 035 $a(PPN)155237195 035 $a(EXLCZ)991000000000212286 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aGraph Drawing $e11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers /$fedited by Guiseppe Liotta 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (XIV, 542 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2912 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-20831-3 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aPlanarity and Planar Drawings -- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way -- An Experimental Study of Crossing Minimization Heuristics -- Stop Minding Your P?s and Q?s: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm -- Bounds and Methods for k-Planar Crossing Numbers -- Geometric Graph Theory -- How Many Ways Can One Draw a Graph? -- Two Results on Intersection Graphs of Polygons -- Stretching of Jordan Arc Contact Systems -- Noncrossing Hamiltonian Paths in Geometric Graphs -- Applications and Systems ? Part I -- GraphAEL: Graph Animations with Evolving Layouts -- Visualizing Related Metabolic Pathways in Two and a Half Dimensions -- GoVisual for CASE Tools Borland Together ControlCenter and Gentleware Poseidon ? System Demonstration -- Straight-Line, Circular, and Circular-Arc Drawings -- Area-Efficient Drawings of Outerplanar Graphs -- A Framework for User-Grouped Circular Drawings -- Fixed-Location Circular-Arc Drawing of Planar Graphs -- A More Practical Algorithm for Drawing Binary Trees in Linear Area with Arbitrary Aspect Ratio -- Symmetries -- An Integer Programming Approach to Fuzzy Symmetry Detection -- Barycentric Drawings of Periodic Graphs -- 3D-Drawings -- Three-Dimensional Grid Drawings with Sub-quadratic Volume -- Laying Out Iterated Line Digraphs Using Queues -- Track Drawings of Graphs with Constant Queue Number -- 3D Visibility Representations of Complete Graphs -- Drawing Series-Parallel Graphs on Restricted Integer 3D Grids -- Nearly Optimal Three Dimensional Layout of Hypercube Networks -- Embeddings and Triangulations -- Graph Embedding with Minimum Depth and Maximum External Face -- More Efficient Generation of Plane Triangulations -- Planar Embeddings of Graphs with Specified Edge Lengths -- Applications and Systems ? Part II -- BGPlay: A System for Visualizing the Interdomain Routing Evolution -- GraphEx: An Improved Graph Translation Service -- A Constrained, Force-Directed Layout Algorithm for Biological Pathways -- Intersection-Free Morphing of Planar Graphs -- Fixed Parameter Tractability -- Fixed Parameter Algorithms for one-sided crossing minimization Revisited -- Experiments with the Fixed-Parameter Approach for Two-Layer Planarization -- Clusters, Cuts, and Orthogonal Drawings -- Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles -- Convex Drawing for c-Planar Biconnected Clustered Graphs -- Layout of Directed Hypergraphs with Orthogonal Hyperedges -- No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs -- k-Level Drawings -- Radial Level Planarity Testing and Embedding in Linear Time -- An Improved Approximation to the One-Sided Bilayer Drawing -- Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves -- Force Directed and Energy-Based Techniques -- An Energy Model for Visual Graph Clustering -- Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes -- Axis-by-Axis Stress Minimization -- Drawing Graphs with Nonuniform Nodes Using Potential Fields -- Surfaces and Diagrams -- Drawing Area-Proportional Venn and Euler Diagrams -- Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface -- Posters -- Degree Navigator TM : The Journey of a Visualization Software -- HexGraph: Applying Graph Drawing Algorithms to the Game of Hex -- GLuskap: Visualization and Manipulation of Graph Drawings in 3-Dimensions -- Web-Linkage Viewer: Drawing Links in the Web Based on a Site-Oriented Framework -- The Puzzle Layout Problem -- Visual Data Mining with ILOG Discovery -- Graph Drawing Contest -- Graph Drawing Contest Report -- Invited Talks -- Engineering and Visualizing Algorithms -- Report on the Invited Lecture by Pat Hanrahan, Titled ?On Being in the Right Space? -- Open Problems -- Selected Open Problems in Graph Drawing. 330 $aThe 11th International Symposium on Graph Drawing (GD 2003) was held on September 21?24, 2003, at the Universit` a degli Studi di Perugia, Perugia, Italy. GD 2003 attracted 93 participants from academic and industrial institutions in 17 countries. In response to the call for papers, the program committee received 88 re- larsubmissionsdescribingoriginalresearchand/orsystemdemonstrations.Each submission was reviewed by at least 4 program committee members and c- ments were returned to the authors. Following extensive e-mail discussions, the program committee accepted 34 long papers (12 pages each in the proceedings) and 11 short papers (6 pages each in the proceedings). Also, 6 posters (2 pages each in the proceedings) were displayed in the conference poster gallery. In addition to the 88 submissions, the program committee also received a submission of special type, one that was not competing with the others for a time slot in the conference program and that collects selected open problems in graph drawing. The aim of this paper, which was refereed with particular care andUNCHANGEDtworoundsofrevisions,istostimulatefutureresearchinthe graph drawing community. The paper presents 42 challenging open problems in di?erentareasofgraphdrawingandcontainsmorethan120references.Although the length of the paper makes it closer to a journal version than to a conference extended abstract, we decided to include it in the conference proceedings so that it could easily reach in a short time the vast majority of the graph drawing community. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2912 606 $aDiscrete mathematics 606 $aComputer science?Mathematics 606 $aAlgorithms 606 $aComputer graphics 606 $aDiscrete Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29000 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aDiscrete mathematics. 615 0$aComputer science?Mathematics. 615 0$aAlgorithms. 615 0$aComputer graphics. 615 14$aDiscrete Mathematics. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputer Graphics. 676 $a006.6 702 $aLiotta$b Giuseppe$cPh. D.$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 $a9910144209403321 996 $aGraph Drawing$9773153 997 $aUNINA