↓ 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 Geometry and Topology from Point Cloud Data
  3. Altmetric Badge
    Chapter 2 The Disjoint Paths Problem: Algorithm and Structure
  4. Altmetric Badge
    Chapter 3 The Physarum Computer
  5. Altmetric Badge
    Chapter 4 Maximum Betweenness Centrality: Approximability and Tractable Cases
  6. Altmetric Badge
    Chapter 5 Approximation Algorithms for Minimum Chain Vertex Deletion
  7. Altmetric Badge
    Chapter 6 Oblivious Buy-at-Bulk in Planar Graphs
  8. Altmetric Badge
    Chapter 7 The Complexity of Acyclic Subhypergraph Problems
  9. Altmetric Badge
    Chapter 8 Inapproximability of b -Matching in k -Uniform Hypergraphs
  10. Altmetric Badge
    Chapter 9 WALCOM: Algorithms and Computation
  11. Altmetric Badge
    Chapter 10 Efficient Computation of Time-Dependent Centralities in Air Transportation Networks
  12. Altmetric Badge
    Chapter 11 Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices
  13. Altmetric Badge
    Chapter 12 Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point
  14. Altmetric Badge
    Chapter 13 Efficient Top- k Queries for Orthogonal Ranges
  15. Altmetric Badge
    Chapter 14 Range-Aggregate Queries Involving Geometric Aggregation Operations
  16. Altmetric Badge
    Chapter 15 Multi Cover of a Polygon Minimizing the Sum of Areas
  17. Altmetric Badge
    Chapter 16 On the Discrete Unit Disk Cover Problem
  18. Altmetric Badge
    Chapter 17 Clustering with Internal Connectedness
  19. Altmetric Badge
    Chapter 18 Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems
  20. Altmetric Badge
    Chapter 19 De Bruijn Sequences for the Binary Strings with Maximum Density
  21. Altmetric Badge
    Chapter 20 A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs
  22. Altmetric Badge
    Chapter 21 Counting Spanning Trees in Graphs Using Modular Decomposition
  23. Altmetric Badge
    Chapter 22 On Graceful Labelings of Trees
  24. Altmetric Badge
    Chapter 23 Minimum-Layer Drawings of Trees
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
2 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
ADS, February 2011
DOI 10.1007/978-3-642-19094-0
ISBNs
978-3-64-219093-3, 978-3-64-219094-0
Editors

Katoh, Naoki, Kumar, Amit

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users who shared this research output. Click here to find out more about how the information was compiled.
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 16 September 2022.
All research outputs
#18,171,970
of 23,342,232 outputs
Outputs from ADS
#31,535
of 37,953 outputs
Outputs of similar age
#163,859
of 186,399 outputs
Outputs of similar age from ADS
#775
of 846 outputs
Altmetric has tracked 23,342,232 research outputs across all sources so far. This one is in the 19th percentile – i.e., 19% of other outputs scored the same or lower than it.
So far Altmetric has tracked 37,953 research outputs from this source. They receive a mean Attention Score of 4.6. This one is in the 15th percentile – i.e., 15% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 186,399 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 11th percentile – i.e., 11% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 846 others from the same source and published within six weeks on either side of this one. This one is in the 8th percentile – i.e., 8% of its contemporaries scored the same or lower than it.