↓ Skip to main content
What is this page? Embed badge

Algorithms and Data Structures

Overview of attention for book
Cover of 'Algorithms and Data Structures'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Covering Segments with Unit Squares
  3. Altmetric Badge
    Chapter 2 Replica Placement on Bounded Treewidth Graphs
  4. Altmetric Badge
    Chapter 3 Fast Exact Algorithms for Survivable Network Design with Uniform Requirements
  5. Altmetric Badge
    Chapter 4 The Complexity of Tree Partitioning
  6. Altmetric Badge
    Chapter 5 Effectiveness of Local Search for Art Gallery Problems
  7. Altmetric Badge
    Chapter 6 Parameterized Complexity of Geometric Covering Problems Having Conflicts
  8. Altmetric Badge
    Chapter 7 Obedient Plane Drawings for Disk Intersection Graphs
  9. Altmetric Badge
    Chapter 8 $$\delta $$ -Greedy t-spanner
  10. Altmetric Badge
    Chapter 9 Dynamic Graph Coloring
  11. Altmetric Badge
    Chapter 10 Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron
  12. Altmetric Badge
    Chapter 11 An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width
  13. Altmetric Badge
    Chapter 12 Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks
  14. Altmetric Badge
    Chapter 13 A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings
  15. Altmetric Badge
    Chapter 14 Splitting $$B_2$$ -VPG Graphs into Outer-String and Co-Comparability Graphs
  16. Altmetric Badge
    Chapter 15 A Deterministic Algorithm for Online Steiner Tree Leasing
  17. Altmetric Badge
    Chapter 16 The I/O Complexity of Strassen’s Matrix Multiplication with Recomputation
  18. Altmetric Badge
    Chapter 17 Maximum Plane Trees in Multipartite Geometric Graphs
  19. Altmetric Badge
    Chapter 18 Local Routing in Spanners Based on WSPDs
  20. Altmetric Badge
    Chapter 19 Relaxing the Irrevocability Requirement for Online Graph Algorithms
  21. Altmetric Badge
    Chapter 20 Approximating Small Balanced Vertex Separators in Almost Linear Time
  22. Altmetric Badge
    Chapter 21 Balanced Line Separators of Unit Disk Graphs
  23. Altmetric Badge
    Chapter 22 All-Pairs Shortest Paths in Geometric Intersection Graphs
  24. Altmetric Badge
    Chapter 23 The Complexity of Drawing Graphs on Few Lines and Few Planes
  25. Altmetric Badge
    Chapter 24 Modular Circulation and Applications to Traffic Management
  26. Altmetric Badge
    Chapter 25 The Homogeneous Broadcast Problem in Narrow and Wide Strips
  27. Altmetric Badge
    Chapter 26 Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut
  28. Altmetric Badge
    Chapter 27 Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs
  29. Altmetric Badge
    Chapter 28 Capacitated Center Problems with Two-Sided Bounds and Outliers
  30. Altmetric Badge
    Chapter 29 Faster Randomized Worst-Case Update Time for Dynamic Subgraph Connectivity
  31. Altmetric Badge
    Chapter 30 Improved Distance Sensitivity Oracles via Tree Partitioning
  32. Altmetric Badge
    Chapter 31 Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space
  33. Altmetric Badge
    Chapter 32 Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density
  34. Altmetric Badge
    Chapter 33 Fast and Compact Planar Embeddings
  35. Altmetric Badge
    Chapter 34 When Can Graph Hyperbolicity Be Computed in Linear Time?
  36. Altmetric Badge
    Chapter 35 Optimal Query Time for Encoding Range Majority
  37. Altmetric Badge
    Chapter 36 Conditional Lower Bounds for Space/Time Tradeoffs
  38. Altmetric Badge
    Chapter 37 Posimodular Function Optimization
  39. Altmetric Badge
    Chapter 38 How to Play Hot and Cold on a Line
  40. Altmetric Badge
    Chapter 39 Faster Algorithm for Truth Discovery via Range Cover
  41. Altmetric Badge
    Chapter 40 Searching Edges in the Overlap of Two Plane Graphs
  42. Altmetric Badge
    Chapter 41 Improved Average Complexity for Comparison-Based Sorting
  43. Altmetric Badge
    Chapter 42 An EPTAS for Scheduling on Unrelated Machines of Few Different Types
  44. Altmetric Badge
    Chapter 43 A Polynomial Kernel for Distance-Hereditary Vertex Deletion
  45. Altmetric Badge
    Chapter 44 Busy Time Scheduling on a Bounded Number of Machines (Extended Abstract)
  46. Altmetric Badge
    Chapter 45 Algorithms for Covering Multiple Barriers
  47. Altmetric Badge
    Chapter 46 An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space
  48. Altmetric Badge
    Chapter 47 Covering Uncertain Points in a Tree
  49. Altmetric Badge
    Chapter 48 Stochastic Closest-Pair Problem and Most-Likely Nearest-Neighbor Search in Tree Spaces
  50. Altmetric Badge
    Chapter 49 On the Expected Diameter, Width, and Complexity of a Stochastic Convex-Hull
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users
Summary X
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 Data Structures
Published by
Springer, Cham, January 2017
DOI 10.1007/978-3-319-62127-2
ISBNs
978-3-31-962126-5, 978-3-31-962127-2
Editors

Faith Ellen, Antonina Kolokolova, Jörg-Rüdiger Sack

View on publisher site
X Demographics

X Demographics

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

This page is provided by Altmetric.