English
Algorithms and Computation
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 An Optimal Algorithm for Tiling the Plane with a Translated Polyomino
-
Altmetric BadgeChapter 2 Adaptive Point Location in Planar Convex Subdivisions
-
Altmetric BadgeChapter 3 Competitive Local Routing with Constraints
-
Altmetric BadgeChapter 4 Navigating Weighted Regions with Scattered Skinny Tetrahedra
-
Altmetric BadgeChapter 5 On the Succinct Representation of Unlabeled Permutations
-
Altmetric BadgeChapter 6 How to Select the Top k Elements from Evolving Data?
-
Altmetric BadgeChapter 7 Optimal Search Trees with 2-Way Comparisons
-
Altmetric BadgeChapter 8 Multidimensional Range Selection
-
Altmetric BadgeChapter 9 On the Minimum Cost Range Assignment Problem
-
Altmetric BadgeChapter 10 On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems
-
Altmetric BadgeChapter 11 General Caching Is Hard: Even with Small Pages
-
Altmetric BadgeChapter 12 The Secretary Problem with a Choice Function
-
Altmetric BadgeChapter 13 The Benefit of Recombination in Noisy Evolutionary Search
-
Altmetric BadgeChapter 14 Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples
-
Altmetric BadgeChapter 15 Obtaining a Triangular Matrix by Independent Row-Column Permutations
-
Altmetric BadgeChapter 16 Many-to-one Matchings with Lower Quotas: Algorithms and Complexity
-
Altmetric BadgeChapter 17 Minimizing the Maximum Moving Cost of Interval Coverage
-
Altmetric BadgeChapter 18 Heuristic Time Hierarchies via Hierarchies for Sampling Distributions
-
Altmetric BadgeChapter 19 Unbounded Discrepancy of Deterministic Random Walks on Grids
-
Altmetric BadgeChapter 20 Trading off Worst and Expected Cost in Decision Tree Problems
-
Altmetric BadgeChapter 21 Sliding Token on Bipartite Permutation Graphs
-
Altmetric BadgeChapter 22 Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
-
Altmetric BadgeChapter 23 Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms
-
Altmetric BadgeChapter 24 Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs
-
Altmetric BadgeChapter 25 Geometric Matching Algorithms for Two Realistic Terrains
-
Altmetric BadgeChapter 26 Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and Stability
-
Altmetric BadgeChapter 27 The 2-Center Problem in a Simple Polygon
-
Altmetric BadgeChapter 28 Choice Is Hard
-
Altmetric BadgeChapter 29 Fully Dynamic Betweenness Centrality
-
Altmetric BadgeChapter 30 When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots
-
Altmetric BadgeChapter 31 Cops and Robbers on String Graphs
-
Altmetric BadgeChapter 32 Min-Power Covering Problems
-
Altmetric BadgeChapter 33 Minimizing the Diameter of a Spanning Tree for Imprecise Points
-
Altmetric BadgeChapter 34 Model-Based Classification of Trajectories
-
Altmetric BadgeChapter 35 Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures
-
Altmetric BadgeChapter 36 Unfolding Orthogonal Polyhedra with Linear Refinement
-
Altmetric BadgeChapter 37 Colored Non-crossing Euclidean Steiner Forest
-
Altmetric BadgeChapter 38 On a generalization of Nemhauser and Trotter's local optimization theorem
-
Altmetric BadgeChapter 39 Approximation Algorithms in the Successive Hitting Set Model
-
Altmetric BadgeChapter 40 Generating Random Hyperbolic Graphs in Subquadratic Time
-
Altmetric BadgeChapter 41 Provable Efficiency of Contraction Hierarchies with Randomized Preprocessing
-
Altmetric BadgeChapter 42 Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty
-
Altmetric BadgeChapter 43 An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings
-
Altmetric BadgeChapter 44 Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds
-
Altmetric BadgeChapter 45 Algorithms and Computation
-
Altmetric BadgeChapter 46 The VC-Dimension of Visibility on the Boundary of a Simple Polygon
-
Altmetric BadgeChapter 47 Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)
-
Altmetric BadgeChapter 48 Effectiveness of Structural Restrictions for Hybrid CSPs
-
Altmetric BadgeChapter 49 Polynomial-Time Isomorphism Test of Groups that are Tame Extensions
-
Altmetric BadgeChapter 50 Quantum Algorithm for Triangle Finding in Sparse Graphs
-
Altmetric BadgeChapter 51 On Hardness of the Joint Crossing Number
-
Altmetric BadgeChapter 52 An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
-
Altmetric BadgeChapter 53 Constant Query Time $$(1+\epsilon )$$ -Approximate Distance Oracle for Planar Graphs
-
Altmetric BadgeChapter 54 Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
-
Altmetric BadgeChapter 55 A New Approximate Min-Max Theorem with Applications in Cryptography
-
Altmetric BadgeChapter 56 Give Me Another One!
-
Altmetric BadgeChapter 57 On the Complexity of Computing Prime Tables
-
Altmetric BadgeChapter 58 Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games
-
Altmetric BadgeChapter 59 Run Generation Revisited: What Goes Up May or May Not Come Down
-
Altmetric BadgeChapter 60 Streaming Verification in Data Analysis
-
Altmetric BadgeChapter 61 All-Around Near-Optimal Solutions for the Online Bin Packing Problem
-
Altmetric BadgeChapter 62 Serving Online Requests with Mobile Servers
-
Altmetric BadgeChapter 63 An In-place Framework for Exact and Approximate Shortest Unique Substring Queries
-
Altmetric BadgeChapter 64 Inferring Strings from Full Abelian Periods
-
Altmetric BadgeChapter 65 Toehold DNA Languages are Regular (Extended Abstract)
Altmetric Badge
Readers on
- mendeley
- 9 Mendeley