{ "item_title" : "Graph Drawing and Network Visualization", "item_author" : [" Therese Biedl", "Andreas Kerren "], "item_description" : "Invited Talk.- Image-Based Graph Visualization: Advances and Challenges.- Planarity Variants.- Clustered Planarity = Flat Clustered Planarity.- Level Planarity: Transitivity vs. Even Crossings.- Short Plane Supports for Spatial Hypergraphs.- Turning Cliques into Paths to Achieve Planarity.- Upward Drawings.- Universal Slope Sets for Upward Planar Drawings.- Upward Planar Morphs.- Visualizing the Template of a Chaotic Attractor.- RAC drawings.- On RAC Drawings of Graphs with one Bend per Edge.- Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends.- Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles.- Best paper Track 2.- Aesthetic Discrimination of Graph Layouts.- Orders.- A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width.- The Queue-Number of Posets of Bounded Width or Height.- Queue Layouts of Planar 3-Trees.- Crossings.- Crossing Minimization in Perturbed Drawings.- The Number of Crossings in Multigraphs with No Empty Lens.- Crossing Numbers and Stress of Random Graphs.- Crossing angles.- A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution.- A Greedy Heuristic for Crossing-Angle Maximization.- Contact representations.- Recognition and Drawing of Stick Graphs.- On Contact Graphs of Paths on a Grid.- Specialized graphs and trees.- On the Area-Universality of Triangulations.- Monotone Drawings of k-Inner Planar Graphs.- On L-shaped Point Set Embeddings of Trees: First Non-embeddable Examples.- How to Fit a Tree in a Box.- Best paper Track 1.- Pole Dancing: 3D Morphs for Tree Drawings.- Partially fixed drawings.- The Complexity of Drawing a Graph in a Polygonal Region.- Inserting an Edge into a Geometric Embedding.- β-Stars or On Extending a Drawing of a Connected Subgraph.- Experiments.- Perception of Symmetries in Drawings of Graphs.- Network Alignment by Discrete Ollivier-Ricci Flow.- Same Stats, Different Graphs (Graph Statistics and Why We Need Graph Drawings).- Orthogonal drawings.- Bend-minimum Orthogonal Drawings in Quadratic Time.- Greedy Rectilinear Drawings.- Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity.- Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs.- Realizability.- Realization and Connectivity of the Graphs of Origami Flat Foldings.- Arrangements of Pseudocircles: On Circularizability.- The Weighted Barycenter Drawing Recognition Problem.- Miscellaneous.- Algorithms and Bounds for Drawing Directed Graphs.- Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity.- Graph Drawing Contest Report.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/3/03/004/413/3030044130_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }

Overview

Customers Also Bought

Details