↓ Skip to main content

Algorithms and Data Structures

Overview of attention for book
Cover of 'Algorithms and Data Structures'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 46 Lower bounds to processor-time tradeoffs under bounded-speed message propagation
  3. Altmetric Badge
    Chapter 47 The two-line center problem from a polar view: a new algorithm and data structure
  4. Altmetric Badge
    Chapter 48 On some geometric selection and optimization problems via sorted matrices
  5. Altmetric Badge
    Chapter 49 Load balancing in quorum systems
  6. Altmetric Badge
    Chapter 50 Balanced distributed search trees do not exist
  7. Altmetric Badge
    Chapter 51 Two-floodlight illumination of convex polygons
  8. Altmetric Badge
    Chapter 52 On the complexity of approximating and illuminating three-dimensional convex polyhedra
  9. Altmetric Badge
    Chapter 53 Scheduling jobs that arrive over time
  10. Altmetric Badge
    Chapter 54 Dynamic algorithms for the Dyck languages
  11. Altmetric Badge
    Chapter 55 Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
  12. Altmetric Badge
    Chapter 56 Computing a shortest watchman path in a simple polygon in polynomial-time
  13. Altmetric Badge
    Chapter 57 Going home through an unknown street
  14. Altmetric Badge
    Chapter 58 Page migration with limited local memory capacity
  15. Altmetric Badge
    Chapter 59 Randomized algorithms for metrical task systems
  16. Altmetric Badge
    Chapter 60 Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining
  17. Altmetric Badge
    Chapter 61 Computing common tangents without a separating line
  18. Altmetric Badge
    Chapter 62 Online perfect matching and mobile computing
  19. Altmetric Badge
    Chapter 63 Competitive algorithms for the on-line traveling salesman
  20. Altmetric Badge
    Chapter 64 Quadrangulations of planar sets
  21. Altmetric Badge
    Chapter 65 A linear-time construction of the relative neighborhood graph within a histogram
  22. Altmetric Badge
    Chapter 66 Computing proximity drawings of trees in the 3-dimensional space
  23. Altmetric Badge
    Chapter 67 Routing on trees via matchings
  24. Altmetric Badge
    Chapter 68 A ranking algorithm for Hamilton paths in shuffle-exchange graphs
  25. Altmetric Badge
    Chapter 69 Amortization results for chromatic search trees, with an application to priority queues
  26. Altmetric Badge
    Chapter 70 Fast meldable priority queues
  27. Altmetric Badge
    Chapter 71 On the computation of fast data transmissions in networks with capacities and delays
  28. Altmetric Badge
    Chapter 72 Routing with delays when storage is costly
  29. Altmetric Badge
    Chapter 73 Algorithmic arguments in physics of computation
  30. Altmetric Badge
    Chapter 74 The buffer tree: A new technique for optimal I/O-algorithms
  31. Altmetric Badge
    Chapter 75 Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
  32. Altmetric Badge
    Chapter 76 Computing a dominating pair in an asteroidal triple-free graph in linear time
  33. Altmetric Badge
    Chapter 77 A linear algorithm for the maximal planar subgraph problem
  34. Altmetric Badge
    Chapter 78 Topology B-trees and their applications
  35. Altmetric Badge
    Chapter 79 In-place calculation of minimum-redundancy codes
  36. Altmetric Badge
    Chapter 80 Regular-factors in the complements of partial k-trees
  37. Altmetric Badge
    Chapter 81 Obstructions to within a few vertices or edges of acyclic
  38. Altmetric Badge
    Chapter 82 Faster enumeration of all spanning trees of a directed graph
  39. Altmetric Badge
    Chapter 83 A simpler minimum spanning tree verification algorithm
  40. Altmetric Badge
    Chapter 84 On approximation properties of the Independent set problem for degree 3 graphs
  41. Altmetric Badge
    Chapter 85 Approximation of Constraint Satisfaction via local search
  42. Altmetric Badge
    Chapter 86 On the difficulty of range searching
  43. Altmetric Badge
    Chapter 87 Tables should be sorted (on random access machines)
  44. Altmetric Badge
    Chapter 88 Improved length bounds for the shortest superstring problem
  45. Altmetric Badge
    Chapter 89 Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)
  46. Altmetric Badge
    Chapter 90 Experiences with the implementation of geometric algorithms
Attention for Chapter 89: Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
13 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
Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)
Chapter number 89
Book title
Algorithms and Data Structures
Published in
Lecture notes in computer science, June 2005
DOI 10.1007/3-540-60220-8_89
Book ISBNs
978-3-54-060220-0, 978-3-54-044747-4
Authors

Vineet Bafna, Babu Narayanan, R. Ravi, Bafna, Vineet, Narayanan, Babu, Ravi, R.

Editors

Selim G. Akl, Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 13 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 3 23%
Student > Ph. D. Student 3 23%
Professor 2 15%
Student > Bachelor 1 8%
Other 1 8%
Other 2 15%
Unknown 1 8%
Readers by discipline Count As %
Computer Science 6 46%
Mathematics 2 15%
Agricultural and Biological Sciences 2 15%
Philosophy 1 8%
Engineering 1 8%
Other 0 0%
Unknown 1 8%