↓ Skip to main content

Algorithm Theory - SWAT 2010

Overview of attention for book
Cover of 'Algorithm Theory - SWAT 2010'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Optimal Exploration of Terrains with Obstacles
  3. Altmetric Badge
    Chapter 2 Reconstructing a Simple Polygon from Its Angles
  4. Altmetric Badge
    Chapter 3 Semidefinite Programming and Approximation Algorithms: A Survey
  5. Altmetric Badge
    Chapter 4 Strictly-Regular Number System and Data Structures
  6. Altmetric Badge
    Chapter 5 An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
  7. Altmetric Badge
    Chapter 6 The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition
  8. Altmetric Badge
    Chapter 7 A Bottom-Up Method and Fast Algorithms for max independent set
  9. Altmetric Badge
    Chapter 8 Capacitated Domination Faster Than O(2 n )
  10. Altmetric Badge
    Chapter 9 Isomorphism for Graphs of Bounded Feedback Vertex Set Number
  11. Altmetric Badge
    Chapter 10 On Feedback Vertex Set: New Measure and New Structures
  12. Altmetric Badge
    Chapter 11 Conflict-Free Coloring Made Stronger
  13. Altmetric Badge
    Chapter 12 Polychromatic Coloring for Half-Planes
  14. Altmetric Badge
    Chapter 13 A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
  15. Altmetric Badge
    Chapter 14 Minimum and Maximum against k Lies
  16. Altmetric Badge
    Chapter 15 Feasible and Accurate Algorithms for Covering Semidefinite Programs
  17. Altmetric Badge
    Chapter 16 The Quantitative Analysis of User Behavior Online – Data, Models and Algorithms
  18. Altmetric Badge
    Chapter 17 Systems of Linear Equations over $\mathbb{F}_2$ and Problems Parameterized above Average
  19. Altmetric Badge
    Chapter 18 Capacitated max -Batching with Interval Graph Compatibilities
  20. Altmetric Badge
    Chapter 19 A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
  21. Altmetric Badge
    Chapter 20 Representing a Functional Curve by Curves with Fewer Peaks
  22. Altmetric Badge
    Chapter 21 Bregman Clustering for Separable Instances
  23. Altmetric Badge
    Chapter 22 Improved Methods For Generating Quasi-gray Codes
  24. Altmetric Badge
    Chapter 23 The MST of Symmetric Disk Graphs Is Light
  25. Altmetric Badge
    Chapter 24 Vector Bin Packing with Multiple-Choice
  26. Altmetric Badge
    Chapter 25 Bin Packing with Fixed Number of Bins Revisited
  27. Altmetric Badge
    Chapter 26 Cops and Robber Game without Recharging
  28. Altmetric Badge
    Chapter 27 Path Schematization for Route Sketches
  29. Altmetric Badge
    Chapter 28 Approximation Algorithms for Free-Label Maximization
  30. Altmetric Badge
    Chapter 29 Phase Transitions in Sampling Algorithms and the Underlying Random Structures
  31. Altmetric Badge
    Chapter 30 Polynomial Kernels for Hard Problems on Disk Graphs
  32. Altmetric Badge
    Chapter 31 Faster Parameterized Algorithms for Minor Containment
  33. Altmetric Badge
    Chapter 32 Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
  34. Altmetric Badge
    Chapter 33 Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput
  35. Altmetric Badge
    Chapter 34 Online Function Tracking with Generalized Penalties
  36. Altmetric Badge
    Chapter 35 Better Bounds on Online Unit Clustering
  37. Altmetric Badge
    Chapter 36 Online Selection of Intervals and t-Intervals
  38. Altmetric Badge
    Chapter 37 Approximating the Maximum 3- and 4-Edge-Colorable Subgraph
  39. Altmetric Badge
    Chapter 38 Improved Algorithm for Degree Bounded Survivable Network Design Problem
  40. Altmetric Badge
    Chapter 39 Minimizing the Diameter of a Network Using Shortcut Edges
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 (81st percentile)
  • High Attention Score compared to outputs of the same age and source (95th percentile)

Mentioned by

blogs
1 blog
twitter
1 tweeter
q&a
1 Q&A thread

Readers on

mendeley
4 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
Algorithm Theory - SWAT 2010
Published by
ADS, January 2010
DOI 10.1007/978-3-642-13731-0
ISBNs
978-3-64-213730-3, 978-3-64-213731-0
Editors

Haim Kaplan

Twitter Demographics

The data shown below were collected from the profile of 1 tweeter who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

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

Geographical breakdown

Country Count As %
Brazil 1 25%
Unknown 3 75%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 50%
Student > Master 2 50%
Readers by discipline Count As %
Computer Science 3 75%
Mathematics 1 25%

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 04 June 2014.
All research outputs
#1,478,688
of 13,462,296 outputs
Outputs from ADS
#1,273
of 26,155 outputs
Outputs of similar age
#49,768
of 272,040 outputs
Outputs of similar age from ADS
#8
of 164 outputs
Altmetric has tracked 13,462,296 research outputs across all sources so far. Compared to these this one has done well and is in the 89th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 26,155 research outputs from this source. They receive a mean Attention Score of 4.2. This one has done particularly well, scoring higher than 95% 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 272,040 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 81% of its contemporaries.
We're also able to compare this research output to 164 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 95% of its contemporaries.