Nantilus
Graph drawing : 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, revised selected papers
This book constitutes the thoroughly refereed post-conference proceedings of the 20th International Symposium on Graph Drawing, GD 2012, held in Redmond, WA, USA, in September 2012. The 42 revised full papers presented together with 4 revised short papers and 8 poster descriptions were carefully rev...
Enregistré dans:
| Auteurs principaux : | , |
|---|---|
| Format : | Livre |
| Langue : | anglais |
| Titre complet : | Graph drawing : 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, revised selected papers / edited by Walter Didimo, Maurizio Patrignani |
| Publié : |
Berlin, Heidelberg :
Springer Berlin Heidelberg
, 2013 Cham : Springer Nature |
| Collection : | Theoretical computer science and general issues (Online) ; 7704 |
| Accès en ligne : |
Accès Nantes Université
Accès direct soit depuis les campus via le réseau ou le wifi eduroam soit à distance avec un compte @etu.univ-nantes.fr ou @univ-nantes.fr |
| Note sur l'URL : | Accès sur la plateforme de l'éditeur Accès sur la plateforme de l'éditeur (Springer) Accès sur la plateforme Istex |
| Condition d'utilisation et de reproduction : | Conditions particulières de réutilisation pour les bénéficiaires des licences nationales : chttps://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 |
| Sujets : | |
| Documents associés : | Autre format:
Graph Drawing Autre format: Graph Drawing |
| LEADER | 05898clm a2200685 4500 | ||
|---|---|---|---|
| 001 | PPN168330423 | ||
| 003 | http://www.sudoc.fr/168330423 | ||
| 005 | 20241001155300.0 | ||
| 010 | |a 978-3-642-36763-2 | ||
| 017 | 7 | 0 | |a 10.1007/978-3-642-36763-2 |2 DOI |
| 035 | |a (OCoLC)829434201 | ||
| 035 | |a Springer978-3-642-36763-2 | ||
| 035 | |a SPRINGER_EBOOKS_LN_PLURI_10.1007/978-3-642-36763-2 | ||
| 035 | |a Springer-11645-978-3-642-36763-2 | ||
| 100 | |a 20130325d2013 u u0frey0103 ba | ||
| 101 | 0 | |a eng |2 639-2 | |
| 102 | |a DE | ||
| 135 | |a dr||||||||||| | ||
| 181 | |6 z01 |c txt |2 rdacontent | ||
| 181 | 1 | |6 z01 |a i# |b xxxe## | |
| 182 | |6 z01 |c c |2 rdamedia | ||
| 182 | 1 | |6 z01 |a b | |
| 183 | |6 z01 |a ceb |2 RDAfrCarrier | ||
| 200 | 1 | |a Graph drawing |e 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, revised selected papers |f edited by Walter Didimo, Maurizio Patrignani | |
| 214 | 0 | |a Berlin, Heidelberg |c Springer Berlin Heidelberg | |
| 214 | 2 | |a Cham |c Springer Nature |d 2013 | |
| 225 | 0 | |a Theoretical Computer Science and General Issues |x 2512-2029 |v 7704 | |
| 330 | |a This book constitutes the thoroughly refereed post-conference proceedings of the 20th International Symposium on Graph Drawing, GD 2012, held in Redmond, WA, USA, in September 2012. The 42 revised full papers presented together with 4 revised short papers and 8 poster descriptions were carefully reviewed and selected from 92 submissions. They cover a wide range of topics in two main tracks: combinatorial and algorithmic aspects, and visualization systems and interfaces. In addition, reports of the 19th Annual Graph Drawing Contest, which was held during the conference, and of a workshop on theory and practice of graph drawing to celebrate Professor Peter Eades' 60th birthday are included in the volume. | ||
| 359 | 1 | |a Flips -- Interactive Network Exploration to Derive Insights: Filtering, Clustering, Grouping, and Simplification -- Counting Plane Graphs: Cross-Graph Charging -- Disconnectivity and Relative Positions in Simultaneous Embeddings -- Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage -- Graph Drawing by Classical Multidimensional Scaling: New Perspectives -- Progress on Partial Edge Drawings -- Implementing a Partitioned 2-Page Book Embedding Testing Algorithm -- Shrinking the Search Space for Clustered Planarity -- Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs -- The Approximate Rectangle of Influence Drawability Problem -- Planar Lombardi Drawings for Subcubic Graphs -- Circle-Representations of Simple 4-Regular Planar Graphs -- Smooth Orthogonal Layouts -- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants -- Planar Graphs as VPG-Graphs -- Proportional Contact Representations of 4-Connected Planar Graphs -- Edge-Weighted Contact Representations of Planar Graphs -- Column-Based Graph Layouts -- Upward Planarity Testing via SAT -- Self-approaching Graphs -- Homotopic C-Oriented Routing -- Covering Paths for Planar Point Sets -- On the Density of Maximal 1-Planar Graphs -- Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time -- Tangles and Degenerate Tangles -- The Visible Perimeter of an Arrangement of Disks -- Canonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-Line Drawings -- Planar Preprocessing for Spring Embedders -- StreamEB: Stream Edge Bundling -- Drawing Clustered Graphs as Topographic -- On The Usability of Lombardi Graph Drawings -- Drawing Metro Maps Using B ezier Curves -- Mental Map Preservation Helps User Orientation in Dynamic Graphs -- Clustering, Visualizing, and Navigating for Large Dynamic Graphs -- DAGView: An Approach for Visualizing Large Graphs -- Time-Space Maps from Triangulations -- Graph Drawing in TikZ -- Optical GraphRecognition -- Interactive Random Graph Generation with Evolutionary Algorithms. | |
| 371 | 0 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | |
| 371 | 0 | |a Accès soumis à abonnement pour tout autre établissement | |
| 371 | 1 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales |c chttps://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | |
| 410 | | | |0 200114832 |t Theoretical computer science and general issues (Online) |x 2512-2029 |v 7704 | |
| 452 | | | |t Graph Drawing |b Texte imprimé |y 9783642367625 | |
| 452 | | | |t Graph Drawing |b Texte imprimé |y 9783642367649 | |
| 610 | 1 | |a Computer Science | |
| 610 | 2 | |a Algorithm Analysis and Problem Complexity | |
| 610 | 2 | |a Models and Principles | |
| 610 | 2 | |a Discrete Mathematics in Computer Science | |
| 610 | 2 | |a Computer Communication Networks | |
| 610 | 2 | |a Symbolic and Algebraic Manipulation | |
| 610 | 2 | |a User Interfaces and Human Computer Interaction | |
| 610 | 2 | |a Algorithms | |
| 610 | 2 | |a Models of Computation | |
| 615 | |a @Computer Science |n 11645 |2 Springer | ||
| 676 | |a 004.0151 |v 23 | ||
| 680 | |a QA76.9.M35 | ||
| 700 | 1 | |a Didimo |b Walter |4 651 | |
| 701 | 1 | |a Patrignani |b Maurizio |4 651 | |
| 801 | 3 | |a FR |b Abes |c 20240814 |g AFNOR | |
| 801 | 1 | |a DE |b Springer |c 20240603 |g AACR2 | |
| 856 | 4 | |u https://doi.org/10.1007/978-3-642-36763-2 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://doi.org/10.1007/978-3-642-36763-2 |z Accès sur la plateforme de l'éditeur (Springer) | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-JVFB5DVJ-8 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 441099901:83085763X |u https://budistant.univ-nantes.fr/login?url=https://doi.org/10.1007/978-3-642-36763-2 | |
| 915 | |5 441099901:83085763X |b SPRING13-00782 | ||
| 930 | |5 441099901:83085763X |b 441099901 |j g | ||
| 991 | |5 441099901:83085763X |a Exemplaire créé en masse par ITEM le 30-09-2024 16:14 | ||
| 997 | |a NUM |b SPRING13-00782 |d NUMpivo |e EM |s d | ||
| 998 | |a 978605 | ||