最 低 价：￥650.90
| The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community,with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science research forum available. The scope of LNCS, including its subseries LNAI and LNBI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes -proceedings (published in time for the respective conference) -post-proceedings (consisting of thoroughly revised final full papers) -research monographs (which may be based on outstanding PhD work,research projects, technical reports, etc.) |
| Papers 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 Kn On the Realizable Weaving Patterns of Polynomial Curves in R3 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 …… Software Demonstrations Posters Graph Drawing Contest Invited Talk Author Index |
内容加载中，请稍后...
商品评论（0条）