↓ 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 Market Approach to Social Ads: The MyLikes Example and Related Problems
  3. Altmetric Badge
    Chapter 2 Geodesic-Preserving Polygon Simplification
  4. Altmetric Badge
    Chapter 3 Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information
  5. Altmetric Badge
    Chapter 4 On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs
  6. Altmetric Badge
    Chapter 5 Algorithms and Computation
  7. Altmetric Badge
    Chapter 6 Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms
  8. Altmetric Badge
    Chapter 7 Single and Multiple Consecutive Permutation Motif Search
  9. Altmetric Badge
    Chapter 8 Beating $\mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern Matching
  10. Altmetric Badge
    Chapter 9 Less Space: Indexing for Queries with Wildcards
  11. Altmetric Badge
    Chapter 10 On Determining Deep Holes of Generalized Reed-Solomon Codes
  12. Altmetric Badge
    Chapter 11 Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes
  13. Altmetric Badge
    Chapter 12 Determinantal Complexities and Field Extensions
  14. Altmetric Badge
    Chapter 13 Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs
  15. Altmetric Badge
    Chapter 14 Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs
  16. Altmetric Badge
    Chapter 15 The Complexity of Finding a Large Subgraph under Anonymity Constraints
  17. Altmetric Badge
    Chapter 16 On the Number of Edges of Fan-Crossing Free Graphs
  18. Altmetric Badge
    Chapter 17 Cops and Robbers on Intersection Graphs
  19. Altmetric Badge
    Chapter 18 SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs
  20. Altmetric Badge
    Chapter 19 Hardness and Algorithms for Variants of Line Graphs of Directed Graphs
  21. Altmetric Badge
    Chapter 20 Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds
  22. Altmetric Badge
    Chapter 21 Better Bounds for Online k-Frame Throughput Maximization in Network Switches
  23. Altmetric Badge
    Chapter 22 The Solvable Cases of a Scheduling Algorithm
  24. Altmetric Badge
    Chapter 23 Exact Sublinear Binomial Sampling
  25. Altmetric Badge
    Chapter 24 Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas
  26. Altmetric Badge
    Chapter 25 Dynamic Point Labeling is Strongly PSPACE-Complete
  27. Altmetric Badge
    Chapter 26 Unsatisfiable CNF Formulas contain Many Conflicts
  28. Altmetric Badge
    Chapter 27 Pursuit Evasion on Polyhedral Surfaces
  29. Altmetric Badge
    Chapter 28 Algorithms for Tolerated Tverberg Partitions
  30. Altmetric Badge
    Chapter 29 Abstract Voronoi Diagrams with Disconnected Regions
  31. Altmetric Badge
    Chapter 30 Terrain visibility with multiple viewpoints
  32. Altmetric Badge
    Chapter 31 Exact Algorithms for Maximum Independent Set
  33. Altmetric Badge
    Chapter 32 On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs
  34. Altmetric Badge
    Chapter 33 Testing Mutual Duality of Planar Graphs
  35. Altmetric Badge
    Chapter 34 Effective and Efficient Data Reduction for the Subset Interconnection Design Problem
  36. Altmetric Badge
    Chapter 35 Myhill-Nerode Methods for Hypergraphs
  37. Altmetric Badge
    Chapter 36 Augmenting Graphs to Minimize the Diameter
  38. Altmetric Badge
    Chapter 37 Top-k Document Retrieval in Compact Space and Near-Optimal Time
  39. Altmetric Badge
    Chapter 38 Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers
  40. Altmetric Badge
    Chapter 39 Trajectory-Based Dynamic Map Labeling
  41. Altmetric Badge
    Chapter 40 Asynchronous Rumor Spreading on Random Graphs
  42. Altmetric Badge
    Chapter 41 Unit Cost Buyback Problem
  43. Altmetric Badge
    Chapter 42 Faster Rumor Spreading with Multiple Calls
  44. Altmetric Badge
    Chapter 43 Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy
  45. Altmetric Badge
    Chapter 44 Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items
  46. Altmetric Badge
    Chapter 45 New Results on the Online Pricing Problem
  47. Altmetric Badge
    Chapter 46 RAM-Efficient External Memory Sorting
  48. Altmetric Badge
    Chapter 47 Succinct Data Structures for Representing Equivalence Classes
  49. Altmetric Badge
    Chapter 48 Sliding Bloom Filters
  50. Altmetric Badge
    Chapter 49 Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs
  51. Altmetric Badge
    Chapter 50 Bounded Representations of Interval and Proper Interval Graphs
  52. Altmetric Badge
    Chapter 51 Detecting and Counting Small Pattern Graphs
  53. Altmetric Badge
    Chapter 52 An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching
  54. Altmetric Badge
    Chapter 53 New Inapproximability Bounds for TSP
  55. Altmetric Badge
    Chapter 54 Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise
  56. Altmetric Badge
    Chapter 55 Tight Approximation Bounds for Connectivity with a Color-Spanning Set
  57. Altmetric Badge
    Chapter 56 The Train Delivery Problem Revisited
  58. Altmetric Badge
    Chapter 57 The Distance 4-Sector of Two Points Is Unique
  59. Altmetric Badge
    Chapter 58 The Number of Different Unfoldings of Polyhedra
  60. Altmetric Badge
    Chapter 59 Computing the Smallest Color-Spanning Axis-Parallel Square
  61. Altmetric Badge
    Chapter 60 Euclidean Traveling Salesman Tours through Stochastic Neighborhoods
  62. Altmetric Badge
    Chapter 61 Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure
  63. Altmetric Badge
    Chapter 62 Approximate Čech Complex in Low and High Dimensions
  64. Altmetric Badge
    Chapter 63 Model Counting for Formulas of Bounded Clique-Width
  65. Altmetric Badge
    Chapter 64 Computing Plurality Points and Condorcet Points in Euclidean Space
  66. Altmetric Badge
    Chapter 65 Computing Minimum Tile Sets to Self-Assemble Color Patterns
  67. Altmetric Badge
    Chapter 66 A Probabilistic Analysis of Kademlia Networks
  68. Altmetric Badge
    Chapter 67 Approximating the Generalized Minimum Manhattan Network Problem
  69. Altmetric Badge
    Chapter 68 Minmax Regret 1-Facility Location on Uncertain Path Networks
Attention for Chapter 30: Terrain visibility with multiple viewpoints
Altmetric Badge

Mentioned by

twitter
2 X users

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
7 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.
Chapter title
Terrain visibility with multiple viewpoints
Chapter number 30
Book title
Algorithms and Computation
Published by
Springer, December 2014
DOI 10.1007/978-3-642-45030-3_30
Book ISBNs
978-3-64-245029-7, 978-3-64-245030-3
Authors

Hurtado Díaz, Fernando Alfredo, Ferran Hurtado, Maarten Löffler, Inês Matos, Vera Sacristán, Maria Saumell, Rodrigo I. Silveira, Frank Staals, Löffler, Maarten, Matos, Inés P., Sacristán Adinolfi, Vera, Saumell, Maria, Silveira, Rodrigo Ignacio, Staals, Frank

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.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 7 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 3 43%
Student > Doctoral Student 1 14%
Lecturer 1 14%
Student > Ph. D. Student 1 14%
Researcher 1 14%
Other 0 0%
Readers by discipline Count As %
Computer Science 6 86%
Engineering 1 14%