1 option
WALCOM: Algorithms and Computation : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings / edited by M. Sohel Rahman, Etsuji Tomita.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 8973
- Theoretical Computer Science and General Issues, 2512-2029 ; 8973
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer science-Mathematics.
- Discrete mathematics.
- Computer graphics.
- Discrete Mathematics in Computer Science.
- Mathematical Applications in Computer Science.
- Symbolic and Algebraic Manipulation.
- Computer Graphics.
- Local Subjects:
- Algorithms.
- Discrete Mathematics in Computer Science.
- Mathematical Applications in Computer Science.
- Symbolic and Algebraic Manipulation.
- Computer Graphics.
- Physical Description:
- 1 online resource (XXIV, 336 pages) : 110 illustrations
- Edition:
- 1st ed. 2015.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2015.
- System Details:
- text file PDF
- Summary:
- This 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.
- Contents:
- Encoding 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-15612-5
- 9783319156125
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.