01088nam--2200385---450-99000326964020331620090611155610.0978-88-8402-640-8000326964USA01000326964(ALEPH)000326964USA0100032696420090611d2009----km-y0itay50------baitaIT||||||||001yyDegli amori tragiciistoria esemplareGirolamo Brusonia cura di Emanuela BufacchiRomaSalerno2009219 p.20 cmFaville512001Faville512001001-------2001853.5BRUSONI,Girolamo202549BUFACCHI,EmanuelaITsalbcISBD990003269640203316VI.3.A. 2587216838 L.M.VI.3.00226226BKUMAMARTUCCIEL9020090611USA011556MARTUCCIEL9020090611USA011556Degli amori tragici1119283UNISA05483nam 22007815 450 99646529170331620230406035441.01-280-38569-397866135636133-642-11805-410.1007/978-3-642-11805-0(CKB)2670000000010124(SSID)ssj0000399485(PQKBManifestationID)11249185(PQKBTitleCode)TC0000399485(PQKBWorkID)10376641(PQKB)10385020(DE-He213)978-3-642-11805-0(MiAaPQ)EBC3065141(PPN)149059647(EXLCZ)99267000000001012420100305d2010 u| 0engurnn|008mamaatxtccrGraph Drawing[electronic resource] 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers /edited by David Eppstein, Emden R Gansner1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (426 p. 199 illus.) Theoretical Computer Science and General Issues,2512-2029 ;5849Bibliographic Level Mode of Issuance: Monograph3-642-11804-6 Invited 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.Theoretical Computer Science and General Issues,2512-2029 ;5849Computer science—MathematicsDiscrete mathematicsAlgorithmsComputer scienceUser interfaces (Computer systems)Human-computer interactionDiscrete Mathematics in Computer ScienceMathematical Applications in Computer ScienceAlgorithmsModels of ComputationSymbolic and Algebraic ManipulationUser Interfaces and Human Computer InteractionComputer science—Mathematics.Discrete mathematics.Algorithms.Computer science.User interfaces (Computer systems).Human-computer interaction.Discrete Mathematics in Computer Science.Mathematical Applications in Computer Science.Algorithms.Models of Computation.Symbolic and Algebraic Manipulation.User Interfaces and Human Computer Interaction.004.0151Eppstein Davidedthttp://id.loc.gov/vocabulary/relators/edtGansner Emden Redthttp://id.loc.gov/vocabulary/relators/edtSymposium on Graph DrawingBOOK996465291703316Graph Drawing773153UNISA