↓ Skip to main content

Frontiers in Algorithmics

Overview of attention for book
Cover of 'Frontiers in Algorithmics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Progress on Certifying Algorithms
  3. Altmetric Badge
    Chapter 2 Computational Geometry for Uncertain Data
  4. Altmetric Badge
    Chapter 3 On Foundations of Services Interoperation in Cloud Computing
  5. Altmetric Badge
    Chapter 4 Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets
  6. Altmetric Badge
    Chapter 5 Truthful Auction for CPU Time Slots
  7. Altmetric Badge
    Chapter 6 Top-d Rank Aggregation in Web Meta-search Engine
  8. Altmetric Badge
    Chapter 7 Minimum Common String Partition Revisited
  9. Altmetric Badge
    Chapter 8 Inapproximability of Maximal Strip Recovery: II
  10. Altmetric Badge
    Chapter 9 Minimizing Total Variation for Field Splitting with Feathering in Intensity-Modulated Radiation Therapy
  11. Altmetric Badge
    Chapter 10 Approximation Schemes for Scheduling with Availability Constraints
  12. Altmetric Badge
    Chapter 11 An $\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon})$ Space Lower Bound for Finding ε-Approximate Quantiles in a Data Stream
  13. Altmetric Badge
    Chapter 12 Improved Sublinear Time Algorithm for Width-Bounded Separators
  14. Altmetric Badge
    Chapter 13 Constant Time Generation of Biconnected Rooted Plane Graphs
  15. Altmetric Badge
    Chapter 14 Solving General Lattice Puzzles
  16. Altmetric Badge
    Chapter 15 A Hybrid Graph Representation for Recursive Backtracking Algorithms
  17. Altmetric Badge
    Chapter 16 On Tractable Exponential Sums
  18. Altmetric Badge
    Chapter 17 Recognizing d-Interval Graphs and d-Track Interval Graphs
  19. Altmetric Badge
    Chapter 18 Categorial Semantics of a Solution to Distributed Dining Philosophers Problem
  20. Altmetric Badge
    Chapter 19 Approximation Algorithms for the Capacitated Domination Problem
  21. Altmetric Badge
    Chapter 20 A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle
  22. Altmetric Badge
    Chapter 21 FPTAS’s for Some Cut Problems in Weighted Trees
  23. Altmetric Badge
    Chapter 22 Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks
  24. Altmetric Badge
    Chapter 23 Online Algorithms for the Newsvendor Problem with and without Censored Demands
  25. Altmetric Badge
    Chapter 24 O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems
  26. Altmetric Badge
    Chapter 25 Path Separability of Graphs
  27. Altmetric Badge
    Chapter 26 Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings
  28. Altmetric Badge
    Chapter 27 Computing Minimum Diameter Color-Spanning Sets
  29. Altmetric Badge
    Chapter 28 Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-overlapping Axis-Aligned Squares
  30. Altmetric Badge
    Chapter 29 Optimum Sweeps of Simple Polygons with Two Guards
  31. Altmetric Badge
    Chapter 30 Adaptive Algorithms for Planar Convex Hull Problems
  32. Altmetric Badge
    Chapter 31 New Algorithms for Barrier Coverage with Mobile Sensors
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (90th percentile)
  • High Attention Score compared to outputs of the same age and source (92nd percentile)

Mentioned by

blogs
1 blog
wikipedia
2 Wikipedia pages

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
1 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
Frontiers in Algorithmics
Published by
ADS, January 2010
DOI 10.1007/978-3-642-14553-7
ISBNs
978-3-64-214552-0, 978-3-64-214553-7
Editors

Der-Tsai Lee, Danny Z. Chen, Shi Ying

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

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

Attention Score in Context

This research output has an Altmetric Attention Score of 11. 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 19 August 2019.
All research outputs
#2,960,309
of 23,008,860 outputs
Outputs from ADS
#1,925
of 37,436 outputs
Outputs of similar age
#15,605
of 164,911 outputs
Outputs of similar age from ADS
#62
of 795 outputs
Altmetric has tracked 23,008,860 research outputs across all sources so far. Compared to these this one has done well and is in the 87th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 37,436 research outputs from this source. They receive a mean Attention Score of 4.6. This one has done particularly well, scoring higher than 94% 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 164,911 tracked outputs that were published within six weeks on either side of this one in any source. This one has done particularly well, scoring higher than 90% of its contemporaries.
We're also able to compare this research output to 795 others from the same source and published within six weeks on either side of this one. This one has done particularly well, scoring higher than 92% of its contemporaries.