The following pages link to (Q3992847):
Displaying 50 items.
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- Chaining algorithms for multiple genome comparison (Q2569405) (← links)
- On digital plane preimage structure (Q2573239) (← links)
- An exact and efficient approach for computing a cell in an arrangement of quadrics (Q2575587) (← links)
- On the two-dimensional Davenport-Schinzel problem (Q2638785) (← links)
- Non-convex contour reconstruction (Q2638822) (← links)
- Tetrahedrizing point sets in three dimensions (Q2638826) (← links)
- Generalization of the multipoint meshless FDM application to the nonlinear analysis (Q2655999) (← links)
- Optimistic optimization for continuous nonconvex piecewise affine functions (Q2663980) (← links)
- A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing (Q2670493) (← links)
- A fast and efficient algorithm for determining the connected orthogonal convex hulls (Q2671859) (← links)
- Understanding positioning from multiple images (Q2675295) (← links)
- Packing convex polygons in minimum-perimeter convex hulls (Q2679237) (← links)
- Separating bichromatic point sets in the plane by restricted orientation convex hulls (Q2694525) (← links)
- Monte-Carlo Valuation of American Options: Facts and New Algorithms to Improve Existing Methods (Q2917432) (← links)
- Abductive Reasoning in 2D Geospatial Problems (Q2926149) (← links)
- Optimal One-Dimensional Coverage by Unreliable Sensors (Q2949989) (← links)
- Spanning trees with low crossing number (Q3358265) (← links)
- Viscous fingering of miscible annular ring (Q3389431) (← links)
- Digital plane preimage structure (Q3438921) (← links)
- Exact Image Reconstruction from a Single Projection through Real Computation (Q3439189) (← links)
- On geometric automata which can nondeterministically choose auxiliary points (Q3484387) (← links)
- Multiway spatial joins (Q3507292) (← links)
- Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance (Q3511346) (← links)
- Line Facility Location in Weighted Regions (Q3511420) (← links)
- Simplified Planar Coresets for Data Streams (Q3512444) (← links)
- Polygon placement under translation and rotation (Q3816980) (← links)
- Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time (Q4210159) (← links)
- A penalty method for the identification of nonlinear elliptic differential operator (Q4302534) (← links)
- A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs (Q4557732) (← links)
- Spanners for Directed Transmission Graphs (Q4581909) (← links)
- Computation over algebraic structures and a classification of undecidable problems (Q4593236) (← links)
- Unique decomposition of homogeneous languages and application to isothetic regions (Q4629267) (← links)
- Constructing competitive tours from local information (Q4630252) (← links)
- A simple method for resolving degeneracies in Delaunay triangulations (Q4630259) (← links)
- Optimal shooting: Characterizations and applications (Q4645180) (← links)
- Lower bounds on algebraic random access machines (Q4645192) (← links)
- On determining optimal strategies in pursuit games in the plane (Q4645204) (← links)
- Geometric Aspects of the Space of Triangulations (Q4682464) (← links)
- Modélisation géométrique de la faisabilité de plusieurs mélanges (Q4694994) (← links)
- Computability of Partial Delaunay Triangulation and Voronoi Diagram [Extended Abstract] (Q4916186) (← links)
- Kolmogorov Complexity Theory over the Reals (Q4918012) (← links)
- The geometry of conservative programs (Q4961721) (← links)
- Dual‐tree fast exact max‐kernel search (Q4969941) (← links)
- (Q4998918) (← links)
- Density Independent Algorithms for Sparsifying k-Step Random Walks (Q5002617) (← links)
- On the optimal separating hyperplane for arbitrary sets: a generalization of the SVM formulation and a convex hull approach (Q5034937) (← links)
- Identifying parent locations in the Neyman-Scott process using Delaunay triangulation (Q5042189) (← links)
- A fast heuristic for approximating the minimum weight triangulation (Q5054821) (← links)
- Neighbours on a grid (Q5054822) (← links)
