The Embroidery Problem. - Esther M. Arkin; George Hart; Joondong Kim; Irina Kostitsyna; Joseph S. B. Mitchell; Girishkumar Sabhnani; Steven Skiena (CCCG, 2008)

Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning. - David G. Kirkpatrick; Irina Kostitsyna; Valentin Polishchuk (CCCG, 2011)

Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box. - Esther M. Arkin; Alon Efrat; George Hart; Irina Kostitsyna; Alexander Kröller; Joseph S. B. Mitchell; Valentin Polishchuk (FUN, 2012)

Simple Wriggling is Hard Unless You Are a Fat Hippo. - Irina Kostitsyna; Valentin Polishchuk (Theory Comput. Syst., 2012)

Combinatorics of Beacon Routing and Coverage. - Michael Biro; Jie Gao 001; Justin Iwerks; Irina Kostitsyna; Joseph S. B. Mitchell (CCCG, 2013)

Beacon-Based Algorithms for Geometric Routing. - Michael Biro; Justin Iwerks; Irina Kostitsyna; Joseph S. B. Mitchell (WADS, 2013)

Local Redesigning of Airspace Sectors - Irina Kostitsyna; Joseph S. B. Mitchell (CoRR, 2013)

Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing. - Helmut Alt; Esther M. Arkin; Alon Efrat; George Hart; Ferran Hurtado; Irina Kostitsyna; Alexander Kröller; Joseph S. B. Mitchell; Valentin Polishchuk (Theory Comput. Syst., 2014)

Region-based Approximation Algorithms for Visibility between Imprecise Locations. - Kevin Buchin; Irina Kostitsyna; Maarten Löffler; Rodrigo I. Silveira (ALENEX, 2015)

Trajectory Grouping Structure under Geodesic Distance. - Irina Kostitsyna; Marc J. van Kreveld; Maarten Löffler; Bettina Speckmann; Frank Staals (SoCG, 2015)

On Minimizing Crossings in Storyline Visualizations. - Irina Kostitsyna; Martin Nöllenburg; Valentin Polishchuk; André Schulz 001; Darren Strash (GD, 2015)

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). - Kyle Burke; Erik D. Demaine; Harrison Gregg; Robert A. Hearn; Adam Hesterberg; Michael Hoffmann 001; Hiro Ito; Irina Kostitsyna; Jody Leonard; Maarten Löffler; Aaron Santiago; Christiane Schmidt 001; et al. (JCDCGG, 2015)

Optimizing airspace closure with respect to politicians' egos. - Irina Kostitsyna; Maarten Löffler; Valentin Polishchuk (Theor. Comput. Sci., 2015)

Critical Placements of a Square or Circle amidst Trajectories for Junction Detection. - Ingo van Duijn; Irina Kostitsyna; Marc J. van Kreveld; Maarten Löffler (CCCG, 2016)

Mapping Polygons to the Grid with Small Hausdorff and Fréchet Distance. - Quirijn W. Bouts; Irina Kostitsyna; Marc J. van Kreveld; Wouter Meulemans; Willem Sonke; Kevin Verbeek (ESA, 2016)

Homotopy Measures for Representative Trajectories. - Erin W. Chambers; Irina Kostitsyna; Maarten Löffler; Frank Staals (ESA, 2016)

Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. - Nicolas Bonichon; Prosenjit Bose; Paz Carmi; Irina Kostitsyna; Anna Lubiw; Sander Verdonschot (GD, 2016)

Single-Player and Two-Player Buttons & Scissors Games. - Kyle Burke; Erik D. Demaine; Harrison Gregg; Robert A. Hearn; Adam Hesterberg; Michael Hoffmann 001; Hiro Ito; Irina Kostitsyna; Jody Leonard; Maarten Löffler; Aaron Santiago; Christiane Schmidt 001; et al. (CoRR, 2016)

The Painter's Problem: Covering a Grid with Colored Connected Polygons. - Arthur van Goethem; Irina Kostitsyna; Marc J. van Kreveld; Wouter Meulemans; Max Sondag; Jules Wulms (GD, 2017)

