LEADER 05525nam 22006855 450 001 996466012503316 005 20230222172810.0 024 7 $a10.1007/b105810 035 $a(CKB)1000000000212733 035 $a(SSID)ssj0000317978 035 $a(PQKBManifestationID)11266433 035 $a(PQKBTitleCode)TC0000317978 035 $a(PQKBWorkID)10307429 035 $a(PQKB)11243030 035 $a(DE-He213)978-3-540-31843-9 035 $a(MiAaPQ)EBC3067512 035 $a(PPN)12309187X 035 $a(EXLCZ)991000000000212733 100 $a20100705d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph Drawing$b[electronic resource] $e12th International Symposium, GD 2004, New York, NY, USA, September 29-October 2, 2004, Revised Selected Papers /$fedited by Janos Pach 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XII, 540 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3383 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-31843-7 311 $a3-540-24528-6 320 $aIncludes bibliographical references and index. 327 $aPapers -- Reconfiguring Triangulations with Edge Flips and Point Moves -- Drawing Power Law Graphs -- Hexagonal Grid Drawings: Algorithms and Lower Bounds -- Improved Bounds for the Number of (? k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K n -- On the Realizable Weaving Patterns of Polynomial Curves in -- Drawing the AS Graph in 2.5 Dimensions -- Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps -- Convex Drawings of 3-Connected Plane Graphs -- Partitions of Complete Geometric Graphs into Plane Trees -- Additional PC-Tree Planarity Conditions -- GraphML Transformation -- Clustering Cycles into Cycles of Clusters -- Unit Bar-Visibility Layouts of Triangulated Polygons -- Really Straight Graph Drawings -- Layouts of Graph Subdivisions -- Label Number Maximization in the Slider Model -- An Efficient Implementation of Sugiyama?s Algorithm for Layered Graph Drawing -- Random Geometric Graph Diameter in the Unit Disk with ? p Metric -- Algorithms for Drawing Media -- Confluent Layered Drawings -- Simultaneous Embedding of Planar Graphs with Few Bends -- A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction -- Contact and Intersection Representations -- Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs -- Graph Drawing by Stress Majorization -- Computing Radial Drawings on the Minimum Number of Circles -- Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem -- Distributed Graph Layout for Sensor Networks -- Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm -- Building Blocks of Upward Planar Digraphs -- A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs -- Train Tracks and Confluent Drawings -- The Three Dimensional Logic Engine -- Long Alternating Paths in Bicolored Point Sets -- Intersection Reverse Sequences and Geometric Applications -- New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes -- Drawing Pfaffian Graphs -- 3D Visualization of Semantic Metadata Models and Ontologies -- A Note on the Self-similarity of Some Orthogonal Drawings -- No-Three-in-Line-in-3D -- Visual Navigation of Compound Graphs -- Layout Volumes of the Hypercube -- New Theoretical Bounds of Visibility Representation of Plane Graphs -- Software Demonstrations -- Visualizing Large Graphs with Compound-Fisheye Views and Treemaps -- A Compound Graph Layout Algorithm for Biological Pathways -- Curvilinear Graph Drawing Using the Force-Directed Method -- Graphael: A System for Generalized Force-Directed Layouts -- QUOGGLES: Query On Graphs ? A Graphical Largely Extensible System -- Visualisation of Large and Complex Networks Using PolyPlane -- The Metro Map Layout Problem -- An Interactive Multi-user System for Simultaneous Graph Drawing -- Posters -- Gravisto: Graph Visualization Toolkit -- DNA Secondary Structures for Probe Design -- Open Problems Wiki -- Visualization and ILOG CPLEX -- Graph Drawing Contest -- Graph-Drawing Contest Report -- Invited Talk -- Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3383 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aComputer graphics 606 $aArtificial intelligence?Data processing 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aComputer Graphics 606 $aData Science 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aComputer graphics. 615 0$aArtificial intelligence?Data processing. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aComputer Graphics. 615 24$aData Science. 676 $a511.5 702 $aPach$b Janos$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aSymposium on Graph Drawing 906 $aBOOK 912 $a996466012503316 996 $aGraph Drawing$9773153 997 $aUNISA LEADER 01315nam a2200289 4500 001 991003035739707536 005 20250430130204.0 008 940920s1542 it c b ita 035 $ab14271485-39ule_inst 035 $aCICOGNARA-1968$9ExL 040 $aBibl. Interfacoltà T. Pellegrino$bita 041 0 $aita 100 1 $aFranco, Niccolò$d<1515-1570>$0425645 245 10$aDialogo$cdi M. Nicolo Franco, doue si ragiona delle bellezze, alla eccellentissima marchesana del Vasto 260 $a[Casale di Monferrato,$bGioanantonio Guidone,$c1542] 300 $a[152] p.; $c21 cm 500 $aFront. con incisione 500 $aRitr. dell'autore sul front. e in fine 500 $aRiproduzione in microfiche dell'originale conservato presso la Biblioteca Apostolica Vaticana 787 18$iLeopoldo Cicognara Program :$tBiblioteca Cicognara$h[microform] : literary sources in the history of art and kindred subjects 787 18$tCatalogo ragionato dei libri d'arte e d'antichità / Leopoldo Cicognara 907 $a.b14271485$b01-04-22$c28-07-16 912 $a991003035739707536 945 $aLE002 SB Raccolta Cicognara, mcrf 1056$g0$lle002$pE0.00$rn$so $t11$u0$v0$w0$x0$y.i1574260x$z28-07-16 996 $aDialogo$91389181 997 $aUNISALENTO 998 $ale002$b28-07-16$cm$dg $e-$fita$git $h0$i1