Irene Parada

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