↓ 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 Future Directions in Computer Science Research
  3. Altmetric Badge
    Chapter 2 Combinatorial Geometry and Approximation Algorithms
  4. Altmetric Badge
    Chapter 3 Origami Robots and Star Trek Replicators
  5. Altmetric Badge
    Chapter 4 Strong Conflict-Free Coloring for Intervals
  6. Altmetric Badge
    Chapter 5 Closing Complexity Gaps for Coloring Problems on H -Free Graphs
  7. Altmetric Badge
    Chapter 6 Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors
  8. Altmetric Badge
    Chapter 7 Reconfiguration of List L (2,1)-Labelings in a Graph
  9. Altmetric Badge
    Chapter 8 An 8/3 Lower Bound for Online Dynamic Bin Packing
  10. Altmetric Badge
    Chapter 9 Computing k -center over Streaming Data for Small k
  11. Altmetric Badge
    Chapter 10 Precision vs Confidence Tradeoffs for ℓ 2 -Based Frequency Estimation in Data Streams
  12. Altmetric Badge
    Chapter 11 Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem
  13. Altmetric Badge
    Chapter 12 A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings
  14. Altmetric Badge
    Chapter 13 Fast and Simple Fully-Dynamic Cut Tree Construction
  15. Altmetric Badge
    Chapter 14 Green Scheduling, Flows and Matchings
  16. Altmetric Badge
    Chapter 15 Popular and Clan-Popular b -Matchings
  17. Altmetric Badge
    Chapter 16 Kernelization and Parameterized Complexity of Star Editing and Union Editing
  18. Altmetric Badge
    Chapter 17 On the Advice Complexity of Buffer Management
  19. Altmetric Badge
    Chapter 18 On the Complexity of the Maximum Common Subgraph Problem for Partial k -Trees of Bounded Degree
  20. Altmetric Badge
    Chapter 19 Speeding Up Shortest Path Algorithms
  21. Altmetric Badge
    Chapter 20 How Many Potatoes Are in a Mesh?
  22. Altmetric Badge
    Chapter 21 On Higher Order Voronoi Diagrams of Line Segments
  23. Altmetric Badge
    Chapter 22 On the Farthest Line-Segment Voronoi Diagram
  24. Altmetric Badge
    Chapter 23 Computing the Longest Common Subsequence of Two Run-Length Encoded Strings
  25. Altmetric Badge
    Chapter 24 Efficient Counting of Square Substrings in a Tree
  26. Altmetric Badge
    Chapter 25 A General Method for Improving Insertion-Based Adaptive Sorting
  27. Altmetric Badge
    Chapter 26 Counting Partitions of Graphs
  28. Altmetric Badge
    Chapter 27 Constant Unary Constraints and Symmetric Real-Weighted Counting CSPs
  29. Altmetric Badge
    Chapter 28 Interval Scheduling and Colorful Independent Sets
  30. Altmetric Badge
    Chapter 29 More on a Problem of Zarankiewicz
  31. Altmetric Badge
    Chapter 30 Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
  32. Altmetric Badge
    Chapter 31 On the Hyperbolicity of Small-World and Tree-Like Random Graphs
  33. Altmetric Badge
    Chapter 32 On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets
  34. Altmetric Badge
    Chapter 33 Induced Immersions
  35. Altmetric Badge
    Chapter 34 Rectilinear Covering for Imprecise Input Points
  36. Altmetric Badge
    Chapter 35 Robust Nonparametric Data Approximation of Point Sets via Data Reduction
  37. Altmetric Badge
    Chapter 36 Optimal Point Movement for Covering Circular Regions
  38. Altmetric Badge
    Chapter 37 Solving Circular Integral Block Decomposition in Polynomial Time
  39. Altmetric Badge
    Chapter 38 The Canadian Traveller Problem Revisited
  40. Altmetric Badge
    Chapter 39 Vehicle Scheduling on a Graph Revisited
  41. Altmetric Badge
    Chapter 40 A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks
  42. Altmetric Badge
    Chapter 41 The Minimum Vulnerability Problem
  43. Altmetric Badge
    Chapter 42 A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic Graphs
  44. Altmetric Badge
    Chapter 43 Cubic Augmentation of Planar Graphs
  45. Altmetric Badge
    Chapter 44 On the Number of Upward Planar Orientations of Maximal Planar Graphs
  46. Altmetric Badge
    Chapter 45 Universal Point Subsets for Planar Graphs
  47. Altmetric Badge
    Chapter 46 Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems
  48. Altmetric Badge
    Chapter 47 Extending Partial Representations of Subclasses of Chordal Graphs
  49. Altmetric Badge
    Chapter 48 Isomorphism for Graphs of Bounded Connected-Path-Distance-Width
  50. Altmetric Badge
    Chapter 49 Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
  51. Altmetric Badge
    Chapter 50 Linear Layouts in Submodular Systems
  52. Altmetric Badge
    Chapter 51 Segmental Mapping and Distance for Rooted Labeled Ordered Trees
  53. Altmetric Badge
    Chapter 52 Detecting Induced Minors in AT-Free Graphs
  54. Altmetric Badge
    Chapter 53 Degree-Constrained Orientations of Embedded Graphs
  55. Altmetric Badge
    Chapter 54 Interval Graph Representation with Given Interval and Intersection Lengths
  56. Altmetric Badge
    Chapter 55 Finger Search in the Implicit Model
  57. Altmetric Badge
    Chapter 56 A Framework for Succinct Labeled Ordinal Trees over Large Alphabets
  58. Altmetric Badge
    Chapter 57 A Space-Efficient Framework for Dynamic Point Location
  59. Altmetric Badge
    Chapter 58 Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting
  60. Altmetric Badge
    Chapter 59 An Improved Algorithm for Static 3D Dominance Reporting in the Pointer Machine
  61. Altmetric Badge
    Chapter 60 The Multi-Service Center Problem
  62. Altmetric Badge
    Chapter 61 Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights
  63. Altmetric Badge
    Chapter 62 Fence Patrolling by Mobile Agents with Distinct Speeds
  64. Altmetric Badge
    Chapter 63 Weak Visibility Queries of Line Segments in Simple Polygons
  65. Altmetric Badge
    Chapter 64 Beyond Homothetic Polygons: Recognition and Maximum Clique
  66. Altmetric Badge
    Chapter 65 Area Bounds of Rectilinear Polygons Realized by Angle Sequences
  67. Altmetric Badge
    Chapter 66 A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication
  68. Altmetric Badge
    Chapter 67 On Almost Disjunct Matrices for Group Testing
  69. Altmetric Badge
    Chapter 67 On Almost Disjunct Matrices for Group Testing
  70. Altmetric Badge
    Chapter 68 Parameterized Clique on Scale-Free Networks
  71. Altmetric Badge
    Chapter 69 Multi-unit Auctions with Budgets and Non-uniform Valuations
  72. Altmetric Badge
    Chapter 70 Efficient Computation of Power Indices for Weighted Majority Games
  73. Altmetric Badge
    Chapter 71 Revenue Maximization in a Bayesian Double Auction Market
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
2 Wikipedia pages

Readers on

mendeley
1 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 2012
DOI 10.1007/978-3-642-35261-4
ISBNs
978-3-64-235260-7, 978-3-64-235261-4
Editors

Chao, Kun-Mao, Hsu, Tsan-sheng, Lee, Der-Tsai

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Librarian 1 100%
Readers by discipline Count As %
Economics, Econometrics and Finance 1 100%