000725927 000__ 04687cam\a2200517Ii\4500
000725927 001__ 725927
000725927 005__ 20230306140704.0
000725927 006__ m\\\\\o\\d\\\\\\\\
000725927 007__ cr\cn\nnnunnun
000725927 008__ 150305s2015\\\\sz\a\\\\ob\\\\101\0\eng\d
000725927 020__ $$a9783319156125$$qelectronic book
000725927 020__ $$a3319156128$$qelectronic book
000725927 020__ $$z9783319156118
000725927 0247_ $$a10.1007/978-3-319-15612-5$$2doi
000725927 035__ $$aSP(OCoLC)ocn904399317
000725927 035__ $$aSP(OCoLC)904399317
000725927 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dUPM$$dBTCTA$$dCOO$$dYDXCP$$dOCLCF$$dOCLCO$$dVLB
000725927 049__ $$aISEA
000725927 050_4 $$aQA76.9.A43$$bW35 2015eb
000725927 08204 $$a005.1$$223
000725927 1112_ $$aWALCOM (Workshop)$$n(9th :$$d2015 :$$cDhaka, Bangladesh)
000725927 24510 $$aWALCOM$$h[electronic resource] :$$balgorithms and computation : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings /$$cedited by M. Sohel Rahman, Etsuji Tomita.
000725927 2463_ $$aWALCOM 2015
000725927 264_1 $$aCham :$$bSpringer,$$c2015.
000725927 300__ $$a1 online resource (xxiv, 336 pages) :$$billustrations.
000725927 336__ $$atext$$btxt$$2rdacontent
000725927 337__ $$acomputer$$bc$$2rdamedia
000725927 338__ $$aonline resource$$bcr$$2rdacarrier
000725927 4901_ $$aLecture notes in computer science,$$x0302-9743 ;$$v8973
000725927 4901_ $$aLNCS sublibrary. SL 1, Theoretical computer science and general issues
000725927 500__ $$aInternational conference proceedings.
000725927 504__ $$aIncludes bibliographical references and author index.
000725927 5050_ $$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.
000725927 506__ $$aAccess limited to authorized users.
000725927 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.
000725927 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed March 5, 2015).
000725927 650_0 $$aComputer algorithms$$vCongresses.
000725927 7001_ $$aRahman, M. Sohel,$$eeditor.
000725927 7001_ $$aTomita, Etsuji,$$eeditor.
000725927 77608 $$iPrint version:$$z9783319156118
000725927 830_0 $$aLecture notes in computer science ;$$v8973.
000725927 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
000725927 852__ $$bebk
000725927 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-15612-5$$zOnline Access$$91397441.1
000725927 909CO $$ooai:library.usi.edu:725927$$pGLOBAL_SET
000725927 980__ $$aEBOOK
000725927 980__ $$aBIB
000725927 982__ $$aEbook
000725927 983__ $$aOnline
000725927 994__ $$a92$$bISE