↓ 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 Mobility and Computations: Some Open Research Directions
  3. Altmetric Badge
    Chapter 2 Adversarial Prediction: Lossless Predictors and Fractal Like Adversaries
  4. Altmetric Badge
    Chapter 3 A Novel Efficient Approach for Solving the Art Gallery Problem
  5. Altmetric Badge
    Chapter 4 Fixed-Orientation Equilateral Triangle Matching of Point Sets
  6. Altmetric Badge
    Chapter 5 Online Exploration and Triangulation in Orthogonal Polygonal Regions
  7. Altmetric Badge
    Chapter 6 A Competitive Strategy for Distance-Aware Online Shape Allocation
  8. Altmetric Badge
    Chapter 7 Base Location Problems for Base-Monotone Regions
  9. Altmetric Badge
    Chapter 8 Counting Maximal Points in a Query Orthogonal Rectangle
  10. Altmetric Badge
    Chapter 9 Voronoi Game on Graphs
  11. Altmetric Badge
    Chapter 10 Approximation Schemes for Covering and Packing
  12. Altmetric Badge
    Chapter 11 A Randomised Approximation Algorithm for the Hitting Set Problem
  13. Altmetric Badge
    Chapter 12 Exact and Approximation Algorithms for Densest k -Subgraph
  14. Altmetric Badge
    Chapter 13 Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs
  15. Altmetric Badge
    Chapter 14 Approximation Algorithms for the Partition Vertex Cover Problem
  16. Altmetric Badge
    Chapter 15 Daemon Conversions in Distributed Self-stabilizing Algorithms
  17. Altmetric Badge
    Chapter 16 Broadcasting in Conflict-Aware Multi-channel Networks
  18. Altmetric Badge
    Chapter 17 Shared-Memory Parallel Frontier-Based Search
  19. Altmetric Badge
    Chapter 18 Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching
  20. Altmetric Badge
    Chapter 19 Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k -Planar Graphs
  21. Altmetric Badge
    Chapter 20 Alliances and Bisection Width for Planar Graphs
  22. Altmetric Badge
    Chapter 21 The Cyclical Scheduling Problem
  23. Altmetric Badge
    Chapter 22 Generalized Rainbow Connectivity of Graphs
  24. Altmetric Badge
    Chapter 23 Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems
  25. Altmetric Badge
    Chapter 24 Lower Bounds for Ramsey Numbers for Complete Bipartite and 3-Uniform Tripartite Subgraphs
  26. Altmetric Badge
    Chapter 25 Improved Fixed-Parameter Algorithm for the Minimum Weight 3-SAT Problem
  27. Altmetric Badge
    Chapter 26 On Directed Tree Realizations of Degree Sets
  28. Altmetric Badge
    Chapter 27 An FPT Algorithm for Tree Deletion Set
  29. Altmetric Badge
    Chapter 28 WALCOM: Algorithms and Computation
  30. Altmetric Badge
    Chapter 29 On Graphs That Are Not PCGs
  31. Altmetric Badge
    Chapter 30 On Embedding of Certain Recursive Trees and Stars into Hypercube
  32. Altmetric Badge
    Chapter 31 Box-Rectangular Drawings of Planar Graphs
Attention for Chapter 28: WALCOM: Algorithms and Computation
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age
  • Above-average Attention Score compared to outputs of the same age and source (55th percentile)

Mentioned by

wikipedia
2 Wikipedia pages

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.
Chapter title
WALCOM: Algorithms and Computation
Chapter number 28
Book title
WALCOM: Algorithms and Computation
Published in
Lecture notes in computer science, January 2013
DOI 10.1007/978-3-642-36065-7_28
Book ISBNs
978-3-64-236064-0, 978-3-64-236065-7
Authors

Subir Kumar Ghosh, Takeshi Tokuyama, Hooman Reisi Dehkordi, Quan Nguyen, Peter Eades, Seok-Hee Hong, Reisi Dehkordi, Hooman, Nguyen, Quan, Eades, Peter, Hong, Seok-Hee

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 50%
Researcher 1 50%
Readers by discipline Count As %
Computer Science 2 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 22 June 2022.
All research outputs
#7,432,447
of 22,721,584 outputs
Outputs from Lecture notes in computer science
#2,490
of 8,125 outputs
Outputs of similar age
#84,168
of 280,761 outputs
Outputs of similar age from Lecture notes in computer science
#100
of 314 outputs
Altmetric has tracked 22,721,584 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,125 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 54% of its peers.
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 280,761 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 46th percentile – i.e., 46% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 314 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 55% of its contemporaries.