↓ Skip to main content

Algorithm Theory - SWAT 2000

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Dynamic Graph Algorithms with Applications
  3. Altmetric Badge
    Chapter 2 Coping with the NP-Hardness of the Graph Bandwidth Problem
  4. Altmetric Badge
    Chapter 3 Toward Complete Genome Data Mining in Computational Biology
  5. Altmetric Badge
    Chapter 4 A New Trade-Off for Deterministic Dictionaries
  6. Altmetric Badge
    Chapter 5 Improved Upper Bounds for Pairing Heaps
  7. Altmetric Badge
    Chapter 6 Maintaining Center and Median in Dynamic Trees
  8. Altmetric Badge
    Chapter 7 Dynamic Planar Convex Hull with Optimal Query Time and O(log n · log log n ) Update Time
  9. Altmetric Badge
    Chapter 8 A Dynamic Algorithm for Maintaining Graph Partitions
  10. Altmetric Badge
    Chapter 9 Data Structures for Maintaining Set Partitions
  11. Altmetric Badge
    Chapter 10 Fixed Parameter Algorithms for P lanar D ominating S et and Related Problems
  12. Altmetric Badge
    Chapter 11 Embeddings of k-Connected Graphs of Pathwidth k
  13. Altmetric Badge
    Chapter 12 On Graph Powers for Leaf-Labeled Trees
  14. Altmetric Badge
    Chapter 13 Recognizing Weakly Triangulated Graphs by Edge Separability
  15. Altmetric Badge
    Chapter 14 Caching for Web Searching
  16. Altmetric Badge
    Chapter 15 On-Line Scheduling with Precedence Constraints
  17. Altmetric Badge
    Chapter 16 Scheduling Jobs Before Shut-Down
  18. Altmetric Badge
    Chapter 17 Resource Augmentation in Load Balancing
  19. Altmetric Badge
    Chapter 18 Fair versus Unrestricted Bin Packing
  20. Altmetric Badge
    Chapter 19 A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs
  21. Altmetric Badge
    Chapter 20 Approximation Algorithms for the Label-Cover MAX and Red-Blue Set Cover Problems
  22. Altmetric Badge
    Chapter 21 Approximation Algorithms for Maximum Linear Arrangement
  23. Altmetric Badge
    Chapter 22 Approximation Algorithms for Clustering to Minimize the Sum of Diameters
  24. Altmetric Badge
    Chapter 23 Robust Matchings and Maximum Clustering
  25. Altmetric Badge
    Chapter 24 The Hospitals/Residents Problem with Ties
  26. Altmetric Badge
    Chapter 25 Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph
  27. Altmetric Badge
    Chapter 26 On the Minimum Augmentation of an ℓ-Connected Graph to a k-Connected Graph
  28. Altmetric Badge
    Chapter 27 Locating Sources to Meet Flow Demands in Undirected Networks
  29. Altmetric Badge
    Chapter 28 Improved Greedy Algorithms for Constructing Sparse Geometric Spanners
  30. Altmetric Badge
    Chapter 29 Computing the Penetration Depth of Two Convex Polytopes in 3D
  31. Altmetric Badge
    Chapter 30 Compact Voronoi Diagrams for Moving Convex Polygons
  32. Altmetric Badge
    Chapter 31 Efficient Expected-Case Algorithms for Planar Point Location
  33. Altmetric Badge
    Chapter 32 A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon
  34. Altmetric Badge
    Chapter 33 The Enhanced Double Digest Problem for DNA Physical Mapping
  35. Altmetric Badge
    Chapter 34 Generalization of a Suffix Tree for RNA Structural Pattern Matching
  36. Altmetric Badge
    Chapter 35 Efficient Computation of All Longest Common Subsequences
  37. Altmetric Badge
    Chapter 36 A Blocked All-Pairs Shortest-Paths Algorithm
  38. Altmetric Badge
    Chapter 37 On External-Memory MST, SSSP, and Multi-way Planar Graph Separation
  39. Altmetric Badge
    Chapter 38 I/O-Space Trade-Offs
  40. Altmetric Badge
    Chapter 39 Optimal Flow Aggregation
  41. Altmetric Badge
    Chapter 40 On the Complexities of the Optimal Rounding Problems of Sequences and Matrices
  42. Altmetric Badge
    Chapter 41 On the Complexity of the Sub-permutation Problem
  43. Altmetric Badge
    Chapter 42 Parallel Attribute-Efficient Learning of Monotone Boolean Functions
  44. Altmetric Badge
    Chapter 43 Max- and Min-Neighborhood Monopolies
  45. Altmetric Badge
    Chapter 44 Optimal Adaptive Fault Diagnosis of Hypercubes
  46. Altmetric Badge
    Chapter 45 Fibonacci Correction Networks
  47. Altmetric Badge
    Chapter 46 Least Adaptive Optimal Search with Unreliable Tests
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
13 Wikipedia pages

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
17 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 2000
Published by
Lecture notes in computer science, March 2002
DOI 10.1007/3-540-44985-x
ISBNs
978-3-54-067690-4, 978-3-54-044985-0
Authors

Doddi, Srinivas R., Marathe, Madhav V., Ravi, Sekharipuram S., Taylor, David S., Widmayer, Peter

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 1 6%
Unknown 16 94%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 12%
Professor 1 6%
Researcher 1 6%
Lecturer > Senior Lecturer 1 6%
Unknown 12 71%
Readers by discipline Count As %
Computer Science 4 24%
Environmental Science 1 6%
Unknown 12 71%
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 31 January 2024.
All research outputs
#7,523,397
of 22,959,818 outputs
Outputs from Lecture notes in computer science
#2,489
of 8,137 outputs
Outputs of similar age
#15,306
of 45,668 outputs
Outputs of similar age from Lecture notes in computer science
#7
of 26 outputs
Altmetric has tracked 22,959,818 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,137 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 45,668 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 26 others from the same source and published within six weeks on either side of this one. This one is in the 19th percentile – i.e., 19% of its contemporaries scored the same or lower than it.