Non-Crossing Geometric Steiner Arborescences. - Irina Kostitsyna; Bettina Speckmann; Kevin Verbeek (ISAAC, 2017)

Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares. - Zachary Abel; Brad Ballinger; Erik D. Demaine; Martin L. Demaine; Jeff Erickson 001; Adam Hesterberg; Hiro Ito; Irina Kostitsyna; Jayson Lynch; Ryuhei Uehara (J. Inf. Process., 2017)

Computing nonsimple polygons of minimum perimeter. - Sándor P. Fekete; Andreas Haas; Michael Hemmer; Michael Hoffmann 001; Irina Kostitsyna; Dominik Krupke; Florian Maurer 001; Joseph S. B. Mitchell; Arne Schmidt 001; Christiane Schmidt 001; Julian Troegel (J. Comput. Geom., 2017)

On the complexity of minimum-link path problems. - Irina Kostitsyna; Maarten Löffler; Valentin Polishchuk; Frank Staals (J. Comput. Geom., 2017)

Theoretical analysis of beaconless geocast protocols in 1D. - Joachim Gudmundsson; Irina Kostitsyna; Maarten Löffler; Tobias Müller 001; Vera Sacristán; Rodrigo I. Silveira (ANALCO, 2018)

An Optimal Algorithm to Compute the Inverse Beacon Attraction Region. - Irina Kostitsyna; Bahram Kouhestani; Stefan Langerman; David Rappaport (SoCG, 2018)

Convex Partial Transversals of Planar Regions. - Vahideh Keikha; Mees van de Kerkhof; Marc J. van Kreveld; Irina Kostitsyna; Maarten Löffler; Frank Staals; Jérôme Urhausen; Jordi L. Vermeulen; Lionov Wiratma (ISAAC, 2018)

Toward Unfolding Doubly Covered n-Stars. - Hugo A. Akitaya; Brad Ballinger; Mirela Damian; Erik D. Demaine; Martin L. Demaine; Robin Y. Flatland; Irina Kostitsyna; Jason S. Ku; Stefan Langerman; Joseph O'Rourke; Ryuhei Uehara (JCDCGGG, 2018)

Shape Recognition by a Finite Automaton Robot. - Robert Gmyr; Kristian Hinnenthal; Irina Kostitsyna; Fabian Kuhn; Dorian Rudolph; Christian Scheideler (MFCS, 2018)

Approximating (k, 𝓁)-center clustering for curves. - Kevin Buchin; Anne Driemel; Joachim Gudmundsson; Michael Horton 001; Irina Kostitsyna; Maarten Löffler (CoRR, 2018)

On Optimal Min-# Curve Simplification Problem. - Mees van de Kerkhof; Irina Kostitsyna; Maarten Löffler; Majid Mirzanezhad; Carola Wenk (CoRR, 2018)

Folding Polyominoes into (Poly)Cubes. - Oswin Aichholzer; Michael Biro; Erik D. Demaine; Martin L. Demaine; David Eppstein; Sándor P. Fekete; Adam Hesterberg; Irina Kostitsyna; Christiane Schmidt 001 (Int. J. Comput. Geom. Appl., 2018)

Preprocessing Ambiguous Imprecise Points. - Ivor van der Hoog; Irina Kostitsyna; Maarten Löffler; Bettina Speckmann (SoCG, 2019)

Fragile Complexity of Comparison-Based Algorithms. - Peyman Afshani; Rolf Fagerberg; David Hammer; Riko Jacob; Irina Kostitsyna; Ulrich Meyer 001; Manuel Penschuck; Nodari Sitchinava (ESA, 2019)

Global Curve Simplification. - Mees van de Kerkhof; Irina Kostitsyna; Maarten Löffler; Majid Mirzanezhad; Carola Wenk (ESA, 2019)

A Sampling-based Strategy for Distributing Taxis in a Road Network for Occupancy Maximization (GIS Cup). - Kevin Buchin; Irina Kostitsyna; Bram Custers; Martijn Struijs (SIGSPATIAL/GIS, 2019)

Approximating (k, ℓ)-center clustering for curves. - Kevin Buchin; Anne Driemel; Joachim Gudmundsson; Michael Horton 001; Irina Kostitsyna; Maarten Löffler; Martijn Struijs (SODA, 2019)

Most Vital Segment Barriers. - Irina Kostitsyna; Maarten Löffler; Valentin Polishchuk; Frank Staals (WADS, 2019)

Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles). - Kevin Buchin; Irina Kostitsyna; Maarten Löffler; Rodrigo I. Silveira (Algorithmica, 2019)

