A new meta-module for efficient reconfiguration of hinged-units modular robots. - Irene Parada; Vera Sacristán; Rodrigo I. Silveira (ICRA, 2016)

Ecient Segment Folding is Hard. - Takashi Horiyama; Fabian Klute; Matias Korman; Irene Parada; Ryuhei Uehara; Katsuhisa Yamanaka (CCCG, 2019)

On the 2-Colored Crossing Number. - Oswin Aichholzer; Ruy Fabila Monroy; Adrian Fuchs; Carlos Hidalgo-Toscano; Irene Parada; Birgit Vogtenhuber; Francisco Zaragoza (GD, 2019)

Extending Simple Drawings. - Alan Arroyo; Martin Derka; Irene Parada (GD, 2019)

Extending simple drawings with one edge is hard. - Alan Arroyo; Fabian Klute; Irene Parada; Raimund Seidel; Birgit Vogtenhuber; Tilo Wiedera (CoRR, 2019)

New Results in Sona Drawing: Hardness and TSP Separation. - Man-Kwun Chiu; Erik D. Demaine; Yevhenii Diomidov; David Eppstein; Robert A. Hearn; Adam Hesterberg; Matias Korman; Irene Parada; Mikhail Rudoy (CCCG, 2020)

Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition). - Tillmann Miltzow; Irene Parada; Willem Sonke; Bettina Speckmann; Jules Wulms (SoCG, 2020)

On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. - Stefan Felsner; Michael Hoffmann 001; Kristin Knorr; Irene Parada (GD, 2020)

Saturated k-Plane Drawings with Few Edges. - Fabian Klute; Irene Parada (CoRR, 2020)

Upward Point Set Embeddings of Paths and Trees. - Elena Arseneva; Pilar Cano; Linda Kleist; Tamara Mchedlidze; Saeed Mehrabi 004; Irene Parada; Pavel Valtr 001 (CoRR, 2020)

A superlinear lower bound on the number of 5-holes. - Oswin Aichholzer; Martin Balko; Thomas Hackl; Jan Kyncl; Irene Parada; Manfred Scheucher; Pavel Valtr 001; Birgit Vogtenhuber (J. Comb. Theory A, 2020)

Minimal Representations of Order Types by Geometric Graphs. - Oswin Aichholzer; Martin Balko; Michael Hoffmann 001; Jan Kyncl; Wolfgang Mulzer; Irene Parada; Alexander Pilz; Manfred Scheucher; Pavel Valtr 001; Birgit Vogtenhuber; Emo Welzl (J. Graph Algorithms Appl., 2020)

Characterizing Universal Reconfigurability of Modular Pivoting Robots. - Hugo A. Akitaya; Erik D. Demaine; Andrei Gonczi; Dylan H. Hendrickson; Adam Hesterberg; Matias Korman; Oliver Korten; Jayson Lynch; Irene Parada; Vera Sacristán (SoCG, 2021)

Crossing-Optimal Extension of Simple Drawings. - Robert Ganian; Thekla Hamm; Fabian Klute; Irene Parada; Birgit Vogtenhuber (ICALP, 2021)

Upward Point Set Embeddings of Paths and Trees. - Elena Arseneva; Pilar Cano; Linda Kleist; Tamara Mchedlidze; Saeed Mehrabi 001; Irene Parada; Pavel Valtr 001 (WALCOM, 2021)

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. - Hugo A. Akitaya; Esther M. Arkin; Mirela Damian; Erik D. Demaine; Vida Dujmovic; Robin Y. Flatland; Matias Korman; Belén Palop; Irene Parada; André van Renssen; Vera Sacristán (Algorithmica, 2021)

A new meta-module design for efficient reconfiguration of modular robots. - Irene Parada; Vera Sacristán; Rodrigo I. Silveira (Auton. Robots, 2021)

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

Shooting Stars in Simple Drawings of Km, n. - Oswin Aichholzer; Alfredo García 002; Irene Parada; Birgit Vogtenhuber; Alexandra Weinberger (GD, 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)

