TY  - BOOK
AU  - Rahman,MdSaidur
AU  - Fujita,Satoshi
ED  - SpringerLink (Online service)
TI  - WALCOM: Algorithms and Computation: 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783642114403
AV  - QA76.9.A43 
U1  - 005.1 23
PY  - 2010///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Computer software
KW  - Computational complexity
KW  - Algebra
KW  - Data processing
KW  - Bioinformatics
KW  - Algorithms
KW  - Computer Science
KW  - Algorithm Analysis and Problem Complexity
KW  - Discrete Mathematics in Computer Science
KW  - Math Applications in Computer Science
KW  - Symbolic and Algebraic Manipulation
KW  - Computational Biology/Bioinformatics
N1  - Invited Talks -- Crossings between Curves with Many Tangencies -- Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon -- Approximation Algorithms for Art Gallery Problems in Polygons and Terrains -- The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing -- Graph Drawing -- Small Grid Drawings of Planar Graphs with Balanced Bipartition -- Switch-Regular Upward Planar Embeddings of Trees -- A Global k-Level Crossing Reduction Algorithm -- Computational Geometry -- Computation of Non-dominated Points Using Compact Voronoi Diagrams -- Cutting a Convex Polyhedron Out of a Sphere -- A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion -- Graph Algorithms I -- Acyclically 3-Colorable Planar Graphs -- Reconstruction Algorithm for Permutation Graphs -- Harmonious Coloring on Subclasses of Colinear Graphs -- Computational Biology and Strings -- Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions -- The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time -- Parallel Algorithms for Encoding and Decoding Blob Code -- Combinatorial Optimization -- A Rooted-Forest Partition with Uniform Vertex Demand -- A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique -- Graph Algorithms II -- On Some Simple Widths -- A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques -- Approximation Algorithms -- The Covert Set-Cover Problem with Application to Network Discovery -- Variants of Spreading Messages -- On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost -- Real Root Isolation of Multi-Exponential Polynomials with Application -- Parameterized Complexity -- FPT Algorithms for Connected Feedback Vertex Set -- A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs -- Pathwidth and Searching in Parameterized Threshold Graphs
UR  - http://dx.doi.org/10.1007/978-3-642-11440-3
ER  -