↓ 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 Line-Constrained \(k\) -Median, \(k\) -Means, and \(k\) -Center Problems in the Plane
  3. Altmetric Badge
    Chapter 2 Reconstructing Point Set Order Typesfrom Radial Orderings
  4. Altmetric Badge
    Chapter 3 A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams
  5. Altmetric Badge
    Chapter 4 Average-Case Complexity of the Min-Sum Matrix Product Problem
  6. Altmetric Badge
    Chapter 5 Efficiently Correcting Matrix Products
  7. Altmetric Badge
    Chapter 6 3D Rectangulations and Geometric Matrix Multiplication
  8. Altmetric Badge
    Chapter 7 Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay
  9. Altmetric Badge
    Chapter 8 Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph
  10. Altmetric Badge
    Chapter 9 An Efficient Method for Indexing All Topological Orders of a Directed Graph
  11. Altmetric Badge
    Chapter 10 Planar Matchings for Weighted Straight Skeletons
  12. Altmetric Badge
    Chapter 11 Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries
  13. Altmetric Badge
    Chapter 12 Dynamic and Multi-Functional Labeling Schemes
  14. Altmetric Badge
    Chapter 13 Hashing and Indexing: Succinct DataStructures and Smoothed Analysis
  15. Altmetric Badge
    Chapter 14 Top- \(k\) Term-Proximity in Succinct Space
  16. Altmetric Badge
    Chapter 15 The Power and Limitations of Static Binary Search Trees with Lazy Finger
  17. Altmetric Badge
    Chapter 16 Minimum-Cost \(b\) -Edge Dominating Sets on Trees
  18. Altmetric Badge
    Chapter 17 Fixed-Parameter Tractability of Token Jumping on Planar Graphs
  19. Altmetric Badge
    Chapter 18 Covering Problems for Partial Words and for Indeterminate Strings
  20. Altmetric Badge
    Chapter 19 Dynamic Interval Scheduling for Multiple Machines
  21. Altmetric Badge
    Chapter 20 Throughput Maximization in Multiprocessor Speed-Scaling
  22. Altmetric Badge
    Chapter 21 Speed-Scaling with No Preemptions
  23. Altmetric Badge
    Chapter 22 A Short Implicant of a CNF Formula with Many Satisfying Assignments
  24. Altmetric Badge
    Chapter 23 On the Computational Complexity of Vertex Integrity and Component Order Connectivity
  25. Altmetric Badge
    Chapter 24 Co-Clustering Under the Maximum Norm
  26. Altmetric Badge
    Chapter 25 The Price of Order
  27. Altmetric Badge
    Chapter 26 Range Queries on Uncertain Data
  28. Altmetric Badge
    Chapter 27 On the Most Likely Voronoi Diagramand Nearest Neighbor Searching
  29. Altmetric Badge
    Chapter 28 An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem
  30. Altmetric Badge
    Chapter 29 Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography
  31. Altmetric Badge
    Chapter 30 An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral
  32. Altmetric Badge
    Chapter 31 Polynomial-Time Algorithm for Sliding Tokens on Trees
  33. Altmetric Badge
    Chapter 32 Minimal Obstructions for Partial Representations of Interval Graphs
  34. Altmetric Badge
    Chapter 33 Faster Algorithms for Computing the R* Consensus Tree
  35. Altmetric Badge
    Chapter 34 Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs
  36. Altmetric Badge
    Chapter 35 Faster Existential FO Model Checking on Posets
  37. Altmetric Badge
    Chapter 36 Vertex Cover Reconfiguration and Beyond
  38. Altmetric Badge
    Chapter 37 Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover
  39. Altmetric Badge
    Chapter 38 Approximation Algorithms Inspired by Kernelization Methods
  40. Altmetric Badge
    Chapter 39 An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
  41. Altmetric Badge
    Chapter 40 Lower bounds for on-line graph colorings
  42. Altmetric Badge
    Chapter 41 An On-line Competitive Algorithm for Coloring \(P_8\) -free Bipartite Graphs
  43. Altmetric Badge
    Chapter 42 Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization
  44. Altmetric Badge
    Chapter 43 Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes
  45. Altmetric Badge
    Chapter 44 Depth-First Search Using \(O(n)\) Bits
  46. Altmetric Badge
    Chapter 45 Dynamic Path Counting and Reporting in Linear Space
  47. Altmetric Badge
    Chapter 46 Linear-Time Algorithms for Proportional Apportionment
  48. Altmetric Badge
    Chapter 47 Rank-Maximal Matchings – Structure and Algorithms
  49. Altmetric Badge
    Chapter 48 The Generalized Popular Condensation Problem
  50. Altmetric Badge
    Chapter 49 Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs
  51. Altmetric Badge
    Chapter 50 Planar Embeddings with Small and Uniform Faces
  52. Altmetric Badge
    Chapter 51 Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties
  53. Altmetric Badge
    Chapter 52 Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol
  54. Altmetric Badge
    Chapter 53 A Geometric Approach to Graph Isomorphism
  55. Altmetric Badge
    Chapter 54 Algorithms and Computation
  56. Altmetric Badge
    Chapter 55 Euclidean TSP with Few Inner Points in Linear Space
  57. Altmetric Badge
    Chapter 56 Bottleneck Partial-Matching Voronoi Diagrams and Applications
  58. Altmetric Badge
    Chapter 57 Ham-Sandwich Cuts for Abstract Order Types
  59. Altmetric Badge
    Chapter 58 Algorithms and Computation
  60. Altmetric Badge
    Chapter 59 A Simple Efficient Interior Point Method for Min-Cost Flow
  61. Altmetric Badge
    Chapter 60 Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
11 X users

Citations

dimensions_citation
5 Dimensions

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 International Publishing, January 2014
DOI 10.1007/978-3-319-13075-0
ISBNs
978-3-31-913074-3, 978-3-31-913075-0
Editors

Hee-Kap Ahn, Chan-Su Shin

X Demographics

X Demographics

The data shown below were collected from the profiles of 11 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 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 1 33%
Student > Bachelor 1 33%
Unknown 1 33%
Readers by discipline Count As %
Mathematics 1 33%
Biochemistry, Genetics and Molecular Biology 1 33%
Unknown 1 33%