Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Graph Drawing [[electronic resource] ] : 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers / / edited by Walter Didimo, Maurizio Patrignani
| Graph Drawing [[electronic resource] ] : 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers / / edited by Walter Didimo, Maurizio Patrignani |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVI, 582 p. 231 illus.) |
| Disciplina | 006.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Computer networks Computer science User interfaces (Computer systems) Human-computer interaction Discrete Mathematics in Computer Science Computer Communication Networks Models of Computation Symbolic and Algebraic Manipulation User Interfaces and Human Computer Interaction |
| ISBN | 3-642-36763-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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 Graph Recognition -- Interactive Random Graph Generation with Evolutionary Algorithms. |
| Record Nr. | UNISA-996465673403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Drawing : 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers / / edited by Walter Didimo, Maurizio Patrignani
| Graph Drawing : 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers / / edited by Walter Didimo, Maurizio Patrignani |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVI, 582 p. 231 illus.) |
| Disciplina | 006.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Computer networks Computer science User interfaces (Computer systems) Human-computer interaction Discrete Mathematics in Computer Science Computer Communication Networks Models of Computation Symbolic and Algebraic Manipulation User Interfaces and Human Computer Interaction |
| ISBN | 3-642-36763-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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 Graph Recognition -- Interactive Random Graph Generation with Evolutionary Algorithms. |
| Record Nr. | UNINA-9910739418603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph Drawing [[electronic resource] ] : 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008, Revised Papers / / edited by Ioannis G. Tollis, Maurizio Patrignani
| Graph Drawing [[electronic resource] ] : 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008, Revised Papers / / edited by Ioannis G. Tollis, Maurizio Patrignani |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XIV, 460 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Application software Computer science Algorithms Computer graphics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Computer and Information Systems Applications Theory of Computation Computer Graphics Data Science |
| ISBN | 3-642-00219-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Networks in Biology – From Identification, Analysis to Interpretation -- Graph Drawing for Security Visualization -- Papers -- Succinct Greedy Graph Drawing in the Hyperbolic Plane -- An Algorithm to Construct Greedy Drawings of Triangulations -- Crossing and Weighted Crossing Number of Near-Planar Graphs -- Cubic Graphs Have Bounded Slope Parameter -- Unimaximal Sequences of Pairs in Rectangle Visibility Drawing -- Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights -- The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing -- Rapid Multipole Graph Drawing on the GPU -- Clustered Planarity: Clusters with Few Outgoing Edges -- Computing Maximum C-Planar Subgraphs -- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters -- Visual Analysis of One-to-Many Matched Graphs -- Topological Morphing of Planar Graphs -- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges -- Graph Simultaneous Embedding Tool, GraphSET -- Hamiltonian Alternating Paths on Bicolored Double-Chains -- The Binary Stress Model for Graph Drawing -- Efficient Node Overlap Removal Using a Proximity Stress Model -- An Experimental Study on Distance-Based Graph Drawing -- Topology Preserving Constrained Graph Layout -- Embeddability Problems for Upward Planar Digraphs -- A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs -- On the Hardness of Orthogonal-Order Preserving Graph Drawing -- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints -- Placing Text Boxes on Graphs -- Removing Node Overlaps Using Multi-sphere Scheme -- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing -- Connected Rectilinear Graphs on Point Sets -- 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces -- Drawing (Complete) Binary Tanglegrams -- Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem -- Cyclic Leveling of Directed Graphs -- Constrained Point-Set Embeddability of Planar Graphs -- Tree Drawings on the Hexagonal Grid -- Isometric Diamond Subgraphs -- Non-convex Representations of Graphs -- Subdivision Drawings of Hypergraphs -- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three -- Dunnart: A Constraint-Based Network Diagram Authoring Tool -- Posters -- Approximating the Crossing Number of Apex Graphs -- Policy-Aware Visualization of Internet Dynamics -- Enhancing Visualizations of Business Processes -- A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs -- Visualizing the Results of Metabolic Pathway Queries -- Visual Specification of Layout -- Spine Crossing Minimization in Upward Topological Book Embeddings -- ILOG Elixir -- DAGmap View -- Brain Network Analyzer -- Graph Drawing Contest -- Graph Drawing Contest Report. |
| Record Nr. | UNISA-996465940203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph drawing : 16th international symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008, revised papers / / Ioannis G. Tollis, Maurizio Patrignani (Eds.)
| Graph drawing : 16th international symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008, revised papers / / Ioannis G. Tollis, Maurizio Patrignani (Eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg, : Springer-Verlag, 2009 |
| Descrizione fisica | 1 online resource (XIV, 460 p.) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
PatrignaniMaurizio
TollisIoannis G |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer graphics
Computer software Computational complexity Data structures (Computer science) |
| ISBN | 3-642-00219-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Networks in Biology – From Identification, Analysis to Interpretation -- Graph Drawing for Security Visualization -- Papers -- Succinct Greedy Graph Drawing in the Hyperbolic Plane -- An Algorithm to Construct Greedy Drawings of Triangulations -- Crossing and Weighted Crossing Number of Near-Planar Graphs -- Cubic Graphs Have Bounded Slope Parameter -- Unimaximal Sequences of Pairs in Rectangle Visibility Drawing -- Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights -- The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing -- Rapid Multipole Graph Drawing on the GPU -- Clustered Planarity: Clusters with Few Outgoing Edges -- Computing Maximum C-Planar Subgraphs -- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters -- Visual Analysis of One-to-Many Matched Graphs -- Topological Morphing of Planar Graphs -- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges -- Graph Simultaneous Embedding Tool, GraphSET -- Hamiltonian Alternating Paths on Bicolored Double-Chains -- The Binary Stress Model for Graph Drawing -- Efficient Node Overlap Removal Using a Proximity Stress Model -- An Experimental Study on Distance-Based Graph Drawing -- Topology Preserving Constrained Graph Layout -- Embeddability Problems for Upward Planar Digraphs -- A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs -- On the Hardness of Orthogonal-Order Preserving Graph Drawing -- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints -- Placing Text Boxes on Graphs -- Removing Node Overlaps Using Multi-sphere Scheme -- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing -- Connected Rectilinear Graphs on Point Sets -- 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces -- Drawing (Complete) Binary Tanglegrams -- Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem -- Cyclic Leveling of Directed Graphs -- Constrained Point-Set Embeddability of Planar Graphs -- Tree Drawings on the Hexagonal Grid -- Isometric Diamond Subgraphs -- Non-convex Representations of Graphs -- Subdivision Drawings of Hypergraphs -- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three -- Dunnart: A Constraint-Based Network Diagram Authoring Tool -- Posters -- Approximating the Crossing Number of Apex Graphs -- Policy-Aware Visualization of Internet Dynamics -- Enhancing Visualizations of Business Processes -- A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs -- Visualizing the Results of Metabolic Pathway Queries -- Visual Specification of Layout -- Spine Crossing Minimization in Upward Topological Book Embeddings -- ILOG Elixir -- DAGmap View -- Brain Network Analyzer -- Graph Drawing Contest -- Graph Drawing Contest Report. |
| Record Nr. | UNINA-9910484642003321 |
| Berlin ; ; Heidelberg, : Springer-Verlag, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||