↓ Skip to main content

Algorithms and Computation

Overview of attention for book
Cover of 'Algorithms and Computation'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Engineering of Some Bipartite Matching Programs
  3. Altmetric Badge
    Chapter 2 General Splay: A Basic Theory and Calculus
  4. Altmetric Badge
    Chapter 3 Static Dictionaries Supporting Rank
  5. Altmetric Badge
    Chapter 4 Multiple Spin-Block Decisions
  6. Altmetric Badge
    Chapter 5 Asynchronous Random Polling Dynamic Load Balancing
  7. Altmetric Badge
    Chapter 6 Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colarability
  8. Altmetric Badge
    Chapter 7 Hardness of Approximating Independent Domination in Circle Graphs
  9. Altmetric Badge
    Chapter 8 Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs
  10. Altmetric Badge
    Chapter 9 Ordered Binary Decision Diagrams as Knowledge-Bases
  11. Altmetric Badge
    Chapter 10 Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots
  12. Altmetric Badge
    Chapter 11 On-Line Load Balancing of Temporary Tasks Revisited
  13. Altmetric Badge
    Chapter 12 Online Routing in Triangulations
  14. Altmetric Badge
    Chapter 13 The Query Complexity of Program Checking by Constant-Depth Circuits
  15. Altmetric Badge
    Chapter 14 Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle
  16. Altmetric Badge
    Chapter 15 Efficient Approximation Algorithms for Multi-label Map Labeling
  17. Altmetric Badge
    Chapter 16 Approximation Algorithms in Batch Processing
  18. Altmetric Badge
    Chapter 17 LexBFS-Ordering in Asteroidal Triple-Free Graphs
  19. Altmetric Badge
    Chapter 18 Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs
  20. Altmetric Badge
    Chapter 19 Approximation Algorithms for Some Clustering and Classification Problems
  21. Altmetric Badge
    Chapter 20 How Many People Can Hide in a Terrain?
  22. Altmetric Badge
    Chapter 21 Carrying Umbrellas: An Online Relocation Problem on Graphs
  23. Altmetric Badge
    Chapter 22 Survivable Networks with Bounded Delay: The Edge Failure Case
  24. Altmetric Badge
    Chapter 23 Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks
  25. Altmetric Badge
    Chapter 24 Constructing the Suffix Tree of a Tree with a Large Alphabet
  26. Altmetric Badge
    Chapter 25 An O (1) Time Algorithm for Generating Multiset Permutations
  27. Altmetric Badge
    Chapter 26 Upper Bounds for MaxSat: Further Improved
  28. Altmetric Badge
    Chapter 27 A Linear Time Algorithm for Recognizing Regular Boolean Functions
  29. Altmetric Badge
    Chapter 28 Station Layouts in the Presence of Location Constraints
  30. Altmetric Badge
    Chapter 29 Reverse Center Location Problem
  31. Altmetric Badge
    Chapter 30 Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields
  32. Altmetric Badge
    Chapter 31 External Memory Algorithms for Outerplanar Graphs
  33. Altmetric Badge
    Chapter 32 A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree
  34. Altmetric Badge
    Chapter 33 Approximation Algorithms for Channel Assignment with Constraints
  35. Altmetric Badge
    Chapter 34 Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs
  36. Altmetric Badge
    Chapter 35 A Linear Algorithm for Finding Total Colorings of Partial k-Trees
  37. Altmetric Badge
    Chapter 36 Topology-Oriented Approach to Robust Geometric Computation
  38. Altmetric Badge
    Chapter 37 Approximating Multicast Congestion
  39. Altmetric Badge
    Chapter 38 Approximating the Minimum k -way Cut in a Graph via Minimum 3-way Cuts
  40. Altmetric Badge
    Chapter 39 Online Scheduling of Parallel Communications with Individual Deadlines
  41. Altmetric Badge
    Chapter 40 A Faster Algorithm for Finding Disjoint Paths in Grids
  42. Altmetric Badge
    Chapter 41 Output-Sensitive Algorithms for Uniform Partitions of Points
  43. Altmetric Badge
    Chapter 42 Convexifying Monotone Polygons
  44. Altmetric Badge
    Chapter 43 Bisecting Two Subsets in 3-Connected Graphs
  45. Altmetric Badge
    Chapter 44 Generalized Maximum Independent Sets for Trees in Subquadratic Time
Attention for Chapter 36: Topology-Oriented Approach to Robust Geometric Computation
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 (83rd percentile)
  • Above-average Attention Score compared to outputs of the same age and source (55th percentile)

Mentioned by

blogs
1 blog

Readers on

mendeley
2 Mendeley
citeulike
1 CiteULike
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
Topology-Oriented Approach to Robust Geometric Computation
Chapter number 36
Book title
Algorithms and Computation
Published in
Lecture notes in computer science, January 1999
DOI 10.1007/3-540-46632-0_36
Book ISBNs
978-3-54-066916-6, 978-3-54-046632-1
Authors

Kokichi Sugihara, Sugihara, Kokichi

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 %
Professor 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 6. 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 23 November 2010.
All research outputs
#5,629,717
of 22,727,570 outputs
Outputs from Lecture notes in computer science
#1,836
of 8,126 outputs
Outputs of similar age
#16,027
of 98,907 outputs
Outputs of similar age from Lecture notes in computer science
#9
of 20 outputs
Altmetric has tracked 22,727,570 research outputs across all sources so far. Compared to these this one has done well and is in the 75th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 8,126 research outputs from this source. They receive a mean Attention Score of 5.0. This one has done well, scoring higher than 77% 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 98,907 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 83% of its contemporaries.
We're also able to compare this research output to 20 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.