↓ Skip to main content

WALCOM: Algorithms and Computation

Overview of attention for book
Cover of 'WALCOM: Algorithms and Computation'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Encoding Data Structures
  3. Altmetric Badge
    Chapter 2 Fast Algorithms for Constrained Graph Density Problems
  4. Altmetric Badge
    Chapter 3 The Directed Ring Loading with Penalty Cost
  5. Altmetric Badge
    Chapter 4 Edge-Colorings of Weighted Graphs
  6. Altmetric Badge
    Chapter 5 Unit Covering in Color-Spanning Set Model
  7. Altmetric Badge
    Chapter 6 Compact Encodings and Indexes for the Nearest Larger Neighbor Problem
  8. Altmetric Badge
    Chapter 7 A Practical Succinct Data Structure for Tree-Like Graphs
  9. Altmetric Badge
    Chapter 8 Forming Plurality at Minimum Cost
  10. Altmetric Badge
    Chapter 9 Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs
  11. Altmetric Badge
    Chapter 10 Straight-Path Queries in Trajectory Data
  12. Altmetric Badge
    Chapter 11 Folding a Paper Strip to Minimize Thickness
  13. Altmetric Badge
    Chapter 12 An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments
  14. Altmetric Badge
    Chapter 13 PTAS’s for Some Metric p-source Communication Spanning Tree Problems
  15. Altmetric Badge
    Chapter 14 Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement
  16. Altmetric Badge
    Chapter 15 Enumerating Eulerian Trails via Hamiltonian Path Enumeration
  17. Altmetric Badge
    Chapter 16 The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees
  18. Altmetric Badge
    Chapter 17 An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks
  19. Altmetric Badge
    Chapter 18 Dynamic Online Multiselection in Internal and External Memory
  20. Altmetric Badge
    Chapter 19 Competitive Analysis for Multi-objective Online Algorithms
  21. Altmetric Badge
    Chapter 20 Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
  22. Altmetric Badge
    Chapter 21 An Improved Algorithm for Parameterized Edge Dominating Set Problem
  23. Altmetric Badge
    Chapter 22 On Bar (1,j)-Visibility Graphs
  24. Altmetric Badge
    Chapter 23 Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs
  25. Altmetric Badge
    Chapter 24 Non-repetitive Strings over Alphabet Lists
  26. Altmetric Badge
    Chapter 25 Dichotomy Theorems for Homomorphism Polynomials of Graph Classes
  27. Altmetric Badge
    Chapter 26 Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid
  28. Altmetric Badge
    Chapter 27 Threshold Circuits for Global Patterns in 2-Dimensional Maps
  29. Altmetric Badge
    Chapter 28 Superset Generation on Decision Diagrams
  30. Altmetric Badge
    Chapter 29 On Triangle Cover Contact Graphs
  31. Altmetric Badge
    Chapter 30 Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs
  32. Altmetric Badge
    Chapter 31 Erratum: Competitive Analysis for Multi-Objective Online Algorithms
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

googleplus
1 Google+ user

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
3 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
WALCOM: Algorithms and Computation
Published by
Springer International Publishing, January 2015
DOI 10.1007/978-3-319-15612-5
ISBNs
978-3-31-915611-8, 978-3-31-915612-5
Editors

M. Sohel Rahman, Etsuji Tomita

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 33%
Student > Ph. D. Student 1 33%
Student > Doctoral Student 1 33%
Readers by discipline Count As %
Computer Science 2 67%
Unknown 1 33%