Irene Parada

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 61

Top Topics

Delaunay Triangulations

Top Venues

J. Graph Algorithms Appl.

Publications

Sarita de Berg, Tim Ophelders, Irene Parada, Frank Staals, Jules Wulms
The Complexity of Geodesic Spanners using Steiner Points. CoRR (2024)
Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, Bettina Speckmann
Optimal In-Place Compaction of Sliding Cubes. SWAT (2024)
Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, Bettina Speckmann
Optimal In-Place Compaction of Sliding Cubes (Media Exposition). SoCG (2024)
Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber
Geometric Thickness of Multigraphs is ∃ ℝ-Complete. LATIN (1) (2024)
Oswin Aichholzer, Ruy Fabila Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber
Perfect Matchings with Crossings. Algorithmica 86 (3) (2024)
Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter
On k-Plane Insertion into Plane Drawings. CoRR (2024)
Ivor van der Hoog, Fabian Klute, Irene Parada, Patrick Schnider
Barking dogs: A Fréchet distance variant for detour detection. CoRR (2024)
Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber
Geometric Thickness of Multigraphs is ∃R-complete. CoRR (2023)
Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, Bettina Speckmann
Optimal In-Place Compaction of Sliding Cubes. CoRR (2023)
Alan Arroyo, Fabian Klute, Irene Parada, Birgit Vogtenhuber, Raimund Seidel, Tilo Wiedera
Inserting One Edge into a Simple Drawing is Hard. Discret. Comput. Geom. 69 (3) (2023)
Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber
Graphs with large total angular resolution. Theor. Comput. Sci. 943 (2023)
Ivor van der Hoog, Irene Parada, Eva Rotenberg
Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs. CoRR (2022)
Stefan Felsner, Michael Hoffmann, Kristin Knorr, Jan Kyncl, Irene Parada
On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens. J. Graph Algorithms Appl. 26 (3) (2022)
Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber
On Compatible Matchings. J. Graph Algorithms Appl. 26 (2) (2022)
Oswin Aichholzer, Thomas Hackl, Maarten Löffler, Alexander Pilz, Irene Parada, Manfred Scheucher, Birgit Vogtenhuber
Blocking Delaunay Triangulations from the Exterior. CoRR (2022)
Oswin Aichholzer, Alfredo García, Irene Parada, Birgit Vogtenhuber, Alexandra Weinberger
. GD (2022)
Oswin Aichholzer, Ruy Fabila Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber
Perfect Matchings with Crossings. IWOCA (2022)
Nathan van Beusekom, Irene Parada, Bettina Speckmann
Crossing Numbers of Beyond-Planar Graphs Revisited. J. Graph Algorithms Appl. 26 (1) (2022)
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Efficient segment folding is hard. Comput. Geom. 104 (2022)
Hugo A. Akitaya, Maarten Löffler, Irene Parada
How to Fit a Tree in a Box. Graphs Comb. 38 (5) (2022)
Hugo A. Akitaya, Erik D. Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms
Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares. SWAT (2022)
Oswin Aichholzer, Alfredo García, Irene Parada, Birgit Vogtenhuber, Alexandra Weinberger
. CoRR (2022)
Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber
Crossing-Optimal Extension of Simple Drawings. ICALP (2021)
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
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. Algorithmica 83 (5) (2021)
Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt
Edge-Minimum Saturated k-Planar Drawings. Graph Drawing (2021)
Irene Parada, Vera Sacristán, Rodrigo I. Silveira
A new meta-module design for efficient reconfiguration of modular robots. Auton. Robots 45 (4) (2021)
Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr
Upward Point Set Embeddings of Paths and Trees. WALCOM (2021)
Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Jules Wulms
Compacting Squares. CoRR (2021)
Nathan van Beusekom, Irene Parada, Bettina Speckmann
Crossing Numbers of Beyond-Planar Graphs Revisited. CoRR (2021)
Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán
Characterizing Universal Reconfigurability of Modular Pivoting Robots. SoCG (2021)
Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber
On Compatible Matchings. CoRR (2021)
Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber
On Compatible Matchings. WALCOM (2021)
Man-Kwun Chiu, Erik D. Demaine, Yevhenii Diomidov, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy
New Results in Sona Drawing: Hardness and TSP Separation. CCCG (2020)
Stefan Felsner, Michael Hoffmann, Kristin Knorr, Irene Parada
with No Empty Lens. Graph Drawing (2020)
Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán
Characterizing Universal Reconfigurability of Modular Pivoting Robots. CoRR (2020)
Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera
Inserting One Edge into a Simple Drawing Is Hard. WG (2020)
Tillmann Miltzow, Irene Parada, Willem Sonke, Bettina Speckmann, Jules Wulms
Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition). SoCG (2020)
Stefan Felsner, Michael Hoffmann, Kristin Knorr, Irene Parada
with No Empty Lens. CoRR (2020)
Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr
Upward Point Set Embeddings of Paths and Trees. CoRR (2020)
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Efficient Segment Folding is Hard. CoRR (2020)
Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber
Crossing-Optimal Extension of Simple Drawings. CoRR (2020)
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Minimal Representations of Order Types by Geometric Graphs. J. Graph Algorithms Appl. 24 (4) (2020)
Man-Kwun Chiu, Erik D. Demaine, Yevhenii Diomidov, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy
New Results in Sona Drawing: Hardness and TSP Separation. CoRR (2020)
Fabian Klute, Irene Parada
Saturated k-Plane Drawings with Few Edges. CoRR (2020)
Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyncl, Irene Parada, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber
A superlinear lower bound on the number of 5-holes. J. Comb. Theory, Ser. A 173 (2020)
Alan Arroyo, Martin Derka, Irene Parada
Extending Simple Drawings. Graph Drawing (2019)
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
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. CoRR (2019)
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Minimal Representations of Order Types by Geometric Graphs. CoRR (2019)
Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera
Extending simple drawings with one edge is hard. CoRR (2019)
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Ecient Segment Folding is Hard. CCCG (2019)
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Minimal Representations of Order Types by Geometric Graphs. Graph Drawing (2019)
Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber
Graphs with large total angular resolution. CoRR (2019)
Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber
Graphs with Large Total Angular Resolution. Graph Drawing (2019)
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
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. ESA (2019)
Oswin Aichholzer, Ruy Fabila Monroy, Adrian Fuchs, Carlos Hidalgo-Toscano, Irene Parada, Birgit Vogtenhuber, Francisco Zaragoza
On the 2-Colored Crossing Number. Graph Drawing (2019)
Oswin Aichholzer, Ruy Fabila Monroy, Adrian Fuchs, Carlos Hidalgo-Toscano, Irene Parada, Birgit Vogtenhuber, Francisco Zaragoza
On the 2-colored crossing number. CoRR (2019)
Alan Arroyo, Martin Derka, Irene Parada
Extending Simple Drawings. CoRR (2019)
Hugo A. Akitaya, Maarten Löffler, Irene Parada
How to Fit a Tree in a Box. Graph Drawing (2018)
Hugo A. Akitaya, Maarten Löffler, Irene Parada
How to Fit a Tree in a Box. CoRR (2018)
Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyncl, Irene Parada, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber
A Superlinear Lower Bound on the Number of 5-Holes. SoCG (2017)
Irene Parada, Vera Sacristán, Rodrigo I. Silveira
A new meta-module for efficient reconfiguration of hinged-units modular robots. ICRA (2016)