Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
33
views
0
references
Top references
cited by
1
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,042
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Algorithms and Computation
other
Editor(s):
Khaled Elbassioni
,
Kazuhisa Makino
Publication date
(Print):
2015
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Author and book information
Book
ISBN (Print):
978-3-662-48970-3
ISBN (Electronic):
978-3-662-48971-0
Publication date (Print):
2015
DOI:
10.1007/978-3-662-48971-0
SO-VID:
20f995cd-7cd2-4497-98e5-b6b7894564c7
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
An Optimal Algorithm for Tiling the Plane with a Translated Polyomino
pp. 14
Adaptive Point Location in Planar Convex Subdivisions
pp. 23
Competitive Local Routing with Constraints
pp. 35
Navigating Weighted Regions with Scattered Skinny Tetrahedra
pp. 49
On the Succinct Representation of Unlabeled Permutations
pp. 60
How to Select the Top k Elements from Evolving Data?
pp. 71
Optimal Search Trees with 2-Way Comparisons
pp. 83
Multidimensional Range Selection
pp. 95
On the Minimum Cost Range Assignment Problem
pp. 106
On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems
pp. 116
General Caching Is Hard: Even with Small Pages
pp. 129
The Secretary Problem with a Choice Function
pp. 140
The Benefit of Recombination in Noisy Evolutionary Search
pp. 151
Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples
pp. 165
Obtaining a Triangular Matrix by Independent Row-Column Permutations
pp. 176
Many-to-one Matchings with Lower Quotas: Algorithms and Complexity
pp. 188
Minimizing the Maximum Moving Cost of Interval Coverage
pp. 201
Heuristic Time Hierarchies via Hierarchies for Sampling Distributions
pp. 212
Unbounded Discrepancy of Deterministic Random Walks on Grids
pp. 223
Trading off Worst and Expected Cost in Decision Tree Problems
pp. 237
Sliding Token on Bipartite Permutation Graphs
pp. 248
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
pp. 259
Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms
pp. 271
Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs
pp. 285
Geometric Matching Algorithms for Two Realistic Terrains
pp. 296
Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and Stability
pp. 307
The 2-Center Problem in a Simple Polygon
pp. 318
Choice Is Hard
pp. 331
Fully Dynamic Betweenness Centrality
pp. 343
When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots
pp. 355
Cops and Robbers on String Graphs
pp. 367
Min-Power Covering Problems
pp. 381
Minimizing the Diameter of a Spanning Tree for Imprecise Points
pp. 393
Model-Based Classification of Trajectories
pp. 404
Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures
pp. 415
Unfolding Orthogonal Polyhedra with Linear Refinement
pp. 429
Colored Non-crossing Euclidean Steiner Forest
pp. 442
On a Generalization of Nemhauser and Trotter’s Local Optimization Theorem
pp. 453
Approximation Algorithms in the Successive Hitting Set Model
pp. 467
Generating Random Hyperbolic Graphs in Subquadratic Time
pp. 479
Provable Efficiency of Contraction Hierarchies with Randomized Preprocessing
pp. 491
Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty
pp. 505
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings
pp. 517
Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds
pp. 529
Computing the Gromov-Hausdorff Distance for Metric Trees
pp. 541
The VC-Dimension of Visibility on the Boundary of a Simple Polygon
pp. 555
Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)
pp. 566
Effectiveness of Structural Restrictions for Hybrid CSPs
pp. 578
Polynomial-Time Isomorphism Test of Groups that are Tame Extensions
pp. 590
Quantum Algorithm for Triangle Finding in Sparse Graphs
pp. 603
On Hardness of the Joint Crossing Number
pp. 614
An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
pp. 625
Constant Query Time $$(1+\epsilon )$$ -Approximate Distance Oracle for Planar Graphs
pp. 637
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
pp. 653
A New Approximate Min-Max Theorem with Applications in Cryptography
pp. 664
Give Me Another One!
pp. 677
On the Complexity of Computing Prime Tables
pp. 689
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games
pp. 703
Run Generation Revisited: What Goes Up May or May Not Come Down
pp. 715
Streaming Verification in Data Analysis
pp. 727
All-Around Near-Optimal Solutions for the Online Bin Packing Problem
pp. 740
Serving Online Requests with Mobile Servers
pp. 755
An In-place Framework for Exact and Approximate Shortest Unique Substring Queries
pp. 768
Inferring Strings from Full Abelian Periods
pp. 780
Toehold DNA Languages are Regular (Extended Abstract)
Similar content
1,042
Posterior Left Atrial Adipose Tissue Attenuation Assessed by Computed Tomography and Recurrence of Atrial Fibrillation After Catheter Ablation
Authors:
Mohammed El Mahdiui
,
Judit Simon
,
Jeff M Smit
…
Development, Implementation, and Evaluation of a Personalized Machine Learning Algorithm for Clinical Decision Support: Case Study With Shingles Vaccination
Authors:
Ji Chen
,
Sara Chokshi
,
Roshini Hegde
…
A Rare Case of Hibernoma Occasionally Identified by 18F-fluorodeoxyglucose Positron Emission Tomography/Computed Tomography in a Patient with Lung Cancer
Authors:
Daniele Penna
,
Natale Quartuccio
,
Claudio Testa
…
See all similar
Cited by
1
Short Plane Supports for Spatial Hypergraphs
Authors:
Mereke van Garderen
,
Thom Castermans
,
Wouter Meulemans
…
See all cited by