LEADER 04678nam 22007815 450 001 996465629603316 005 20230406040735.0 010 $a1-280-38547-2 010 $a9786613563392 010 $a3-642-11440-7 024 7 $a10.1007/978-3-642-11440-3 035 $a(CKB)2670000000003404 035 $a(EBL)3065030 035 $a(SSID)ssj0000399497 035 $a(PQKBManifestationID)11245777 035 $a(PQKBTitleCode)TC0000399497 035 $a(PQKBWorkID)10376313 035 $a(PQKB)11420156 035 $a(DE-He213)978-3-642-11440-3 035 $a(MiAaPQ)EBC3065030 035 $a(MiAaPQ)EBC6414278 035 $a(PPN)149059426 035 $a(EXLCZ)992670000000003404 100 $a20100305d2010 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aWALCOM: Algorithms and Computation$b[electronic resource] $e4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010, Proceedings /$fedited by Md. Saidur Rahman, Satoshi Fujita 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (317 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5942 300 $aDescription based upon print version of record. 311 $a3-642-11439-3 320 $aIncludes bibliographical references and index. 327 $aInvited 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5942 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aBioinformatics 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aMathematical Applications in Computer Science 606 $aSymbolic and Algebraic Manipulation 606 $aComputational and Systems Biology 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aBioinformatics. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aMathematical Applications in Computer Science. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aComputational and Systems Biology. 676 $a512.0285 702 $aRahman$b Md. Saidur$f1966- 702 $aFujita$b Satoshi 712 12$aWALCOM (Workshop) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a996465629603316 996 $aWALCOM: Algorithms and Computation$9774152 997 $aUNISA