LEADER 01197nas 2200397- 450 001 9910394690003321 005 20210210041442.8 035 $a(OCoLC)919911924 035 $a(CKB)4340000000116593 035 $a(CONSER)--2015243359 035 $a(DE-599)ZDB2948363-3 035 $a(EXLCZ)994340000000116593 100 $a20150807a20159999 --- - 101 0 $aeng 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aAuditory and vestibular research 210 1$a[Tehran] :$cTehran University of Medical Sciences,$d[2015]- 215 $a1 online resource 300 $aRefereed/Peer-reviewed 311 08$a2423-480X 517 1 $aAVR 606 $aHearing Disorders 606 $aHearing 608 $aPeriodical. 608 $aPeriodicals.$2fast 615 12$aHearing Disorders. 615 22$aHearing. 712 02$aD?nishg?h-i ?Ul?m-i Pizishk?-i Tihr?n, 712 02$aAnjuman-i ?Ilm?-i Shinav?y??shin?s?-i ?r?n, 712 02$aIranian Society of Otolaryngology Head and Neck Surgery, 906 $aJOURNAL 912 $a9910394690003321 996 $aAuditory and vestibular research$91016260 997 $aUNINA LEADER 06533nam 22007215 450 001 9910143884903321 005 20251116234309.0 010 $a3-540-36151-0 024 7 $a10.1007/3-540-36151-0 035 $a(CKB)1000000000211967 035 $a(SSID)ssj0000323589 035 $a(PQKBManifestationID)11247953 035 $a(PQKBTitleCode)TC0000323589 035 $a(PQKBWorkID)10300338 035 $a(PQKB)11591817 035 $a(DE-He213)978-3-540-36151-0 035 $a(MiAaPQ)EBC3073091 035 $a(PPN)155203517 035 $a(BIP)7994833 035 $a(EXLCZ)991000000000211967 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph Drawing $e10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002, Revised Papers /$fedited by Stephen G. Kobourov, Michael T. Goodrich 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (XIV, 398 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2528 300 $aIncludes index. 311 08$a3-540-00158-1 327 $aPapers -- Sketch-Driven Orthogonal Graph Drawing -- Maintaining the Mental Map for Circular Drawings -- Graphs, They Are Changing -- Drawing Graphs on Two and Three Lines -- Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs -- Drawing Outer-Planar Graphs in O(n log n )Area -- Computing Labeled Orthogonal Drawings -- Computing and Drawing Isomorphic Subgraphs -- A Group-Theoretic Method for Drawing Graphs Symmetrically -- A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem -- Geometric Systems of Disjoint Representatives -- An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization -- Simple and Efficient Bilayer Cross Counting -- Orthogonal 3D Shapes of Theta Graphs -- Separating Thickness from Geometric Thickness -- Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs -- Compact Encodings of Planar Orthogonal Drawings -- Fractional Lengths and Crossing Numbers -- Drawing Directed Graphs Using One-Dimensional Optimization -- Graph Drawing by High-Dimensional Embedding -- Advances in C-Planarity Testing of Clustered Graphs -- HGV: A Library for Hierarchies, Graphs, and Views -- Rectangular Drawings of Planar Graphs -- Extended Rectangular Drawings of Plane Graphs with Designated Corners -- RINGS: A Technique for Visualizing Large Hierarchies -- Applying Crossing Reduction Strategies to Layered Compound Graphs -- Crossing Reduction by Windows Optimization -- Geometric Graphs with No Self-intersecting Path of Length Three -- Two New Heuristics for Two-Sided Bipartite Graph Drawing -- Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio -- Some Applications of Orderly Spanning Trees in Graph Drawing -- Improving Walker?s Algorithm to Run in Linear Time -- Semi-dynamic Orthogonal Drawings of Planar Graphs -- Software Demonstrations -- Graph Layout for Workflow Applications with ILOG JViews -- InterViewer: Dynamic Visualization of Protein-Protein Interactions -- Some Modifications of Sugiyama Approach -- A Framework for Complexity Management in Graph Visualization -- A Partitioned Approach to Protein Interaction Mapping -- Camera Position Reconstruction and Tight Direction Networks -- Demonstration of a Preprocessor for the Spring Embedder -- Graph Drawing Contest -- Graph-Drawing Contest Report -- Invited Talks -- Techniques for Interactive Graph Drawing -- Drawing Venn Diagrams. 330 $aThe 10th International Symposium on Graph Drawing (GD 2002) was held on August 26-28,2002,at Irvine,California. The conference attracted 74 parti- pants from academic and industrial institutions in 14 countries. As in previous years,the review process was competitive: 24 out of 48 regular submissions were accepted. In addition,9 short papers and 8 system demonst- tions (1 withdrawn) were also accepted. Each submission was refereed by at least 4 members of the program committee,and detailed comments were returned to the authors. GD 2002 invited two speakers: Frank Ruskey,from the University of Victoria, gave a talk on drawing Venn diagrams; James Arvo,from the California Institute of Technology,gave a talk on techniques for interactive graph drawing. As usual,the Graph Drawing contest was held during the conference. The report on the contest is included in the proceedings. We would like to thank all the people who helped organize and run the conference. We would like to thank our sponsors: ILOG,MERL (Mitsubishi Electric Research Laboratories),sd&m (Software Design & Management),Tom Sawyer Software,and the University of California,Irvine. We would also like to thank all the contributors and participants who made GD 2002 a success. The 11th International Symposium of Graph Drawing (GD 2003) will be held on September 21-24,2003 at Perugia,Italy,with Giuseppe Liotta as the conference chair. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2528 606 $aComputer software 606 $aComputer science?Mathematics 606 $aAlgorithms 606 $aComputer graphics 606 $aMathematical Software$3https://scigraph.springernature.com/ontologies/product-market-codes/M14042 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$aComputer software. 615 0$aComputer science?Mathematics. 615 0$aAlgorithms. 615 0$aComputer graphics. 615 14$aMathematical Software. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputer Graphics. 676 $a511/.5 702 $aKobourov$b Stephen G$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aGoodrich$b Michael T$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 $a9910143884903321 996 $aGraph Drawing$9773153 997 $aUNINA