Designing Art Galleries (Media Exposition). - Toon van Benthem; Kevin Buchin; Irina Kostitsyna; Stijn Slot (SoCG, 2020)

Dots & Polygons (Media Exposition). - Kevin Buchin; Mart Hagedoorn; Irina Kostitsyna; Max van Mulken; Jolan Rensen; Leo van Schooten (SoCG, 2020)

Turning Machines. - Irina Kostitsyna; Cai Wood; Damien Woods (DNA, 2020)

Route-preserving Road Network Generalization. - Mees van de Kerkhof; Irina Kostitsyna; Marc J. van Kreveld; Maarten Löffler; Tim Ophelders (SIGSPATIAL/GIS, 2020)

Convex Hull Formation for Programmable Matter. - Joshua J. Daymude; Robert Gmyr; Kristian Hinnenthal; Irina Kostitsyna; Christian Scheideler; Andréa W. Richa (ICDCN, 2020)

Self-approaching paths in simple polygons. - Prosenjit Bose; Irina Kostitsyna; Stefan Langerman (Comput. Geom., 2020)

Dots & Polygons. - Kevin Buchin; Mart Hagedoorn; Irina Kostitsyna; Max van Mulken; Jolan Rensen; Leo van Schooten (CoRR, 2020)

Algorithmic Approaches to Reconfigurable Assembly Systems. - Allan Costa; Benjamin Jenett; Irina Kostitsyna; Amira Abdel-Rahman; Neil Gershenfeld; Kenneth C. Cheung (CoRR, 2020)

Forming tile shapes with simple robots. - Robert Gmyr; Kristian Hinnenthal; Irina Kostitsyna; Fabian Kuhn; Dorian Rudolph; Christian Scheideler; Thim Strothmann (Nat. Comput., 2020)

Multi-Robot Motion Planning of k-Colored Discs Is PSPACE-Hard. - Thomas Brocken; G. Wessel van der Heijden; Irina Kostitsyna; Lloyd E. Lo-Wong; Remco J. A. Surtel (FUN, 2021)

Embedding Ray Intersection Graphs and Global Curve Simplification. - Mees van de Kerkhof; Irina Kostitsyna; Maarten Löffler (GD, 2021)

Autonomous Mobile Robots: Refining the Computational Landscape. - Kevin Buchin; Paola Flocchini; Irina Kostitsyna; Tom Peters; Nicola Santoro; Koichi Wada 001 (IPDPS Workshops, 2021)

Dots & Boxes Is PSPACE-Complete. - Kevin Buchin; Mart Hagedoorn; Irina Kostitsyna; Max van Mulken (MFCS, 2021)

Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility. - David G. Kirkpatrick; Irina Kostitsyna; Alfredo Navarra; Giuseppe Prencipe; Nicola Santoro (PODC, 2021)

Folding polyominoes with holes into a cube. - Oswin Aichholzer; Hugo A. Akitaya; Kenneth C. Cheung; Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Linda Kleist; Irina Kostitsyna; Maarten Löffler; Zuzana Masárová; Klara Mundilova; Christiane Schmidt 001 (Comput. Geom., 2021)

Compacting Squares. - Irina Kostitsyna; Irene Parada; Willem Sonke; Bettina Speckmann; Jules Wulms (CoRR, 2021)

Chasing Puppies: Mobile Beacon Routing on Closed Curves. - Mikkel Abrahamsen; Jeff Erickson 001; Irina Kostitsyna; Maarten Löffler; Till Miltzow; Jérôme Urhausen; Jordi L. Vermeulen; Giovanni Viglietta (J. Comput. Geom., 2021)

Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. - Bahareh Banyassady; Mark de Berg; Karl Bringmann; Kevin Buchin; Henning Fernau; Dan Halperin; Irina Kostitsyna; Yoshio Okamoto; Stijn Slot (SoCG, 2022)

Fault-Tolerant Shape Formation in the Amoebot Model. - Irina Kostitsyna; Christian Scheideler; Daniel Warner 001 (DNA, 2022)

Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. - Irina Kostitsyna; Christian Scheideler; Daniel Warner 001 (SAND, 2022)

