Irina Kostitsyna

According to our database1, Irina Kostitsyna authored at least 31 papers between 2008 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles).
Algorithmica, 2019

Approximating (k, ℓ)-center clustering for curves.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Preprocessing Ambiguous Imprecise Points.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Shape Recognition by a Finite Automaton Robot.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Convex Partial Transversals of Planar Regions.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Forming Tile Shapes with Simple Robots.
Proceedings of the DNA Computing and Molecular Programming - 24th International Conference, 2018

An Optimal Algorithm to Compute the Inverse Beacon Attraction Region.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Theoretical analysis of beaconless geocast protocols in 1D.
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017
Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares.
JIP, 2017

Non-Crossing Geometric Steiner Arborescences.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

The Painter's Problem: Covering a Grid with Colored Connected Polygons.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Self-Approaching Paths in Simple Polygons.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Computing Nonsimple Polygons of Minimum Perimeter.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition.
Proceedings of the Graph Drawing and Network Visualization, 2016

Homotopy Measures for Representative Trajectories.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Mapping Polygons to the Grid with Small Hausdorff and Fréchet Distance.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

On the Complexity of Minimum-Link Path Problems.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Critical Placements of a Square or Circle amidst Trajectories for Junction Detection.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

On Minimizing Crossings in Storyline Visualizations.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Trajectory Grouping Structure under Geodesic Distance.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

Folding Polyominoes into (Poly)Cubes.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Region-based Approximation Algorithms for Visibility between Imprecise Locations.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing.
Theory Comput. Syst., 2014

Optimizing Airspace Closure with Respect to Politicians' Egos.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013
Beacon-Based Algorithms for Geometric Routing.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Combinatorics of Beacon Routing and Coverage.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011
Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Simple Wriggling Is Hard Unless You Are a Fat Hippo.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2008
The Embroidery Problem.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008


  Loading...