Irina Kostitsyna
Irina Kostitsyna
Zweryfikowany adres z tue.nl - Strona główna
Cytowane przez
Cytowane przez
Algorithmic Traffic Abstraction and its Application to NextGen Generic Airspace
G Sabhnani, A Yousefi, I Kostitsyna, J Mitchell, V Polishchuk, D Kierstead
10th AIAA Aviation Technology, Integration, and Operations (ATIO) Conference, 2010
Approximating (k, )-center clustering for curves
K Buchin, A Driemel, J Gudmundsson, M Horton, I Kostitsyna, M Löffler, ...
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
Beacon-based algorithms for geometric routing
M Biro, J Iwerks, I Kostitsyna, JSB Mitchell
Algorithms and Data Structures: 13th International Symposium, WADS 2013 …, 2013
Forming tile shapes with simple robots
R Gmyr, K Hinnenthal, I Kostitsyna, F Kuhn, D Rudolph, C Scheideler, ...
Natural Computing 19 (2), 375-390, 2020
Beacon based routing and coverage
M Biro, J Gao, J Iwerks, I Kostitsyna, JSB Mitchell
21st Fall Workshop on Computational Geometry, 2011
Shape recognition by a finite automaton robot
R Gmyr, K Hinnenthal, I Kostitsyna, F Kuhn, D Rudolph, C Scheideler
43rd International Symposium on Mathematical Foundations of Computer Science …, 2018
Global curve simplification
M van de Kerkhof, I Kostitsyna, M Löffler, M Mirzanezhad, C Wenk
arXiv preprint arXiv:1809.10269, 2018
Convex hull formation for programmable matter
JJ Daymude, R Gmyr, K Hinnenthal, I Kostitsyna, C Scheideler, AW Richa
Proceedings of the 21st International Conference on Distributed Computing …, 2020
On the complexity of minimum-link path problems
I Kostitsyna, M Löffler, V Polishchuk, F Staals
Journal of Computational Geometry 8 (2), 80-108, 2017
Combinatorics of beacon-based routing and coverage
M Biro, J Gao, J Iwerks, I Kostitsyna, JSB Mitchell
Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG …, 2013
Mapping polygons to the grid with small Hausdorff and Fréchet distance
WB Quirijn, I Kostitsyna, M van Kreveld, W Meulemans, W Sonke, ...
24th Annual European Symposium on Algorithms (ESA 2016) 57, 22:1--22:16, 2016
Algorithmic approaches to reconfigurable assembly systems
A Costa, A Abdel-Rahman, B Jenett, N Gershenfeld, I Kostitsyna, ...
2019 IEEE Aerospace Conference, 1-8, 2019
Gabriel triangulations and angle-monotone graphs: Local routing and recognition
N Bonichon, P Bose, P Carmi, I Kostitsyna, A Lubiw, S Verdonschot
Graph Drawing and Network Visualization: 24th International Symposium, GD …, 2016
Trajectory grouping structure under geodesic distance
I Kostitsyna, M Kreveld, M Löffler, B Speckmann, F Staals
Proc. 31st International Symposium on Computational Geometry, 2015
On minimizing crossings in storyline visualizations
I Kostitsyna, M Nöllenburg, V Polishchuk, A Schulz, D Strash
Graph Drawing and Network Visualization: 23rd International Symposium, GD …, 2015
Forming tile shapes with a single robot
R Gmyr, I Kostitsyna, F Kuhn, C Scheideler, T Strothmann
Abstr. European Workshop on Computational Geometry (EuroCG), 9-12, 2017
Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning
D Kirkpatrick, I Kostitsyna, V Polishchuk
Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)
K Buchin, I Kostitsyna, M Löffler, RI Silveira
Algorithmica 81, 2682-2715, 2019
An optimal algorithm to compute the inverse beacon attraction region
I Kostitsyna, B Kouhestani, S Langerman, D Rappaport
arXiv preprint arXiv:1803.05946, 2018
The painter’s problem: covering a grid with colored connected polygons
A van Goethem, I Kostitsyna, M van Kreveld, W Meulemans, M Sondag, ...
Graph Drawing and Network Visualization: 25th International Symposium, GD …, 2018
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20