Efficient segment folding is hard. - Takashi Horiyama; Fabian Klute; Matias Korman; Irene Parada; Ryuhei Uehara; Katsuhisa Yamanaka (Comput. Geom., 2022)

Blocking Delaunay Triangulations from the Exterior. - Oswin Aichholzer; Thomas Hackl; Maarten Löffler; Alexander Pilz; Irene Parada; Manfred Scheucher; Birgit Vogtenhuber (CoRR, 2022)

How to Fit a Tree in a Box. - Hugo A. Akitaya; Maarten Löffler; Irene Parada (Graphs Comb., 2022)

On Compatible Matchings. - Oswin Aichholzer; Alan Arroyo; Zuzana Masárová; Irene Parada; Daniel Perz; Alexander Pilz; Josef Tkadlec; Birgit Vogtenhuber (J. Graph Algorithms Appl., 2022)

Crossing Numbers of Beyond-Planar Graphs Revisited. - Nathan van Beusekom; Irene Parada; Bettina Speckmann (J. Graph Algorithms Appl., 2022)

On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. - Stefan Felsner; Michael Hoffmann 001; Kristin Knorr; Jan Kyncl; Irene Parada (J. Graph Algorithms Appl., 2022)

Graphs with large total angular resolution. - Oswin Aichholzer; Matias Korman; Yoshio Okamoto; Irene Parada; Daniel Perz; André van Renssen; Birgit Vogtenhuber (Theor. Comput. Sci., 2023)

Inserting One Edge into a Simple Drawing is Hard. - Alan Arroyo; Fabian Klute; Irene Parada; Birgit Vogtenhuber; Raimund Seidel; Tilo Wiedera (Discret. Comput. Geom., 2023)

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

Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs. - Ivor van der Hoog; Irene Parada; Eva Rotenberg (ESA, 2024)

On k-Plane Insertion into Plane Drawings. - Julia Katheder; Philipp Kindermann; Fabian Klute; Irene Parada; Ignaz Rutter (GD, 2024)

The Complexity of Geodesic Spanners Using Steiner Points. - Sarita de Berg; Tim Ophelders; Irene Parada; Frank Staals; Jules Wulms (ISAAC, 2024)

Geometric Thickness of Multigraphs is ∃ ℝ-Complete. - Henry Förster; Philipp Kindermann; Tillmann Miltzow; Irene Parada; Soeren Terziadis; Birgit Vogtenhuber (LATIN (1), 2024)

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

Augmenting Plane Straight-Line Graphs to Meet Parity Constraints. - Aleksander Bjørn Grodt Christiansen; Linda Kleist; Irene Parada; Eva Rotenberg (WG, 2024)

Barking dogs: A Fréchet distance variant for detour detection. - Ivor van der Hoog; Fabian Klute; Irene Parada; Patrick Schnider (CoRR, 2024)

Computing crossing numbers with topological and geometric restrictions. - Thekla Hamm; Fabian Klute; Irene Parada (CoRR, 2024)

Edge-minimum saturated k-planar drawings. - Steven Chaplick; Fabian Klute; Irene Parada; Jonathan Rollin; Torsten Ueckerdt (J. Graph Theory, 2024)

Perfect Matchings with Crossings. - Oswin Aichholzer; Ruy Fabila Monroy; Philipp Kindermann; Irene Parada; Rosna Paul; Daniel Perz; Patrick Schnider; Birgit Vogtenhuber (Algorithmica, 2024)

Crossing and Independent Families Among Polygons. - Anna Brötzner; Robert Ganian; Thekla Hamm; Fabian Klute; Irene Parada (WADS, 2025)

Algorithms for Distance Problems in Continuous Graphs. - Sergio Cabello; Delia Garijo; Antonia Kalb; Fabian Klute; Irene Parada; Rodrigo I. Silveira (WADS, 2025)