The following pages link to Valentin Polishchuk (Q390126):
Displaying 47 items.
- Convex transversals (Q390129) (← links)
- Routing multi-class traffic flows in the plane (Q427052) (← links)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
- Analysing local algorithms in location-aware quasi-unit-disk graphs (Q642985) (← links)
- Simple wriggling is hard unless you are a fat hippo (Q692941) (← links)
- The minimum backlog problem (Q888427) (← links)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- Minimum-perimeter enclosures (Q963415) (← links)
- Geometric stable roommates (Q976079) (← links)
- A simple local 3-approximation algorithm for vertex cover (Q987844) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- Almost stable matchings by truncating the Gale-Shapley algorithm (Q1959728) (← links)
- Most vital segment barriers (Q2285111) (← links)
- Altitude terrain guarding and guarding uni-monotone polygons (Q2331221) (← links)
- Optimizing airspace closure with respect to politicians' egos (Q2347008) (← links)
- Order-\(k\) \(\alpha\)-hulls and \(\alpha\)-shapes (Q2350607) (← links)
- Minimum-link paths revisited (Q2450201) (← links)
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty (Q2515038) (← links)
- On Polygonal Paths with Bounded Discrete-Curvature: The Inflection-Free Case (Q2945663) (← links)
- On Minimizing Crossings in Storyline Visualizations (Q2959756) (← links)
- Shortest path to a segment and quickest visibility queries (Q2970466) (← links)
- (Q2978407) (← links)
- On the complexity of minimum-link path problems (Q3132885) (← links)
- (Q3301019) (← links)
- Two New Classes of Hamiltonian Graphs (Q3503520) (← links)
- Improved Approximation Algorithms for Relay Placement (Q3541099) (← links)
- The Snowblower Problem (Q3564308) (← links)
- Thick non-crossing paths and minimum-cost flows in polygonal domains (Q3602854) (← links)
- Routing a maximum number of disks through a scene of moving obstacles (Q3602923) (← links)
- A Local 2-Approximation Algorithm for the Vertex Cover Problem (Q3646226) (← links)
- Computing the L1 Geodesic Diameter and Center of a Polygonal Domain (Q4601866) (← links)
- Optimal Geometric Flows via Dual Programs (Q4635532) (← links)
- Convex Transversals (Q5199230) (← links)
- Faster Algorithms for Minimum-Link Paths with Restricted Orientations (Q5199281) (← links)
- Recognizing a DOG is Hard but not when it is Thin and Unit (Q5282814) (← links)
- Geometric <i>k</i> Shortest Paths (Q5363016) (← links)
- Shortest path to a segment and quickest visibility queries (Q5368719) (← links)
- Shape approximation using k-order alpha-hulls (Q5405869) (← links)
- THE TSP AND THE SUM OF ITS MARGINAL VALUES (Q5485789) (← links)
- (Q5875617) (← links)
- The snowblower problem (Q5894212) (← links)
- Maximum thick paths in static and dynamic environments (Q5901409) (← links)
- Maximum thick paths in static and dynamic environments (Q5902231) (← links)
- Geometric Secluded Paths and Planar Satisfiability (Q6059972) (← links)
- On flipping the Fréchet distance (Q6610317) (← links)
- On flipping the Fréchet distance (Q6647773) (← links)
