Irina Kostitsyna is an assistant professor in the Applied Geometric Algorithms group in the Department of Mathematics and Computer Science. Her research interests lie in the field of computational geometry, both in its theoretical and applied aspects. In particular, her main topics of research include geometric algorithms for mobile agents, including path planning and routing; and for programmable matter, including shape reconfiguration problems.
Irina received her BSc and MSc in Applied Physics and Mathematics from Moscow Institute of Physics and Technology, and her PhD in Computer Science from Stony Brook University. After that, Irina spent two years as a postdoc in TU Eindhoven, and one year as a postdoc in Université libre de Bruxelles. In 2017 she returned to TU Eindhoven as an assistant professor.
An optimal algorithm to compute the inverse beacon attraction region34th International Symposium on Computational Geometry (SoCG 2018) (2018)
Theoretical analysis of beaconless geocast protocols in 1DFifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (2018)
Self-approaching paths in simple polygons33rd International Symposium on Computational Geometry (SoCG 2017) (2017)
On the complexity of minimum-link path problemsJournal of Computational Geometry (2017)
Beacon-based algorithms for geometric routingProc. 13th International Symposium on Algorithms and Data Structures (WADS) (2013)