LEADER 05186nam 22007575 450 001 996198744003316 005 20230221184218.0 010 $a3-319-15612-8 024 7 $a10.1007/978-3-319-15612-5 035 $a(CKB)3710000000360324 035 $a(SSID)ssj0001452322 035 $a(PQKBManifestationID)11759897 035 $a(PQKBTitleCode)TC0001452322 035 $a(PQKBWorkID)11480478 035 $a(PQKB)11284852 035 $a(DE-He213)978-3-319-15612-5 035 $a(MiAaPQ)EBC6301727 035 $a(MiAaPQ)EBC5579048 035 $a(Au-PeEL)EBL5579048 035 $a(OCoLC)1066184780 035 $a(PPN)184497434 035 $a(EXLCZ)993710000000360324 100 $a20150223d2015 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aWALCOM: Algorithms and Computation$b[electronic resource] $e9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings /$fedited by M. Sohel Rahman, Etsuji Tomita 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (XXIV, 336 p. 110 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8973 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-15611-X 327 $aEncoding Data Structures -- Fast Algorithms for Constrained Graph Density Problems -- The Directed Ring Loading with Penalty Cost -- Edge-Colorings of Weighted Graphs (Extended Abstract) -- Unit Covering in Color-Spanning Set Model -- Compact Encodings and Indexes for the Nearest Larger Neighbor Problem -- A Practical Succinct Data Structure for Tree-Like Graphs -- Forming Plurality at Minimum Cost -- Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs -- Straight-Path Queries in Trajectory Data -- Folding a Paper Strip to Minimize Thickness -- An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments (Extended Abstract) -- PTAS?s for Some Metric p-source Communication Spanning Tree Problems -- Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement -- Enumerating Eulerian Trails via Hamiltonian Path Enumeration -- The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees -- An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks -- Dynamic Online Multiselection in Internal and External Memory -- Competitive Analysis for Multi-objective Online Algorithms -- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends -- An Improved Algorithm for Parameterized Edge Dominating Set Problem -- On Bar (1, j)-Visibility Graphs (Extended Abstract) -- Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs -- Non-repetitive Strings over Alphabet Lists -- Dichotomy Theorems for Homomorphism Polynomials of Graph Classes -- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid -- Threshold Circuits for Global Patterns in 2-Dimensional Maps -- Superset Generation on Decision Diagrams -- On Triangle Cover Contact Graphs -- Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs. 330 $aThis book constitutes the thoroughly refereed conference proceedings of the 9th International Workshop on Algorithms and Computation, WALCOM 2015, held in Dhaka, Bangladesh, in February 2015. The 26 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 85 submissions. The papers are organized in topical sections on approximation algorithms, data structures and algorithms, computational geometry, combinatorial algorithms, distributed and online algorithms, graph drawing and algorithms, combinatorial problems and complexity, and graph enumeration and algorithms. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8973 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer graphics 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aMathematical Applications in Computer Science 606 $aSymbolic and Algebraic Manipulation 606 $aComputer Graphics 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer graphics. 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$aComputer Graphics. 676 $a004 702 $aRahman$b M. Sohel$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aTomita$b Etsuji$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996198744003316 996 $aWALCOM: Algorithms and Computation$9774152 997 $aUNISA