000 04683nam a22005535i 4500
001 vtls000559042
003 RU-ToGU
005 20210922085816.0
007 cr nn 008mamaa
008 170212s2015 gw | s |||| 0|eng d
020 _a9783319156125
_9978-3-319-15612-5
024 7 _a10.1007/978-3-319-15612-5
_2doi
035 _ato000559042
040 _aSpringer
_cSpringer
_dRU-ToGU
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aWALCOM: Algorithms and Computation
_helectronic resource
_b9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings /
_cedited by M. Sohel Rahman, Etsuji Tomita.
260 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _aXXIV, 336 p. 110 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8973
505 0 _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.
520 _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.
650 0 _aComputer Science.
_9155490
650 0 _aAlgorithms.
_9304813
650 0 _aComputer science
_xMathematics.
_9304486
650 0 _aComputer graphics.
_9281357
650 1 4 _aComputer Science.
_9155490
650 2 4 _aAlgorithm Analysis and Problem Complexity.
_9303732
650 2 4 _aDiscrete Mathematics in Computer Science.
_9304816
650 2 4 _aMath Applications in Computer Science.
_9303284
650 2 4 _aSymbolic and Algebraic Manipulation.
_9566359
650 2 4 _aComputer Graphics.
_9281357
650 2 4 _aAlgorithms.
_9304813
700 1 _aRahman, M. Sohel.
_eeditor.
_9465342
700 1 _aTomita, Etsuji.
_eeditor.
_9322334
710 2 _aSpringerLink (Online service)
_9143950
773 0 _tSpringer eBooks
830 0 _aLecture Notes in Computer Science,
_9279505
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-15612-5
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c413824