The following pages link to Sergei Bespamyatnikh (Q294805):
Displaying 37 items.
- (Q178853) (redirect page) (← links)
- Covering a set of points by two axis-parallel boxes (Q294806) (← links)
- Enumerating longest increasing subsequences and patience sorting (Q294846) (← links)
- Algorithms for shortest paths and \(d\)-cycle problems (Q876687) (← links)
- Selecting distances in arrangements of hyperplanes spanned by points. (Q878011) (← links)
- (Q1361417) (redirect page) (← links)
- On constructing minimum spanning trees in \(R_ 1^ k\) (Q1361418) (← links)
- An optimal algorithm for closest-pair maintenance (Q1380774) (← links)
- Queries with segments in Voronoi diagrams (Q1567303) (← links)
- Generalizing ham sandwich cuts to equitable subdivisions (Q1591052) (← links)
- Fast algorithms for approximating distances (Q1601023) (← links)
- Packing two disks in a polygon (Q1614067) (← links)
- An efficient algorithm for enumeration of triangulations (Q1862130) (← links)
- An O\((n\log n)\) algorithm for the zoo-keeper's problem (Q1869741) (← links)
- Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree (Q1879253) (← links)
- (Q2708487) (← links)
- (Q2779372) (← links)
- (Q3024786) (← links)
- (Q3024790) (← links)
- Cylindrical Hierarchy for Deforming Necklaces (Q3082908) (← links)
- On a Conjecture on Wiener Indices in Combinatorial Chemistry (Q3082958) (← links)
- (Q4250174) (← links)
- (Q4252280) (← links)
- (Q4331201) (← links)
- (Q4434784) (← links)
- (Q4449249) (← links)
- Computing homotopic shortest paths in the plane (Q4458869) (← links)
- (Q4471350) (← links)
- Efficient algorithms for centers and medians in interval and circular-arc graphs (Q4537621) (← links)
- (Q4551354) (← links)
- OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS (Q4762912) (← links)
- AN OPTIMAL MORPHING BETWEEN POLYLINES (Q4818557) (← links)
- COMPUTING CLOSEST POINTS FOR SEGMENTS (Q4818603) (← links)
- Discrete and Computational Geometry (Q5897089) (← links)
- Discrete and Computational Geometry (Q5897090) (← links)
- LATIN 2004: Theoretical Informatics (Q5901653) (← links)
- An efficient algorithm for the three-dimensional diameter problem (Q5932809) (← links)
