If you made any changes in Pure these will be visible here soon.

Personal profile

Research profile

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. 

Academic background

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. 

 

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2008 2019

An optimal algorithm to compute the inverse beacon attraction region

Kostitsyna, I., Kouhestani, B., Langerman, S. & Rappaport, D., 2018, Proc. 34th International Symposium on Computational Geometry (SoCG). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 55:1-55:14 (Leibniz International Proceedings in Informatics (LIPIcs); vol. 99)

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
Trees (mathematics)
Robotics
Trajectories

Theoretical analysis of beaconless geocast protocols in 1D

Gudmundssons, J., Kostitsyna, I., Löffler, M., Müller, T., Sacristán, V. & Silveira, R. I., 2018, Proc. 15th Workshop on Analytic Algorithmics and Combinatorics (ANALCO). p. 62-76 15 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
File
Network protocols
Wireless ad hoc networks
Routing protocols
Computer simulation

Self-approaching paths in simple polygons

Bose, P., Kostitsyna, I. & Langerman, S., 2017, Proc. 33rd International Symposium on Computational Geometry (SoCG). p. 1-15 15 p. 21. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 77)

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
File
Simple Polygon
Path
Polygon
Curve
Models of Computation

On the complexity of minimum-link path problems

Kostitsyna, I., Löffler, M., Polishchuk, V. & Staals, F., 2017, In : Journal of Computational Geometry. 8, 2, p. 80-108 29 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Ray tracing
Computer graphics
Telecommunication links
Computational complexity
Hardness
9 Citations (Scopus)

Beacon-based algorithms for geometric routing

Biro, M., Iwerks, J., Kostitsyna, I. & Mitchell, J. S. B., 2013, Proc. 13th International Symposium on Algorithms and Data Structures (WADS). Dehne, F., Solis-Oba, R. & Sack, J. R. (eds.). Dordrecht: Springer, p. 158-169 12 p. (Lecture Notes in Computer Science; vol. 8037)

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
File

Courses

Data structures

1/09/12 → …

Course

Geometric algorithms

1/09/15 → …

Course