↓ 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 Stable Matching Problems
  3. Altmetric Badge
    Chapter 2 Delaunay Meshing of Surfaces
  4. Altmetric Badge
    Chapter 3 Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction
  5. Altmetric Badge
    Chapter 4 Branching and Treewidth Based Exact Algorithms
  6. Altmetric Badge
    Chapter 5 Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees
  7. Altmetric Badge
    Chapter 6 Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules
  8. Altmetric Badge
    Chapter 7 Flexible Word Design and Graph Labeling
  9. Altmetric Badge
    Chapter 8 Frequency Allocation Problems for Linear Cellular Networks
  10. Altmetric Badge
    Chapter 9 Finite-State Online Algorithms and Their Automated Competitive Analysis
  11. Altmetric Badge
    Chapter 10 Offline Sorting Buffers on Line
  12. Altmetric Badge
    Chapter 11 Approximating Tree Edit Distance Through String Edit Distance
  13. Altmetric Badge
    Chapter 12 A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees
  14. Altmetric Badge
    Chapter 13 Improved Approximation for Single-Sink Buy-at-Bulk
  15. Altmetric Badge
    Chapter 14 Approximability of Partitioning Graphs with Supply and Demand
  16. Altmetric Badge
    Chapter 15 Convex Grid Drawings of Plane Graphs with Rectangular Contours
  17. Altmetric Badge
    Chapter 16 Algorithms on Graphs with Small Dominating Targets
  18. Altmetric Badge
    Chapter 17 Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
  19. Altmetric Badge
    Chapter 18 On Estimating Path Aggregates over Streaming Graphs
  20. Altmetric Badge
    Chapter 19 Diamond Triangulations Contain Spanners of Bounded Degree
  21. Altmetric Badge
    Chapter 20 Optimal Construction of the City Voronoi Diagram
  22. Altmetric Badge
    Chapter 21 Relations Between Two Common Types of Rectangular Tilings
  23. Altmetric Badge
    Chapter 22 Quality Tetrahedral Mesh Generation for Macromolecules
  24. Altmetric Badge
    Chapter 23 On Approximating the TSP with Intersecting Neighborhoods
  25. Altmetric Badge
    Chapter 24 Negation-Limited Complexity of Parity and Inverters
  26. Altmetric Badge
    Chapter 25 The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem
  27. Altmetric Badge
    Chapter 26 Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete
  28. Altmetric Badge
    Chapter 27 Parameterized Problems on Coincidence Graphs
  29. Altmetric Badge
    Chapter 28 On 2-Query Codeword Testing with Near-Perfect Completeness
  30. Altmetric Badge
    Chapter 29 Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance
  31. Altmetric Badge
    Chapter 30 Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications
  32. Altmetric Badge
    Chapter 31 On Locating Disjoint Segments with Maximum Sum of Densities
  33. Altmetric Badge
    Chapter 32 Two-Tier Relaxed Heaps
  34. Altmetric Badge
    Chapter 33 The Interval Liar Game
  35. Altmetric Badge
    Chapter 34 How Much Independent Should Individual Contacts Be to Form a Small–World?
  36. Altmetric Badge
    Chapter 35 Faster Centralized Communication in Radio Networks
  37. Altmetric Badge
    Chapter 36 On the Runtime and Robustness of Randomized Broadcasting
  38. Altmetric Badge
    Chapter 37 Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency
  39. Altmetric Badge
    Chapter 38 Non-cooperative Facility Location and Covering Games
  40. Altmetric Badge
    Chapter 39 Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
  41. Altmetric Badge
    Chapter 40 Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
  42. Altmetric Badge
    Chapter 41 Algorithms for Computing Variants of the Longest Common Subsequence Problem
  43. Altmetric Badge
    Chapter 42 Constructing Labeling Schemes Through Universal Matrices
  44. Altmetric Badge
    Chapter 43 Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions
  45. Altmetric Badge
    Chapter 44 Analyzing Disturbed Diffusion on Networks
  46. Altmetric Badge
    Chapter 45 Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs
  47. Altmetric Badge
    Chapter 46 On Isomorphism and Canonization of Tournaments and Hypertournaments
  48. Altmetric Badge
    Chapter 47 Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem
  49. Altmetric Badge
    Chapter 48 Deterministic Random Walks on the Two-Dimensional Grid
  50. Altmetric Badge
    Chapter 49 Improving Time and Space Complexity for Compressed Pattern Matching
  51. Altmetric Badge
    Chapter 50 Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems
  52. Altmetric Badge
    Chapter 51 A Simple Message Passing Algorithm for Graph Partitioning Problems
  53. Altmetric Badge
    Chapter 52 Minimal Interval Completion Through Graph Exploration
  54. Altmetric Badge
    Chapter 53 Balanced Cut Approximation in Random Geometric Graphs
  55. Altmetric Badge
    Chapter 54 Improved Algorithms for the Minmax-Regret 1-Center Problem
  56. Altmetric Badge
    Chapter 55 On Approximating the Maximum Simple Sharing Problem
  57. Altmetric Badge
    Chapter 56 Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
  58. Altmetric Badge
    Chapter 57 Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems
  59. Altmetric Badge
    Chapter 58 Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii
  60. Altmetric Badge
    Chapter 59 Efficient Prüfer-Like Coding and Counting Labelled Hypertrees
  61. Altmetric Badge
    Chapter 60 Intuitive Algorithms and t -Vertex Cover
  62. Altmetric Badge
    Chapter 61 Politician’s Firefighting
  63. Altmetric Badge
    Chapter 62 Runtime Analysis of a Simple Ant Colony Optimization Algorithm
  64. Altmetric Badge
    Chapter 63 Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems
  65. Altmetric Badge
    Chapter 64 Algorithms and Computation
  66. Altmetric Badge
    Chapter 65 Online Multi-path Routing in a Maze
  67. Altmetric Badge
    Chapter 66 On the On-Line k -Truck Problem with Benefit Maximization
  68. Altmetric Badge
    Chapter 67 Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels
  69. Altmetric Badge
    Chapter 68 Online Packet Admission and Oblivious Routing in Sensor Networks
  70. Altmetric Badge
    Chapter 69 Field Splitting Problems in Intensity-Modulated Radiation Therapy
  71. Altmetric Badge
    Chapter 70 Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy
  72. Altmetric Badge
    Chapter 71 A New Approximation Algorithm for Multidimensional Rectangle Tiling
  73. Altmetric Badge
    Chapter 72 Tessellation of Quadratic Elements
  74. Altmetric Badge
    Chapter 73 Effective Elections for Anonymous Mobile Agents
  75. Altmetric Badge
    Chapter 74 Gathering Asynchronous Oblivious Mobile Robots in a Ring
  76. Altmetric Badge
    Chapter 75 Provably Secure Steganography and the Complexity of Sampling
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

news
1 news outlet
wikipedia
8 Wikipedia pages

Readers on

mendeley
3 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 2006
DOI 10.1007/11940128
ISBNs
978-3-54-049694-6, 978-3-54-049696-0
Editors

Asano, Tetsuo

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 67%
Lecturer 1 33%
Readers by discipline Count As %
Computer Science 3 100%