On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis. - Kevin Buchin; Paola Flocchini; Irina Kostitsyna; Tom Peters; Nicola Santoro; Koichi Wada 001 (SIROCCO, 2022)

Preprocessing Imprecise Points for the Pareto Front. - Ivor van der Hoog; Irina Kostitsyna; Maarten Löffler; Bettina Speckmann (SODA, 2022)

Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares. - Hugo A. Akitaya; Erik D. Demaine; Matias Korman; Irina Kostitsyna; Irene Parada; Willem Sonke; Bettina Speckmann; Ryuhei Uehara; Jules Wulms (SWAT, 2022)

Brief Announcement: An Effective Geometric Communication Structure for Programmable Matter. - Irina Kostitsyna; Tom Peters; Bettina Speckmann (DISC, 2022)

The Shortest Path with Increasing Chords in a Simple Polygon. - Mart Hagedoorn; Irina Kostitsyna (CoRR, 2022)

Minimum Scan Cover and Variants: Theory and Experiments. - Kevin Buchin; Alexander Hill; Sándor P. Fekete; Linda Kleist; Irina Kostitsyna; Dominik Krupke; Roel Lambers; Martijn Struijs (ACM J. Exp. Algorithmics, 2022)

Fast Reconfiguration for Programmable Matter. - Irina Kostitsyna; Tom Peters; Bettina Speckmann (DISC, 2023)

Morphing Planar Graph Drawings Through 3D. - Kevin Buchin; William S. Evans; Fabrizio Frati; Irina Kostitsyna; Maarten Löffler; Tim Ophelders; Alexander Wolff 001 (Comput. Geom. Topol., 2023)

Universal Coating in the 3D Hybrid Model. - Irina Kostitsyna; David Liedtke; Christian Scheideler (CoRR, 2023)

Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 23091). - Aaron T. Becker; Sándor P. Fekete; Irina Kostitsyna; Matthew J. Patitz; Damien Woods; Ioannis Chatzigiannakis (Dagstuhl Reports, 2023)

Optimal In-Place Compaction of Sliding Cubes (Media Exposition). - Irina Kostitsyna; Tim Ophelders; Irene Parada; Tom Peters; Willem Sonke; Bettina Speckmann (SoCG, 2024)

Universal Coating by 3D Hybrid Programmable Matter. - Irina Kostitsyna; David Liedtke; Christian Scheideler (SIROCCO, 2024)

Optimal In-Place Compaction of Sliding Cubes. - Irina Kostitsyna; Tim Ophelders; Irene Parada; Tom Peters; Willem Sonke; Bettina Speckmann (SWAT, 2024)

Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints. - MIT-NASA Space Robots Team; Josh Brunner; Kenneth C. Cheung; Erik D. Demaine; Jenny Diomidova; Christine Gregg; Della H. Hendrickson; Irina Kostitsyna (SWAT, 2024)

Sorting under partial (interval order) information. - Ivor van der Hoog; Irina Kostitsyna; Maarten Löffler; Bettina Speckmann (J. Comput. Geom., 2024)

Ultralight, strong, and self-reprogrammable mechanical metamaterials. - Christine Gregg; Damiana Catanoso; Olivia Formoso; Irina Kostitsyna; Megan Ochalek; Taiwo Olatunde; In-Won Park; Frank Sebastianelli; Elizabeth Taylor; Greenfield Trinh; Kenneth C. Cheung (Sci. Robotics, 2024)

Turning machines: a simple algorithmic model for molecular robotics. - Irina Kostitsyna; Cai Wood; Damien Woods (Nat. Comput., 2024)

On the power of bounded asynchrony: convergence by autonomous robots with limited visibility. - David G. Kirkpatrick; Irina Kostitsyna; Alfredo Navarra; Giuseppe Prencipe; Nicola Santoro (Distributed Comput., 2024)

On the computational power of energy-constrained mobile robots. - Kevin Buchin; Paola Flocchini; Irina Kostitsyna; Tom Peters; Nicola Santoro; Koichi Wada 001 (Inf. Comput., 2025)

Sweeping x-monotone pseudolines. - Therese Biedl; Erin W. Chambers; Irina Kostitsyna; Günter Rote (CoRR, 2025)

Distributed Diamond Formation of Sliding Squares. - Irina Kostitsyna; David Liedtke; Christian Scheideler (CoRR, 2025)