The following pages link to Irina Kostitsyna (Q489758):
Displaying 46 items.
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- Simple wriggling is hard unless you are a fat hippo (Q692941) (← links)
- Folding polyominoes with holes into a cube (Q827332) (← links)
- Forming tile shapes with simple robots (Q1621139) (← links)
- Embedding ray intersection graphs and global curve simplification (Q2151460) (← links)
- Self-approaching paths in simple polygons (Q2173458) (← links)
- Unconventional computation and natural computation. 19th international conference, UCNC 2021, Espoo, Finland, October 18--22, 2021. Proceedings (Q2245938) (← links)
- Most vital segment barriers (Q2285111) (← links)
- Optimizing airspace closure with respect to politicians' egos (Q2347008) (← links)
- Region-based approximation of probability distributions (for visibility between imprecise points among obstacles) (Q2415360) (← links)
- Toward unfolding doubly covered \(n\)-stars (Q2695478) (← links)
- Beacon-Based Algorithms for Geometric Routing (Q2842154) (← links)
- On Minimizing Crossings in Storyline Visualizations (Q2959756) (← links)
- Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition (Q2961543) (← links)
- (Q2978407) (← links)
- On the complexity of minimum-link path problems (Q3132885) (← links)
- Folding Polyominoes into (Poly)Cubes (Q4557731) (← links)
- Self-approaching paths in simple polygons (Q4580095) (← links)
- (Q4606291) (← links)
- Homotopy measures for representative trajectories (Q4606296) (← links)
- The Painter’s Problem: Covering a Grid with Colored Connected Polygons (Q4625138) (← links)
- Shape recognition by a finite automaton robot (Q5005154) (← links)
- (Q5057207) (← links)
- Fragile complexity of comparison-based algorithms (Q5075734) (← links)
- Global Curve Simplification (Q5075813) (← links)
- Preprocessing Ambiguous Imprecise Points (Q5088972) (← links)
- Convex partial transversals of planar regions (Q5091044) (← links)
- An optimal algorithm to compute the inverse beacon attraction region (Q5115823) (← links)
- Non-crossing geometric steiner arborescences (Q5136274) (← links)
- Theoretical analysis of beaconless geocast protocols in 1D (Q5195107) (← links)
- Region-based Approximation Algorithms for Visibility between Imprecise Locations (Q5232526) (← links)
- Approximating (<i>k</i>, <i>ℓ</i>)-center clustering for curves (Q5236374) (← links)
- Trajectory Grouping Structure under Geodesic Distance (Q5368720) (← links)
- Dots & Polygons (Media Exposition) (Q6060040) (← links)
- Designing art galleries (Media Exposition) (Q6060043) (← links)
- (Q6079226) (← links)
- Forming tile shapes with simple robots (Q6151177) (← links)
- (Q6159887) (← links)
- Dots & Boxes Is PSPACE-Complete (Q6168439) (← links)
- Morphing planar graph drawings through 3D (Q6169513) (← links)
- Multi-robot motion planning of \(k\)-colored discs is PSPACE-hard (Q6487587) (← links)
- Unlabeled multi-robot motion planning with tighter separation bounds (Q6539529) (← links)
- Compacting squares: input-sensitive in-place reconfiguration of sliding squares (Q6544059) (← links)
- Preprocessing imprecise points for the Pareto front (Q6575202) (← links)
- On the power of bounded asynchrony: convergence by autonomous robots with limited visibility (Q6601211) (← links)
- Sorting under partial (interval order) information (Q6642264) (← links)
