000 04324nam a22005775i 4500
001 978-3-642-11440-3
003 DE-He213
005 20240730190425.0
007 cr nn 008mamaa
008 100305s2010 gw | s |||| 0|eng d
020 _a9783642114403
_9978-3-642-11440-3
024 7 _a10.1007/978-3-642-11440-3
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aWALCOM: Algorithms and Computation
_h[electronic resource] :
_b4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010, Proceedings /
_cedited by Md. Saidur Rahman, Satoshi Fujita.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aXIII, 305 p. 72 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5942
505 0 _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.
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aBioinformatics.
_99561
650 1 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aMathematical Applications in Computer Science.
_931683
650 2 4 _aSymbolic and Algebraic Manipulation.
_955589
650 2 4 _aComputational and Systems Biology.
_931619
700 1 _aRahman, Md. Saidur.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_93916
700 1 _aFujita, Satoshi.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9142451
710 2 _aSpringerLink (Online service)
_9142452
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642114397
776 0 8 _iPrinted edition:
_z9783642114410
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5942
_9142453
856 4 0 _uhttps://doi.org/10.1007/978-3-642-11440-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c93247
_d93247