| 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.) |
| Algorithmic Problems in Wireless Ad Hoc Networks Probability and Recursion Embedding Point Sets into Plane Graphs of Small Dilation The Layered Net Surface Problems in Discrete Geometry and Medical:Image Segmentation Separability with Outliers Casting an Object with a Core Sparse Geometric Graphs with Small Dilation Multiple Polyline to Polygon Matching Minimizing a Monotone Concave Function with Laminar Covering Constraints Almost Optimal Solutions for Bin Coloring Problems GEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive Constraints Simultaneous Matchings An Optimization Problem Related to VoD Broadcasting A Min-Max Relation on Packing Feedback Vertex Sets Average Case Analysis for Tree Labelling Schemes Revisiting T. Uno and M. Yagiura's Algorithm Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends Bisecting a Four-Connected Graph with Three Resource Sets Laminar Structure of Ptolemaic Graphs and Its Applications On the Complexity of the G-Reconstruction Problem Hybrid Voting Protocols and Hardness of Manipulation On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm Correlation Clustering and Consensus Clustering An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints A 1.5-Approximation of the Minimal Manhattan Network Problem …… Errata from ISAAC 2004(LNCS 3341) Author Index |
内容加载中，请稍后...
商品评论（0条）