↓ 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 Puzzles, Art, and Magic with Algorithms
  3. Altmetric Badge
    Chapter 2 The ABCs of AVDs: Geometric Retrieval Made Simple
  4. Altmetric Badge
    Chapter 3 Pareto Optimality in House Allocation Problems
  5. Altmetric Badge
    Chapter 4 Property-Preserving Data Reconstruction
  6. Altmetric Badge
    Chapter 5 On the Monotone Circuit Complexity of Quadratic Boolean Functions
  7. Altmetric Badge
    Chapter 6 Generalized Function Matching
  8. Altmetric Badge
    Chapter 7 Approximate Distance Oracles for Graphs with Dense Clusters
  9. Altmetric Badge
    Chapter 8 Multicriteria Global Minimum Cuts
  10. Altmetric Badge
    Chapter 9 Polyline Fitting of Planar Points Under Min-sum Criteria
  11. Altmetric Badge
    Chapter 10 A Generalization of Magic Squares with Applications to Digital Halftoning
  12. Altmetric Badge
    Chapter 11 Voronoi Diagrams with a Transportation Network on the Euclidean Plane
  13. Altmetric Badge
    Chapter 12 Structural Alignment of Two RNA Sequences with Lagrangian Relaxation
  14. Altmetric Badge
    Chapter 13 Poly-APX- and PTAS-Completeness in Standard and Differential Approximation
  15. Altmetric Badge
    Chapter 14 Efficient Algorithms for k Maximum Sums
  16. Altmetric Badge
    Chapter 15 Equipartitions of Measures by 2-Fans
  17. Altmetric Badge
    Chapter 16 Augmenting the Edge-Connectivity of a Spider Tree
  18. Altmetric Badge
    Chapter 17 On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks
  19. Altmetric Badge
    Chapter 18 Structural Similarity in Graphs
  20. Altmetric Badge
    Chapter 19 Flexibility of Steiner Trees in Uniform Orientation Metrics
  21. Altmetric Badge
    Chapter 20 Random Access to Advice Strings and Collapsing Results
  22. Altmetric Badge
    Chapter 21 Bounding the Payment of Approximate Truthful Mechanisms
  23. Altmetric Badge
    Chapter 22 The Polymatroid Steiner Problems
  24. Altmetric Badge
    Chapter 23 Geometric Optimization Problems Over Sliding Windows
  25. Altmetric Badge
    Chapter 24 On-Line Windows Scheduling of Temporary Items
  26. Altmetric Badge
    Chapter 25 Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy
  27. Altmetric Badge
    Chapter 26 An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem
  28. Altmetric Badge
    Chapter 27 On the Range Maximum-Sum Segment Query Problem
  29. Altmetric Badge
    Chapter 28 An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs
  30. Altmetric Badge
    Chapter 29 Efficient Job Scheduling Algorithms with Multi-type Contentions
  31. Altmetric Badge
    Chapter 30 Superimposing Voronoi Complexes for Shape Deformation
  32. Altmetric Badge
    Chapter 31 On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem
  33. Altmetric Badge
    Chapter 32 Guarding Art Galleries by Guarding Witnesses
  34. Altmetric Badge
    Chapter 33 On p -Norm Based Locality Measures of Space-Filling Curves
  35. Altmetric Badge
    Chapter 34 Composability of Infinite-State Activity Automata
  36. Altmetric Badge
    Chapter 35 Error Compensation in Leaf Root Problems
  37. Altmetric Badge
    Chapter 36 On Compact and Efficient Routing in Certain Graph Classes
  38. Altmetric Badge
    Chapter 37 Randomized Insertion and Deletion in Point Quad Trees
  39. Altmetric Badge
    Chapter 38 Diagnosis in the Presence of Intermittent Faults
  40. Altmetric Badge
    Chapter 39 Three-Round Adaptive Diagnosis in Binary n -Cubes
  41. Altmetric Badge
    Chapter 40 Fast Algorithms for Comparison of Similar Unordered Trees
  42. Altmetric Badge
    Chapter 41 GCD of Random Linear Forms
  43. Altmetric Badge
    Chapter 42 On the Hardness and Easiness of Random 4-SAT Formulas
  44. Altmetric Badge
    Chapter 43 Minimum Common String Partition Problem: Hardness and Approximations
  45. Altmetric Badge
    Chapter 44 On the Complexity of Network Synchronization
  46. Altmetric Badge
    Chapter 45 Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs
  47. Altmetric Badge
    Chapter 46 Adaptive Spatial Partitioning for Multidimensional Data Streams
  48. Altmetric Badge
    Chapter 47 Paired Pointset Traversal
  49. Altmetric Badge
    Chapter 48 Approximated Two Choices in Randomized Load Balancing
  50. Altmetric Badge
    Chapter 49 Space-Efficient and fast algorithms for multidimensional dominance reporting and counting
  51. Altmetric Badge
    Chapter 50 Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs
  52. Altmetric Badge
    Chapter 51 The Maximum Agreement of Two Nested Phylogenetic Networks
  53. Altmetric Badge
    Chapter 52 Sequences of Radius k : How to Fetch Many Huge Objects into Small Memory for Pairwise Computations
  54. Altmetric Badge
    Chapter 53 New Bounds on Map Labeling with Circular Labels
  55. Altmetric Badge
    Chapter 54 Optimal Buffer Management via Resource Augmentation
  56. Altmetric Badge
    Chapter 55 Oriented Paths in Mixed Graphs
  57. Altmetric Badge
    Chapter 56 Polynomial Deterministic Rendezvous in Arbitrary Graphs
  58. Altmetric Badge
    Chapter 57 Distributions of Points and Large Quadrangles
  59. Altmetric Badge
    Chapter 58 Cutting Out Polygons with Lines and Rays
  60. Altmetric Badge
    Chapter 59 Advantages of Backward Searching — Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays
  61. Altmetric Badge
    Chapter 60 Inner Rectangular Drawings of Plane Graphs
  62. Altmetric Badge
    Chapter 61 Approximating the Minmax Subtree Cover Problem in a Cactus
  63. Altmetric Badge
    Chapter 62 Boundary-Optimal Triangulation Flooding
  64. Altmetric Badge
    Chapter 63 Exact Computation of Polynomial Zeros Expressible by Square Roots
  65. Altmetric Badge
    Chapter 64 Many-to-Many Disjoint Path Covers in a Graph with Faulty Elements
  66. Altmetric Badge
    Chapter 65 An O ( n log n )-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees
  67. Altmetric Badge
    Chapter 66 Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks
  68. Altmetric Badge
    Chapter 67 Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search
  69. Altmetric Badge
    Chapter 68 Dynamic Tree Cross Products
  70. Altmetric Badge
    Chapter 69 Spanners, Weak Spanners, and Power Spanners for Wireless Networks
  71. Altmetric Badge
    Chapter 70 Techniques for Indexing and Querying Temporal Observations for a Collection of Objects
  72. Altmetric Badge
    Chapter 71 Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices
  73. Altmetric Badge
    Chapter 72 The Two-Guard Problem Revisited and Its Generalization
  74. Altmetric Badge
    Chapter 73 Canonical Data Structure for Interval Probe Graphs
  75. Altmetric Badge
    Chapter 74 Efficient Algorithms for the Longest Path Problem
  76. Altmetric Badge
    Chapter 75 Randomized Algorithms for Motif Detection
  77. Altmetric Badge
    Chapter 76 Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation
  78. Altmetric Badge
    Chapter 77 Sweeping Graphs with Large Clique Number
  79. Altmetric Badge
    Chapter 78 A Slightly Improved Sub-cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
3 X users
patent
1 patent
wikipedia
2 Wikipedia pages

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
7 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
Algorithms and Computation
Published by
Springer Science & Business Media, December 2004
DOI 10.1007/b104582
ISBNs
978-3-54-024131-7, 978-3-54-030551-4
Editors

Rudolf Fleischer, Gerhard Trippen

X Demographics

X Demographics

The data shown below were collected from the profiles of 3 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Poland 1 14%
Unknown 6 86%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 57%
Professor 2 29%
Student > Postgraduate 1 14%
Readers by discipline Count As %
Computer Science 6 86%
Unknown 1 14%