Algorithms and Computation 算法和计算

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，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.）.

Invited Talk 1
Chain Reconfiguration: The ins and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages
Combinatorial Generation and Optimization（Ⅰ）
Application of M-Convex Submodular Flow Problem to Mathematical Economics
A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling
A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times
Semi-normal Schedulings: improvement on Goemans' Algorithm
Parallel and Distributed Algorithms（Ⅰ）
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
Broadcasting with Universal Lists Revisited：Using Competitive Analysis
On Adaptive Fault Diagnosis for Multiprocessor Systems
On-Line Multicasting in All-Optical Networks
Graph Drawing and Algorithms（Ⅰ）
Enumerating Floorplans with n Rooms
On Min-Max Cycle Bases
On the Minimum Local-Vertex-Connectivity Augmentation in Graphs
Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number
Computational Geometry（Ⅰ）
Quantum Algorithms for intersection and Proximity Problems
BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces
Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees
Tree-Approximations for the Weighted Cost-Distance Problem（Extended Abstract）
Computational Complexity and Cryptology
Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups（Extended Abstract）
Generic Algorithms and Key Agreement Protocols Based on Group Actions
Baire Category and Nowhere Differentiability for Feasible Real Functions
Translation among CNFs，Characteristic Models and Ordered Binary Decision Diagrams
Automata and Formal Languages
Invited Talk 2
Graph Drawing and Algorithms（Ⅱ）
Combinatorial Generation and Optimization（Ⅱ）
Computational Biology and String Matching（Ⅰ）
Computational Geometry（Ⅱ）
Invited Talk 3
Graph Drawing and Algorithms（Ⅲ）
Parallel and Distributed Algorithms（Ⅱ）
Computational Geometry（Ⅲ）
Randomized and Approximation Algorithms
Computational Biology and String Matching（Ⅱ）
Algorithms and Data Structures
Author index