The following pages link to (Q5358292):
Displaying 50 items.
- Ripser: efficient computation of Vietoris-Rips persistence barcodes (Q133720) (← links)
- On the longest spanning tree with neighborhoods (Q777263) (← links)
- Maximum-area and maximum-perimeter rectangles in polygons (Q827336) (← links)
- Guaranteed deterministic approach to superhedging: sensitivity of solutions of the Bellman-Isaacs equations and numerical methods (Q830988) (← links)
- Finding a largest-area triangle in a terrain in near-linear time (Q832865) (← links)
- Hyperplane equipartitions plus constraints (Q1621410) (← links)
- Improved bounds for guarding plane graphs with edges (Q1741583) (← links)
- Algorithmic enumeration of surrounding polygons (Q1983143) (← links)
- Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment (Q1984612) (← links)
- A new proof of Balinski's theorem on the connectivity of polytopes (Q2032731) (← links)
- The first-order flexibility of a crystallographic framework (Q2049362) (← links)
- Discrete Helly-type theorems for pseudohalfplanes (Q2066005) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- Local versus global distances for zigzag and multi-parameter persistence modules (Q2080087) (← links)
- Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
- On the restricted \(k\)-Steiner tree problem (Q2084651) (← links)
- Envy-free division in the presence of a dragon (Q2106889) (← links)
- Minimum number of partial triangulations (Q2107503) (← links)
- The Varchenko-Gel'fand ring of a cone (Q2109063) (← links)
- Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds (Q2111184) (← links)
- Minimum-link shortest paths for polygons amidst rectilinear obstacles (Q2123290) (← links)
- Emotion recognition in talking-face videos using persistent entropy and neural networks (Q2127513) (← links)
- Guaranteed deterministic approach to superhedging: a numerical experiment (Q2130707) (← links)
- An improved embedded discrete fracture model and domain connectivity algorithms on 3D unstructured grids (Q2137941) (← links)
- Nearest neighbor control for practical stabilization of passive nonlinear systems (Q2139389) (← links)
- Constrained random matching (Q2155237) (← links)
- Multivariate volume, Ehrhart, and \(h^\ast \)-polynomials of polytropes (Q2156367) (← links)
- Tukey depth histograms (Q2169954) (← links)
- An efficient algorithm for the proximity connected two center problem (Q2169955) (← links)
- Geometric pattern matching reduces to \(k\)-SUM (Q2172655) (← links)
- Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus (Q2193420) (← links)
- Approximate range closest-pair queries (Q2206740) (← links)
- Trajectory planning for an articulated probe (Q2206741) (← links)
- Bundled crossings revisited (Q2206831) (← links)
- Optimal facility location problem on polyhedral terrains using descending paths (Q2210515) (← links)
- Packing 13 circles in an equilateral triangle (Q2227519) (← links)
- Sparse convex hull coverage (Q2230408) (← links)
- Largest triangles in a polygon (Q2230417) (← links)
- Improved approximate Rips filtrations with shifted integer lattices and cubical complexes (Q2239807) (← links)
- QuickhullDisk: a faster convex hull algorithm for disks (Q2286150) (← links)
- Sphere packing and quantum gravity (Q2303146) (← links)
- Unavoidable complexes, via an elementary equivariant index theory (Q2307309) (← links)
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension (Q2415381) (← links)
- Minmax regret maximal covering location problems with edge demands (Q2668649) (← links)
- Computing kemeny rankings from \(d\)-Euclidean preferences (Q2695434) (← links)
- Reconstruction of Weakly Simple Polygons from Their Edges (Q3177902) (← links)
- Using discrete Ricci curvatures to infer COVID-19 epidemic network fragility and systemic risk (Q3382343) (← links)
- Oriented area as a Morse function on polygon spaces (Q4993952) (← links)
- Self-polar polytopes (Q4998744) (← links)
- Prescribing symmetries and automorphisms for polytopes (Q4998750) (← links)
