↓ 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 Bubblesort and Juggling Sequences
  3. Altmetric Badge
    Chapter 2 A Proof of the Molecular Conjecture
  4. Altmetric Badge
    Chapter 3 Exact Algorithms for Dominating Clique Problems
  5. Altmetric Badge
    Chapter 4 Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming
  6. Altmetric Badge
    Chapter 5 Exact Algorithms for the Bottleneck Steiner Tree Problem
  7. Altmetric Badge
    Chapter 6 Exact Algorithms for Set Multicover and Multiset Multicover Problems
  8. Altmetric Badge
    Chapter 7 Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
  9. Altmetric Badge
    Chapter 8 Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
  10. Altmetric Badge
    Chapter 9 On Protein Structure Alignment under Distance Constraint
  11. Altmetric Badge
    Chapter 10 A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
  12. Altmetric Badge
    Chapter 11 Max-Coloring Paths: Tight Bounds and Extensions
  13. Altmetric Badge
    Chapter 12 Fréchet Distance Problems in Weighted Regions
  14. Altmetric Badge
    Chapter 13 The Complexity of Solving Stochastic Games on Graphs
  15. Altmetric Badge
    Chapter 14 Computational Complexity of Cast Puzzles
  16. Altmetric Badge
    Chapter 15 New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body
  17. Altmetric Badge
    Chapter 16 Reconstructing Numbers from Pairwise Function Values
  18. Altmetric Badge
    Chapter 17 Hilbert’s Thirteenth Problem and Circuit Complexity
  19. Altmetric Badge
    Chapter 18 Interval Stabbing Problems in Small Integer Ranges
  20. Altmetric Badge
    Chapter 19 Online Sorted Range Reporting
  21. Altmetric Badge
    Chapter 20 Data Structures for Approximate Orthogonal Range Counting
  22. Altmetric Badge
    Chapter 21 Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time
  23. Altmetric Badge
    Chapter 22 Untangled Monotonic Chains and Adaptive Range Search
  24. Altmetric Badge
    Chapter 23 Geodesic Spanners on Polyhedral Surfaces
  25. Altmetric Badge
    Chapter 24 Approximating Points by a Piecewise Linear Function: I
  26. Altmetric Badge
    Chapter 25 Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers
  27. Altmetric Badge
    Chapter 26 Computing the Map of Geometric Minimal Cuts
  28. Altmetric Badge
    Chapter 27 On the Camera Placement Problem
  29. Altmetric Badge
    Chapter 28 Graph Orientations with Set Connectivity Requirements
  30. Altmetric Badge
    Chapter 29 A Linear Vertex Kernel for Maximum Internal Spanning Tree
  31. Altmetric Badge
    Chapter 30 Geometric Minimum Diameter Minimum Cost Spanning Tree Problem
  32. Altmetric Badge
    Chapter 31 On Shortest Disjoint Paths in Planar Graphs
  33. Altmetric Badge
    Chapter 32 An Optimal Labeling for Node Connectivity
  34. Altmetric Badge
    Chapter 33 SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks
  35. Altmetric Badge
    Chapter 34 1-Bounded Space Algorithms for 2-Dimensional Bin Packing
  36. Altmetric Badge
    Chapter 35 On the Advice Complexity of Online Problems
  37. Altmetric Badge
    Chapter 36 Online Knapsack Problems with Limited Cuts
  38. Altmetric Badge
    Chapter 37 Online Paging for Flash Memory Devices
  39. Altmetric Badge
    Chapter 38 Shifting Strategy for Geometric Graphs without Geometry
  40. Altmetric Badge
    Chapter 39 Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics
  41. Altmetric Badge
    Chapter 40 Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time
  42. Altmetric Badge
    Chapter 41 Minimum Covering with Travel Cost
  43. Altmetric Badge
    Chapter 42 Route-Enabling Graph Orientation Problems
  44. Altmetric Badge
    Chapter 43 Complexity of Approximating the Vertex Centroid of a Polyhedron
  45. Altmetric Badge
    Chapter 44 Popular Matchings with Variable Job Capacities
  46. Altmetric Badge
    Chapter 45 On the Tightness of the Buhrman-Cleve-Wigderson Simulation
  47. Altmetric Badge
    Chapter 46 Bounds on Contention Management Algorithms
  48. Altmetric Badge
    Chapter 47 Algorithmic Folding Complexity
  49. Altmetric Badge
    Chapter 48 Min-Energy Scheduling for Aligned Jobs in Accelerate Model
  50. Altmetric Badge
    Chapter 49 Posi-modular Systems with Modulotone Requirements under Permutation Constraints
  51. Altmetric Badge
    Chapter 50 Generalized Reduction to Compute Toric Ideals
  52. Altmetric Badge
    Chapter 51 Linear and Sublinear Time Algorithms for Basis of Abelian Groups
  53. Altmetric Badge
    Chapter 52 Good Programming in Transactional Memory
  54. Altmetric Badge
    Chapter 53 Induced Packing of Odd Cycles in a Planar Graph
  55. Altmetric Badge
    Chapter 54 On the Infinitesimal Rigidity of Bar-and-Slider Frameworks
  56. Altmetric Badge
    Chapter 55 Exploration of Periodically Varying Graphs
  57. Altmetric Badge
    Chapter 56 Parameterized Complexity of Arc-Weighted Directed Steiner Problems
  58. Altmetric Badge
    Chapter 57 Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries
  59. Altmetric Badge
    Chapter 58 Minimum Cycle Bases of Weighted Outerplanar Graphs
  60. Altmetric Badge
    Chapter 59 Bandwidth on AT-Free Graphs
  61. Altmetric Badge
    Chapter 60 Editing Graphs into Disjoint Unions of Dense Clusters
  62. Altmetric Badge
    Chapter 61 A Certifying Algorithm for 3-Colorability of P 5 -Free Graphs
  63. Altmetric Badge
    Chapter 62 Parameterizing Cut Sets in a Graph by the Number of Their Components
  64. Altmetric Badge
    Chapter 63 Inapproximability of Maximal Strip Recovery
  65. Altmetric Badge
    Chapter 64 The Complexity of Perfect Matching Problems on Dense Hypergraphs
  66. Altmetric Badge
    Chapter 65 On Lower Bounds for Constant Width Arithmetic Circuits
  67. Altmetric Badge
    Chapter 66 Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria
  68. Altmetric Badge
    Chapter 67 The Identity Correspondence Problem and Its Applications
  69. Altmetric Badge
    Chapter 68 Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs
  70. Altmetric Badge
    Chapter 69 An Improved Approximation Algorithm for the Traveling Tournament Problem
  71. Altmetric Badge
    Chapter 70 The Fault-Tolerant Facility Allocation Problem
  72. Altmetric Badge
    Chapter 71 Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
  73. Altmetric Badge
    Chapter 72 Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
  74. Altmetric Badge
    Chapter 73 The Directed Hausdorff Distance between Imprecise Point Sets
  75. Altmetric Badge
    Chapter 74 Computing Multidimensional Persistence
  76. Altmetric Badge
    Chapter 75 Locating an Obnoxious Line among Planar Objects
  77. Altmetric Badge
    Chapter 76 Finding Fullerene Patches in Polynomial Time
  78. Altmetric Badge
    Chapter 77 Convex Drawings of Internally Triconnected Plane Graphs on O ( n 2 ) Grids
  79. Altmetric Badge
    Chapter 78 A Self-stabilizing and Local Delaunay Graph Construction
  80. Altmetric Badge
    Chapter 79 Succinct Greedy Geometric Routing in the Euclidean Plane
  81. Altmetric Badge
    Chapter 80 Electric Routing and Concurrent Flow Cutting
  82. Altmetric Badge
    Chapter 81 A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths
  83. Altmetric Badge
    Chapter 82 Strong Robustness of Randomized Rumor Spreading Protocols
  84. Altmetric Badge
    Chapter 83 Data Structures for Range Median Queries
  85. Altmetric Badge
    Chapter 84 Deletion without Rebalancing in Multiway Search Trees
  86. Altmetric Badge
    Chapter 85 Counting in the Presence of Memory Faults
  87. Altmetric Badge
    Chapter 86 A Simple, Fast, and Compact Static Dictionary
  88. Altmetric Badge
    Chapter 87 Reconstructing Polygons from Scanner Data
  89. Altmetric Badge
    Chapter 88 Computing Large Matchings in Planar Graphs with Fixed Minimum Degree
  90. Altmetric Badge
    Chapter 89 Crossing-Free Acyclic Hamiltonian Path Completion for Planar st -Digraphs
  91. Altmetric Badge
    Chapter 90 Covering a Graph with a Constrained Forest (Extended Abstract)
  92. Altmetric Badge
    Chapter 91 Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs
  93. Altmetric Badge
    Chapter 92 Upward Star-Shaped Polyhedral Graphs
  94. Altmetric Badge
    Chapter 93 Conditional Hardness of Approximating Satisfiable Max 3CSP- q
  95. Altmetric Badge
    Chapter 94 The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract)
  96. Altmetric Badge
    Chapter 95 Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
  97. Altmetric Badge
    Chapter 96 Step-Assembly with a Constant Number of Tile Types
  98. Altmetric Badge
    Chapter 97 Lower Bounds on Fast Searching
  99. Altmetric Badge
    Chapter 98 Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity
  100. Altmetric Badge
    Chapter 99 Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O ( n 1 +  ε ) Time
  101. Altmetric Badge
    Chapter 100 PTAS for k -Tour Cover Problem on the Plane for Moderately Large Values of  k
  102. Altmetric Badge
    Chapter 101 Optimal Randomized Algorithm for the Density Selection Problem
  103. Altmetric Badge
    Chapter 102 Algorithms and Computation
  104. Altmetric Badge
    Chapter 103 Worst-Case and Smoothed Analysis of k -Means Clustering with Bregman Divergences
  105. Altmetric Badge
    Chapter 104 Succinct Index for Dynamic Dictionary Matching
  106. Altmetric Badge
    Chapter 105 Range Non-overlapping Indexing
  107. Altmetric Badge
    Chapter 106 Querying Two Boundary Points for Shortest Paths in a Polygonal Domain
  108. Altmetric Badge
    Chapter 107 Pattern Matching for 321-Avoiding Permutations
  109. Altmetric Badge
    Chapter 108 Folding a Better Checkerboard
  110. Altmetric Badge
    Chapter 109 Finding All Approximate Gapped Palindromes
  111. Altmetric Badge
    Chapter 110 General Pseudo-random Generators from Weaker Models of Computation
  112. Altmetric Badge
    Chapter 111 Random Generation and Enumeration of Bipartite Permutation Graphs
  113. Altmetric Badge
    Chapter 112 A Combinatorial Algorithm for Horn Programs
  114. Altmetric Badge
    Chapter 113 Online Maximum Directed Cut
  115. Altmetric Badge
    Chapter 114 Maintaining Nets and Net Trees under Incremental Motion
  116. Altmetric Badge
    Chapter 115 Distributed Scheduling of Parallel Hybrid Computations
  117. Altmetric Badge
    Chapter 116 I/O-Efficient Contour Tree Simplification
  118. Altmetric Badge
    Chapter 117 Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
  119. Altmetric Badge
    Chapter 118 I/O and Space-Efficient Path Traversal in Planar Graphs
  120. Altmetric Badge
    Chapter 119 Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model
  121. Altmetric Badge
    Chapter 120 Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)
  122. Altmetric Badge
    Chapter 121 Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
  123. Altmetric Badge
    Chapter 122 On Partitioning a Graph into Two Connected Subgraphs
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
9 Wikipedia pages
q&a
1 Q&A thread

Citations

dimensions_citation
4 Dimensions

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
Algorithms and Computation
Published by
Springer Berlin Heidelberg, December 2009
DOI 10.1007/978-3-642-10631-6
ISBNs
978-3-64-210630-9, 978-3-64-210631-6
Editors

Dong, Yingfei, Du, Ding-Zhu, Ibarra, Oscar

Mendeley readers

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 %
United Kingdom 1 25%
Austria 1 25%
Unknown 2 50%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 6 150%
Researcher 4 100%
Professor > Associate Professor 2 50%
Student > Master 2 50%
Student > Postgraduate 1 25%
Other 2 50%
Readers by discipline Count As %
Computer Science 13 325%
Mathematics 1 25%
Agricultural and Biological Sciences 1 25%
Social Sciences 1 25%
Engineering 1 25%
Other 0 0%